Big O Notation Quiz

What is Big O notation?

• A method to analyze both time and space

• A way to compare algorithms

• A simplified analysis of an algorithm's efficiency

• A measure of the input size

What does Big O notation ignore?

• Machine stats

• Constants

• Input size

• Efficiency

Which case does Big O notation typically look at?

• All cases

• Average case

• Best case

• Worst case

What does Big O of 1 represent?

• Constant time

• Exponential time

• Linear time

• Quadratic time

How do we compute Big O for a sequence of constant time statements?

• Multiply their times

• Add their times

• Divide their times

• Subtract their times

What is the time complexity of a for loop that prints numbers from 0 to n?

• Big O of log N

• Big O of N squared

• Big O of N

• Big O of 1

What happens to low order terms in Big O notation?

• They are added

• They are dropped

• They are divided

• They are multiplied

What is the time complexity of a nested for loop?

• Big O of 1

• Big O of N

• Big O of N squared

• Big O of log N

What is the largest runtime in the following block of code?

• Big O of 1

• Big O of N

• Big O of log N

• Big O of N squared

What is the worst case time complexity for an if else statement?

• Big O of 1

• Big O of N squared

• Big O of log N

• Big O of N