embedUR Systems Interview Questions and Answers

To find the middle element of a stack, use an auxiliary stack or count elements while popping to identify the middle.

• Use an Auxiliary Stack: Push all elements onto a new stack while counting, then pop elements until reaching the middle index.

• Count Elements: Keep a count of total elements while popping, then push elements back to the original stack after finding the middle.

• Example: For a stack with elements [1, 2, ...read more

To reverse an array of strings, iterate through half of the array and swap elements from start and end.

• Iterate through half of the array

• Swap elements from start and end of the array

Pointers in C are variables that store memory addresses. They are used to access and manipulate data directly in memory.

• Pointers are declared using the * symbol, like int *ptr;

• Pointers can be used to pass variables by reference to functions

• Pointers are commonly used for dynamic memory allocation with functions like malloc() and free()

• Pointers can be used to create data structures like linked lists and trees

TCP is connection-oriented, reliable, and slower, while UDP is connectionless, unreliable, and faster.

• TCP is connection-oriented, meaning a connection must be established before data can be transmitted.

• TCP is reliable, as it ensures all data is received in the correct order without errors.

• TCP is slower than UDP due to the overhead of establishing and maintaining connections.

• UDP is connectionless, meaning data can ...read more

A flip-flop is a digital circuit that can store a single bit of information.

• It has two stable states, 0 and 1.

• It is used in sequential logic circuits.

• Examples include D flip-flop, JK flip-flop, and T flip-flop.

Quick sort works by selecting a pivot element and sorting the array by divide and conquer.

• Select a pivot element from the array

• Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot

• Recursively apply the above steps to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array