Broadcom Embedded Software Developer Interview Questions and Answers

A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.

• A program is a collection of instructions that are executed by a computer to perform a specific task.

• A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.

• A thread is a sequence of instructions within...read more

To delete a node in a linked list, we need to adjust the pointers of the previous and next nodes.

• Find the node to be deleted by traversing the linked list

• Adjust the pointers of the previous and next nodes to skip the node to be deleted

• Free the memory occupied by the node to be deleted

A function pointer is a variable that stores the address of a function. Volatile type is used to declare variables that can be modified by external factors.

• Function pointers are used to pass functions as arguments to other functions.

• Volatile type is used when a variable's value can be changed unexpectedly by external factors.

• Function pointers can be used to implement callbacks or event handling mechanisms.

• Volatile type...read more

Experienced software developer with expertise in Java, Python, and SQL

• Proficient in Java, Python, and SQL programming languages

• Developed web applications using Java Spring framework

• Experience with database management and optimization using SQL

• Worked on various software projects in a team environment

Swap even and odd bits in a given number

• Create a mask for even bits and odd bits

• Shift even bits to right and odd bits to left

• Combine even and odd bits using bitwise OR operator

Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

• For unsorted array, use nested loops to compare each element with every other element until the sum is found

• For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

• Complexity for unsorted array is O(n^2) and for sorted array is O(n)

Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

• Incrementing a pointer moves it to the next memory location of the same data type

• Decrementing a pointer moves it to the previous memory location of the same data type

• The address of operator (&) returns the memory address of a variable

• The value at operator (*) returns the value sto

To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

• Check if the point's x-coordinate is greater than the left edge of the rectangle

• Check if the point's x-coordinate is less than the right edge of the rectangle

• Check if the point's y-coordinate is greater than the top edge of the rectangle

• Check if the point's y-coordinate is less than the b...read more

To find line that divides rectangle into 2 equal halves through a point inside it.

• Find the center of the rectangle

• Draw a line from the center to the given point

• Extend the line to the opposite side of the rectangle

• The extended line will divide the rectangle into 2 equal halves

There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

• There are 2^8 (256) possible combinations of 8-bit signed numbers.

• There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

• To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

• Therefore, the total number of possible combinations is 256 +

Find duplicates in an array of elements in 0(n) time and 0(1) space.

• Use the property of inputs to your advantage

• Iterate through the array and mark elements as negative

• If an element is already negative, it is a duplicate

• Return all the negative elements as duplicates

Write a custom memcpy function with boundary condition handling.

• Use pointers to copy data from source to destination.

• Check for NULL pointers and zero length cases.

• Use a loop to copy data byte by byte.

• Handle overlapping memory regions with caution.

Find intersection point of two linked lists and optimize solution.

• Traverse both lists and find their lengths

• Move the head of the longer list to the same distance as the shorter list

• Traverse both lists in parallel until they meet at the intersection point

• Use hash table to store visited nodes for faster lookup

• Use two pointers, one starting from the head of each list, and move them at the same pace until they meet at the

Missing number in a given series

• Check the pattern of the series

• Look for any arithmetic or geometric progression

• Try to find the difference between consecutive numbers

• Use mathematical formulas to solve the problem