Search Header Logo

2.3.1(f) Big O Do Now

Authored by RHSC Computing

Computers

12th Grade

Used 6+ times

2.3.1(f) Big O Do Now
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

5 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Emily is learning about sorting algorithms in her computer science class. She wonders if Bubble Sort is an example of a divide and conquer sorting algorithm?

True

False

2.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

Isabelle is sorting her collection of books using Bubble Sort. What is the worst-case time complexity of this sorting algorithm?

O(n log n)

O(n)

O(n^2)

O(1)

Answer explanation

Bubble Sort has a worst-case time complexity of O(n^2) due to its nested loops that compare and swap elements.

3.

MATCH QUESTION

1 min • 3 pts

Match the following

Insertion Sort

Works well with almost sorted datasets

Bubble Sort

Worst-case time complexity is O(n^2)

Quick Sort

Picks a pivot and partitions the array around it

Merge Sort

Divides the array into two halves and merges them after sorting

4.

LABELLING QUESTION

1 min • 4 pts

Big O Notation

e
f
g
h

A* Algorithm

Linear Search

Insertion Sort

Bubble Sort

Quick Sort

Dijkstra’s Shortest Path Algorithm

Binary Search

Merge Sort

5.

MATCH QUESTION

1 min • 5 pts

Match the following

Linear Search

Time complexity is O(n) for average and worst cases

Binary Search

Uses a priority queue to find the shortest path

A* Algorithm

Uses a heuristic to guide its search

Dijkstra’s Shortest Path Algorithm

Requires the array to be sorted before searching

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?