MCQ Bank

A stable matching between two equal-sized sets is produced by which classic algorithm?

Omega notation is used to describe an algorithm's:

Tarjan's algorithm is used to find:

The coin change problem, when minimizing the number of coins for arbitrary denominations, is best solved with:

Branch and bound differs from pure backtracking by using bounds to:

Which of the following algorithms uses backtracking?

The two main phases of heapsort are:

A divide-and-conquer algorithm typically consists of which three steps?

The theta notation for an algorithm provides:

The time complexity of building a binary heap from an unsorted array of n elements is:

Cycle detection in a directed graph can be performed using depth-first search by looking for a:

An approximation algorithm is typically used for problems that are:

The Ford-Fulkerson method is used to compute the:

The best-case time complexity of binary search occurs when the target is:

The partition step of quicksort rearranges elements so that:

Interpolation search can outperform binary search when the data is sorted and:

A brute-force algorithm solves a problem by:

The activity-selection problem is optimally solved using which paradigm?

A polynomial-time reduction from problem A to problem B shows that:

Bucket sort achieves linear average-case time by: