DSA Round 3

Which of the following statements about a queue is false?

• Follows FIFO

• Deletion happens at front

• Insertion happens at rear

• Allows insertion and deletion at both ends

Which of these data structures can be used to implement a priority queue?

• Stack

• Heap

• Hash Map

• Array

what is the auxiliary space complexity of Merge Sort?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following is a self-balancing BST?

• Binary Search Tree

• AVL Tree

• Heap

• Trie

Which traversal is used in depth-first search (DFS)?

• Inorder

• Postorder

• Preorder

• Any of Pre, Post

In a circular queue of size N, if front = rear, the queue is:

• Empty

• Full

• Overflow

• Underflow

Which one is an example of divide-and-conquer algorithm?

• Merge Sort

• Bubble Sort

• Linear Search

• BFS

The best data structure for implementing BFS is:

• Stack

• Queue

• Priority Queue

• Tree

Which of these data structures allows insertion and deletion at both ends?

• Queue

• Deque

• Stack

• Priority Queue

Which of the following algorithms uses a greedy approach?

• Kruskal's Algorithm

• Floyd Warshall

• Bellman-Ford

• Merge Sort