Quiz

Quiz: Big-O Notation

OCR H446 Computer Science Specification

Ready to start this lesson?

Sign in to track your progress. 11 steps including 9 interactive questions.

Sign In to Start Learning
11 Steps9 Questions

Students also studied

Browse all

Steps in this lesson (11)

1
Text

Building on what you've learned about algorithm design, let's test your knowledge of Big-O Notation!

2
Multiple ChoiceInteractive

What does Big-O Notation describe?

Start the lesson to answer this multiple choice question

3
Multi-SelectInteractive

Which of the following are examples of Big-O classifications? (Select all that apply)

Start the lesson to answer this multi-select question

4
Fill in the BlankInteractive

An algorithm with {{blank0}} complexity doubles its runtime when the input size doubles.

Start the lesson to answer this fill in the blank question

5
MatchingInteractive

Match the items on the left with their correct pairs on the right

Start the lesson to answer this matching question

6
Math EquationInteractive

What is the runtime complexity of the following code: \texttt{for(i = 0; i < N; i++) { ... }}?

Start the lesson to answer this math equation question

7
Multiple ChoiceInteractive

Which algorithm has a better time complexity?

Start the lesson to answer this multiple choice question

8
typedAnswer

Match the items on the left with their correct pairs on the right

9
Code CompletionInteractive

Match the items on the left with their correct pairs on the right

Start the lesson to answer this code completion question

10
Multiple ChoiceInteractive

Which Big-O classification describes the fastest possible algorithm?

Start the lesson to answer this multiple choice question

11
Multi-SelectInteractive

Which of the following algorithms are examples of O(N) complexity? (Select all that apply)

Start the lesson to answer this multi-select question

Want to Learn More?

Get personalised lessons, quizzes, and instant feedback from your AI tutor.

Explore More Topics