Algorithms Algorithms 2

Question 1

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

Accepted Answer

Merge Sort

Answer

Bubble Sort

Answer

Insertion Sort

Answer

Selection Sort

Question 2

In Dijkstra's algorithm, what data structure is typically used to efficiently select the next minimum-distance vertex?

Accepted Answer

Min-Heap (Priority Queue)

Answer

Stack

Answer

Queue

Answer

Hash Table

Question 3

What is the time complexity of the Floyd-Warshall algorithm?

Accepted Answer

O(V³)

Answer

O(V²)

Answer

O(V² log V)

Answer

O(E log V)

Question 4

Which algorithm strategy does the 0/1 Knapsack problem use?

Accepted Answer

Dynamic Programming

Answer

Greedy

Answer

Divide and Conquer

Answer

Backtracking

Question 5

What is the worst-case space complexity of recursive Merge Sort?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n log n)

Question 6

In a depth-first search (DFS) on a graph, which data structure is implicitly used?

Accepted Answer

Stack

Answer

Queue

Answer

Heap

Answer

Deque

Question 7

Which of the following problems is NP-complete?

Accepted Answer

The Traveling Salesman Decision Problem

Answer

Finding the shortest path in a weighted graph

Answer

Sorting an array

Answer

Binary search on a sorted array