BCS Data Structures and Algorithms 2

Question 1

Which traversal of a BST visits nodes in ascending sorted order?

Accepted Answer

Inorder

Answer

Preorder

Answer

Postorder

Answer

Level-order

Question 2

What data structure is typically used to implement Breadth-First Search (BFS)?

Accepted Answer

Queue

Answer

Stack

Answer

Heap

Answer

Array

Question 3

What is the time complexity of inserting an element into a hash table on average?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n log n)

Question 4

A graph with V vertices and E edges represented as an adjacency matrix requires how much space?

Accepted Answer

O(V²)

Answer

O(V)

Answer

O(E)

Answer

O(V + E)

Question 5

Which algorithm finds the shortest path in a weighted graph with non-negative edge weights?

Accepted Answer

Dijkstra's algorithm

Answer

Bellman-Ford

Answer

Floyd-Warshall

Answer

Prim's algorithm

Question 6

What is a heap data structure primarily used for?

Accepted Answer

Implementing priority queues

Answer

Sorting linked lists

Answer

Storing key-value pairs

Answer

Balancing binary trees