BCS Data Structures and Algorithms 2

Question 1

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

Accepted Answer

Inorder

Answer

Inorder traversal (left → root → right) of a BST produces nodes in non-decreasing sorted order.

Question 2

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

Accepted Answer

Queue

Answer

BFS uses a queue to process nodes level by level in FIFO order.

Question 3

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

Accepted Answer

O(1)

Answer

Hash table insertion is O(1) on average due to direct address computation via the hash function.

Question 4

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

Accepted Answer

O(V²)

Answer

An adjacency matrix stores a V×V boolean matrix, requiring O(V²) space regardless of the number of edges.

Question 5

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

Accepted Answer

Dijkstra's algorithm

Answer

Dijkstra's algorithm greedily finds the shortest path from a source to all vertices in graphs with non-negative weights.

BCS - Bachelor Of Computer Science Degree Practice Test