Quiz on Algorithms

What is the definition of an algorithm?

• A set of random instructions

• A finite set of precise instructions for performing a computation

• An infinite set of instructions

• A method for guessing solutions

Which of the following is NOT a property of algorithms?

• Randomness

• Input

• Correctness

• Output

What does Big-O notation describe?

• The efficiency of an algorithm in terms of time and memory

• The exact time an algorithm takes

• The input size of an algorithm

• The number of steps in an algorithm

Which of the following growth rates is the fastest?

• O(n)

• O(log n)

• O(2^n)

• O(n^2)

What is the significance of analyzing the growth of functions?

• To compare the efficiency of algorithms

• To find the maximum value in a sequence

• To determine the exact runtime of an algorithm

• To create random algorithms

Which of the following is an example of a quadratic growth rate?

• O(n log n)

• O(n^2)

• O(2^n)

• O(n)

What does the property of 'finiteness' in algorithms imply?

• An algorithm must be effective

• An algorithm can run indefinitely

• An algorithm must produce output after a finite number of steps

• An algorithm can only work with finite inputs

In Big-O notation, what does O(g(n)) signify?

• g(n) is a constant

• f(n) grows faster than g(n)

• f(n) is equal to g(n)

• f(n) grows no faster than g(n)

Which of the following is a property of big-O notation?

• f(n) + g(n) is O(max(f(n), g(n)))

• c·f(n) is O(f(n))

• f(n) + g(n) is O(f(n))

• f(n)·g(n) is O(f(n))

What is the main focus when analyzing algorithms?

• The complexity of the algorithm's logic

• The number of lines of code in the algorithm

• How their runtime or memory requirements change as input size grows

• The programming language used