The first round of the interview was taken through HackerRank. This was followed by an interview with an interviewer.

The questions covered:

• Bitwise operations
• DHCP transactions
• Packet processing
• Complexity of Binary Search Tree algorithms
• Linked list operations
• Array problem-solving questions
• Multithreading

1. DHCP DORA sequence: When are broadcast and unicast packets transmitted in DORA?

2. Mutex explanation: Is a mutex really needed when one thread reads data from a queue and another thread writes data into the queue?

3. Significance of pthread_cond_variable.

4. Write a program to print only distinct characters (adqk) from a given input string of repeated characters (ddadkkqkqa).

5. Find the middle node in a linked list.

6. Set and reset a particular bit in an integer.

7. Explain the average, best, and worst-case time complexity of a Binary Search Tree data structure.

8. Write a program to process IP and UDP headers from the packet buffer and also process TLV data from the payload.

9. Write a program to print the number of input strings needed to form the target string. Input = {'the', 'atmel', 'hen'}, Target = {thehat}. Output = 3 strings because 'the', 'h' from 'hen', and 'at' from 'atmel'.