LS Automotive India Process Quality Engineer Interview Questions and Answers

Reverse a linked list

• Iterative approach: Traverse the list and change the pointers to reverse the list

• Recursive approach: Recursively reverse the rest of the list and change the pointers

• Use a stack to push all the nodes and then pop them to create a reversed list

Stack is a data structure that follows Last In First Out (LIFO) principle.

• Stack can be implemented using arrays or linked lists.

• Push operation adds an element to the top of the stack.

• Pop operation removes the top element from the stack.

• Peek operation returns the top element without removing it.

• Stack overflow occurs when the stack is full and push operation is performed.

• Stack underflow occurs when the stack is empty and

Queues are a data structure that follows the FIFO principle.

• Queues can be implemented using arrays or linked lists.

• Enqueue adds an element to the end of the queue, while dequeue removes an element from the front.

• Peek returns the element at the front of the queue without removing it.

• Queues are used in scheduling, buffering, and breadth-first search algorithms.