Infinera Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on OOPS and OS mainly.

Q1. What are Little Endian and Big Endian in the context of computer architecture?
Ans. 
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
• Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.

• Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.

• Endianness can affect data transmission between systems with different byte orders.
Answered by AI
Add your answer
Q2. Write a program to determine if your system is little-endian or big-endian.
Add your answer
Q3. What is the volatile keyword in programming?
Ans. 
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
• Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.

• It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.

• Commonly used in embedded systems pr...read more
Answered by AI
Add your answer
Q4. What is the use of a function pointer in C?
View 1 more answer
Q5. Design a data structure to implement multi-threading.
Add your answer
Q6. What does a kernel do?
Ans. 
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
• Manages system resources such as CPU, memory, and I/O devices

• Provides a bridge between software applications and hardware components

• Handles tasks such as process scheduling, memory management, and device drivers

• Controls communication between hardware and software layers
Answered by AI
Add your answer
Q7. What is a storage class in programming?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Q1. Check if the linked list is palindrome or not
Ans. 
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
• Traverse the linked list to find the middle node

• Reverse the second half of the linked list

• Compare the first half with the reversed second half to check for palindrome
Answered by AI
Add your answer
Q2. C string questions
Add your answer

Q1. Operating systems questions
Add your answer
Q2. Linked list and system design question
Add your answer

Q1. Linked list and double pointers
Add your answer

Binary search and design a data-structure to do insert, delete and get random in O(1)

Q1. Delete a node in a linked list. Whose pointer is given.
Ans. 
To delete a node in a linked list when given a pointer to that node, copy the next node's data and adjust pointers.
• 1. Given a pointer to the node to be deleted, we cannot directly access the previous node.

• 2. Copy the data from the next node to the current node.

• 3. Adjust the current node's pointer to skip the next node.

• 4. Free the memory of the next node to avoid memory leaks.

• Example: If deleting node with value 3 in 1 ...read more
Answered by AI
Add your answer
Q2. C pointers related debugging question.
Add your answer