Algorithm Quiz

What is pseudocode?

• A visual representation of an algorithm

• A textual representation of an algorithm

• A programming language

• A type of flowchart

What is time complexity?

• The average case of an algorithm’s time complexity

• The best case of an algorithm’s time complexity

• The amount of time an algorithm requires to run as the input size grows

• The amount of memory an algorithm needs

What does Big-O notation (O) define?

• The best case of an algorithm’s time complexity

• The average case of an algorithm’s time complexity

• The worst case of an algorithm’s time complexity

• The maximum amount of memory an algorithm needs

What is the worst case complexity of an algorithm?

• The maximum time required for program execution

• The average time required for program execution

• The scenario in which the algorithm performs the minimum amount of work

• The scenario in which the algorithm performs the maximum amount of work

What is the purpose of asymptotic analysis?

• To describe the running time or space complexity of an algorithm based on the input size

• To measure the efficiency of an algorithm

• To express an algorithm in natural language

• To define the best case of an algorithm’s time complexity

What is the Omega notation (Ω) used for?

• To measure the efficiency of an algorithm

• To define the best case of an algorithm’s time complexity

• To define the average case of an algorithm’s time complexity

• To define the worst case of an algorithm’s time complexity

What is the purpose of flowcharts in expressing an algorithm?

• To illustrate the steps and logic of an algorithm

• To describe the running time or space complexity of an algorithm based on the input size

• To define the best case of an algorithm’s time complexity

• To measure the efficiency of an algorithm

What is the space complexity of an algorithm?

• The amount of time an algorithm requires to run as the input size grows

• The amount of memory an algorithm needs to solve the problem for a given input

• The maximum amount of time an algorithm requires to consider all input values

• The ability of an algorithm to perform its task in the most optimal way

What does the Theta notation (Θ) define?

• The average case of an algorithm’s time complexity

• The best case of an algorithm’s time complexity

• The maximum amount of memory an algorithm needs

• The worst case of an algorithm’s time complexity

What is the runtime complexity of an algorithm that takes the same amount of time regardless of the data size?

• O(n^2)

• O(n)

• O(log n)

• O(1)