Broadcom C Developer Interview Questions, Process, and Tips

Round duration - 30 minutes
Round difficulty - Easy

Q1. How do you search for a node in a linked list?
Ans. 
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
• Start at the head of the linked list

• Iterate through each node by following the 'next' pointer

• Compare the value of each node with the target value

• Return the node if found, otherwise return null
Answered by AI
Add your answer
Q2. How do you detect a loop in a linked list?
Ans. 
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If there is a loop, the two pointers will eventually meet.

• Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Answered by AI
Add your answer
Q3. Implement a stack using a singly linked list.
Ans. 
Implement a stack using a singly linked list
• Create a Node class with data and next pointer

• Create a Stack class with top pointer pointing to the top of the stack

• Implement push, pop, and peek operations by manipulating the linked list

• Example: Node class - Node { int data; Node next; }
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. What is the top view of a binary tree?
Ans. 
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
• The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

• Nodes at the same horizontal distance from the root are considered at the same level in the top view.

• If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...read more
Answered by AI
Add your answer
Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
Ans. 
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
• Identify the node to be deleted by traversing the list

• Update the previous node's next pointer to skip the node to be deleted

• Free the memory allocated to the node to be deleted
Answered by AI
Add your answer

Q1. He asked about Heap, stack segment
Add your answer
Q2. He asked os related ques like semaphore, paging
Add your answer

Linkedlist questions

Q1. Depth Os and C
Add your answer
Q2. Multi threading and semaphores
Add your answer

Medium coding qs with technical interview

Q1. Reverse an array
Ans. 
Reverse an array of strings
• Create a new array and iterate through the original array in reverse order, adding each element to the new array

• Use built-in array methods like reverse() or spread operator for a more concise solution

• Ensure to handle edge cases like empty array or null values
Answered by AI
Add your answer