What is an algorithm?

• A finite set of steps to solve a specific problem

• A programming language

• A type of data structure

• A random set of instructions

What does analysis refer to in the context of algorithms?

• The coding of the algorithm

• A detailed examination of the elements or structure of something

• A simple overview of the algorithm

• The execution of the algorithm

Which of the following is NOT a category of algorithm?

• SEARCH

• SORT

• COMPILE

• DELETE

What is the first step in writing an algorithm?

• Test the algorithm

• Write the code

• Define the problem domain

• Analyze the algorithm

What does A Priori Analysis involve?

• Empirical analysis of an algorithm

• Theoretical analysis of an algorithm

• Testing the algorithm on a computer

• Implementation of the algorithm

What is measured in Time Complexity?

• The number of algorithms available

• The memory space required

• The amount of time required by the algorithm to run

• The number of variables used

What does Space Complexity represent?

• The efficiency of an algorithm

• The number of steps in an algorithm

• The time taken to execute an algorithm

• The amount of memory space required by the algorithm

What does Big-O notation express?

• The average case time complexity

• The upper bound of an algorithm’s running time

• The lower bound of an algorithm’s running time

• The exact time complexity

What does Omega (Ω) notation measure?

• The average case time complexity

• The best case time complexity

• The worst case time complexity

• The space complexity

What is the purpose of Theta (Θ) notation?

• To express the lower bound of an algorithm

• To express the upper bound of an algorithm

• To measure the space complexity

• To define exact asymptotic behavior