Flipkart GRiD DSA Quiz 2

Explanation :
When using a linked list to simulate a stack, new elements should be inserted at the head of the linked list.
In a stack implemented using a linked list, the top of the stack is represented by the head of the linked list. Whenever a new element is pushed onto the stack, it becomes the new top of the stack, and it should be inserted at the head of the linked list.
This approach ensures that the most recently inserted element is always at the top of the stack, allowing for efficient push and pop operations.
We should insert a new element at the head of the linked list when using a linked list to simulate a stack.

Explanation:
The time complexity of the DFS algorithm for traversing a graph with V vertices and E edges is O(V + E).
It visits each vertex and each edge once, resulting in a linear time complexity.

Explanation:
The Bellman-Ford Algorithm is not a Greedy Algorithm. It is used to find the shortest path in a weighted graph, and it can handle negative weight edges, unlike Greedy Algorithms.

Explanation:
The Inorder traversal visits the nodes in the order: Left subtree, Root, Right subtree.

Explanation:
Quicksort is an example of a Divide and Conquer algorithm. It recursively divides the array into subarrays, sorts them independently, and then combines the sorted subarrays to obtain a fully sorted array.

Explanation:
The most suitable data structure for implementing a dictionary with fast search and insertion operations is a Hash Table. Hash Tables provide constant-time average case search and insertion operations.

Explanation:
A Linked List is commonly used to implement a cache with a limited capacity. It allows efficient removal and insertion of elements at both ends, making it suitable for managing the least recently used items in a cache.

Explanation:
Divide and Conquer is used to efficiently find the closest pair of points in a 2D plane. The algorithm recursively divides the plane, finds the closest pairs in each part, and then combines the results to determine the overall closest pair.

Explanation:
The Ford-Fulkerson Algorithm is used to find the maximum flow in a flow network. It iteratively augments the flow along the paths from the source to the sink until no more augmenting paths exist.

Explanation:
QuickSort is an in-place comparison-based sorting algorithm with a time complexity of
O(n log n) in the average and worst case. It partitions the array based on a chosen pivot element.