Tuesday, December 23, 2014

Cavium Network Interview Questions

Cavium Network Interview Questions
Cavium Network Interview Questions
++++++++++++++++++++++++++++++++++

1. What is offset of() macro will work?? will it consider padding ??...

2. Swap the Bit's from x location to y location..!!!
3. Write a function which takes arguments such as bitwise swap, word wise swap, bitwise swap and completes the same
4. How to determine the Big-endian and Little-Endian of machine??
5. Please describe regarding the structure padding and how the __attribute__((packed)) works to remove the structure padding
6. How do you determine the linked list got a circular loop within the list?
7. Reverse the linked list both Recursive and Iterative way.
8. What are the boot stages involved with the boot up of Linux. Why the MMU is initialized two times instead of single??
9. How will the primary boot loader detect the MMC card without any driver, exactly how it will know the format of the disc to read the MBR
10. Why there is a Two stage boot loader instead of simple Single Boot stage process
11. What is the High-Mem and how it is useful in Linux
12. Position Independent and Position Dependent code in Linux?? Do you mean that standard shared libraries can also be made position Independent Code while compiling??
13. Structure padding was also called as holes...!! Can you access them with your normal pointer??
14. What are differences in typedef and
#define?
15. How the DMA coherency is achieved?? Will it need the CPU to come into picture to flush the data to disk??
16. How do you know that your DMA Engine is capable of the scatter-gather??? Can you implement if it not capable??
17. Debugging the pthreads with GDB how?? Can we pause/suspend/kill a thread??
18. What is the dynamic debugging in Linux kernel??? Do you know kgdb??

>-------------------> Hit/Like/Share >------------------------>

For more questions follow/Like.


CLICK --> For more fresh question being asked in various company follow us at facebook. 

No comments:

Post a Comment