Algorithm Complexity Final Exam

The term ____________________________ measures how many steps are required by the algorithm to solve the given problem.

_________________________ Imposes a complexity of O (N). It encompasses the same number of steps as that of the total number of elements to implement an operation on N elements.

__________________ refers to an informal high-level description of the operating principle of a computer program or algorithm.

The Divide and Conquer strategy consists of how many main steps?

What type of algorithm uses randomness in its logic?

Which algorithm design technique is considered top-down?

Big-O notation represents:

In Quicksort, what is selected randomly in the randomized version?

Which algorithmic approach is known for trying all possibilities?

The job assignment problem is typically solved using: