Data Structures and Algorithms Quiz

Which of the following data structures is used to implement recursion?

• Queue

• Stack

• Linked List

• Tree

Which sorting algorithm has the best worst-case time complexity?

• Bubble Sort

• Merge Sort

• Quick Sort

• Insertion Sort

What is the time complexity of accessing an element in a hash table?

• O(1)

• O(log n)

• O(n)

• O(n^2)

What is the time complexity of searching an element in a Binary Search Tree (BST)?

• O(log n)

• O(n)

• O(n log n)

• O(1)

Which of the following is not a stable sorting algorithm?

• Merge Sort

• Bubble Sort

• Insertion Sort

• Quick Sort

Which of the following algorithms is used for finding the shortest path in a weighted graph?

• Dijkstra’s Algorithm

• Prim’s Algorithm

• Kruskal’s Algorithm

• Depth-First Search (DFS)

Which of the following is the best description of a "heap" data structure?

• A complete binary tree where each node is greater than or equal to its children (Max-Heap).

• A sorted binary tree.

• A graph with no cycles.

• A linear data structure.

What is the time complexity of the best-case scenario in Quick Sort?

• O(n)

• O(n log n)

• O(log n)

• O(n^2)

Which of the following operations does not apply to a Queue?

• Enqueue

• Dequeue

• Peek

• Insert at any position

Which of the following data structures is most efficient for implementing breadth-first search (BFS) on a graph?

• Stack

• Queue

• Linked List

• Array