IT IT Data Structures and Algorithms 2

Question 1

Which graph traversal algorithm uses a queue and visits all neighbors before going deeper?

Accepted Answer

Breadth-First Search

Answer

Breadth-First Search (BFS) uses a queue to explore nodes level by level, visiting all neighbors before moving deeper.

Question 2

What is the worst-case time complexity of QuickSort?

Accepted Answer

O(n²)

Answer

QuickSort degrades to O(n²) when the pivot consistently produces unbalanced partitions, such as with an already-sorted array.

Question 3

Which data structure is most efficient for implementing a priority queue?

Accepted Answer

Binary Heap

Answer

A binary heap provides O(log n) insertion and O(log n) deletion of the minimum/maximum, making it ideal for priority queues.

Question 4

What does Big-O notation primarily describe?

Accepted Answer

The upper bound of an algorithm's growth rate

Answer

Big-O notation describes the worst-case upper bound on how an algorithm's runtime or space grows relative to input size.

Question 5

In a graph, what is a spanning tree?

Accepted Answer

A subgraph that connects all vertices with no cycles

Answer

A spanning tree is a subgraph that includes all vertices of the original graph and is connected with no cycles.

IT - Bachelor's Degree in Information Technology Practice Test