Algorithm Quiz

What is an algorithm?

• A computational method for solving a problem

• A type of computer hardware

• A musical instrument

• A programming language

Which of the following is a requirement for an algorithm?

• Should provide a correct solution

• Should run forever

• Should only work for some instances of a problem

• Should use a lot of resources

What is pseudocode?

• A type of data structure

• A type of loop

• A programming language

• An English-like representation of the code required for an algorithm

What is the purpose of encapsulation in object-oriented programming?

• To slow down the program

• To make the code more complex

• To remove all data from the program

• To bundle all processing for an object together and hide it from the user

What is the time complexity of a linear loop?

• O(2^n)

• O(n)

• O(log n)

• O(n^2)

What does Big-O notation represent?

• Upper bound of a function

• Lower bound of a function

• Average number of steps in a function

• Exact number of steps in a function

What is the average case complexity?

• Somewhere in between the best and worst case scenarios

• Always the same as the worst case scenario

• Dependent on the input size

• Always the same as the best case scenario

What is the space complexity of a recursive program?

• The space used by the main function only

• The space used by local variables only

• The total space used by all active recursive calls at a given time

• The space used by global variables only

How is the efficiency of an algorithm calculated?

• By analyzing the number of steps it takes to solve a problem

• By counting the lines of code in the algorithm

• By checking the number of comments in the algorithm

• By measuring the physical size of the algorithm file

What is the purpose of Asymptotic Complexity?

• To provide approximations of efficiency using big-O notation

• To determine the exact number of steps in an algorithm

• To simplify the task of calculating average case complexity

• To analyze the space complexity of a program