Complexity A-Level

Which of the following Big-O Notation measurements describes the complexity of an algorithm where it takes the same number of steps to execute regardless of the size of the data set (n)?

Which of the following Big-O Notation measurements describes the complexity of an algorithm where the number of steps required to execute the algorithm increases in direct proportion to the size of the data set (n)?

Which of the following Big-O Notation measurements describes the complexity of an algorithm which makes use of the principles of ‘Divide and Conquer’?

Which of the following Big-O Notation measurements describes an algorithm of an intractable problem?

Which of the following Big-O Notation measurements describes polynomial growth?

Which of the following Big-O Notation measurements describes the complexity of the following algorithm?

Which of the following Big-O Notation measurements describes the complexity of the following algorithm?

If an algorithm has 2n^2 + 6n + 9 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?

If an algorithm has 1254 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?

If an algorithm has 5n + 6n + 8 steps to execute, what is the Big-O notation to describe the algorithm’s complexity?

Which of the following Big-O notations describe line 3 of the graph?

Which of the following Big-O notations describe line 4 of the graph?

Which of the following Big-O notations describe line 6 of the graph?

Which of the following Big-O notations describe line 7 of the graph?

An algorithm whose execution time increases at the same rate as the size of data it has to work on increases, is said to have a _________ time complexity.

An algorithm whose execution time increases at a faster rate as the size of data it has to work on increases (yet is still executed in acceptable time ) is said to have a ________ time complexity.

An algorithm whose execution time increases at a faster rate as the size of data it has to work on increases (and is not executed in acceptable time) is said to have a ________ time complexity.

An algorithm whose execution time increases at an increasingly slower rate compared to the rate of increase in size of data it has to work on, is said to have a ________ time complexity.

Big-O notation typically describes…