Wiley Edge DSA Quiz-1

Arrays provide constant-time access to individual elements based on their indices, making them efficient for random access.

In a singly linked list, you typically need to traverse the list from the beginning to access the last element since each node points to the next node but not the previous one.

A queue is suitable for implementing a to-do list where tasks are added at the end and processed in a First-In-First-Out (FIFO) order.

In a stack, the pop operation removes the top element from the stack.

Stacks follow the Last-In-First-Out (LIFO) principle, where the last element pushed onto the stack is the first one to be popped off.

A circular buffer can implement a queue efficiently, providing both enqueue and dequeue operations in constant time (O(1)).

Stacks are commonly used for managing function calls and local variables because they follow the Last-In-First-Out (LIFO) principle, which is suitable for function call and return operations.

Queues ensure that elements are processed in the order they were added, following the First-In-First-Out (FIFO) principle.

Breadth-first search (BFS) is commonly implemented using a queue data structure to explore nodes in a graph in a level-by-level manner, following the FIFO principle.

Merge Sort has a time complexity of O(n log n) in the worst case, making it efficient for large lists.