2.3.1(f) Big O Do Now

2.3.1(f) Big O Do Now

12th Grade

5 Qs

quiz-placeholder

Similar activities

Understanding Insertion Sort Algorithm

Understanding Insertion Sort Algorithm

12th Grade

10 Qs

SORTING

SORTING

9th - 12th Grade

10 Qs

Sorting Algorithm

Sorting Algorithm

9th - 12th Grade

10 Qs

PYTHON 1

PYTHON 1

11th - 12th Grade

10 Qs

Selection Sort

Selection Sort

9th - 12th Grade

6 Qs

Algorithm Complexity Quiz

Algorithm Complexity Quiz

9th - 12th Grade

10 Qs

CS Python Fundamentals 8.8 Lesson Quiz

CS Python Fundamentals 8.8 Lesson Quiz

9th - 12th Grade

10 Qs

AP CSP Big Idea 1

AP CSP Big Idea 1

9th - 12th Grade

10 Qs

2.3.1(f) Big O Do Now

2.3.1(f) Big O Do Now

Assessment

Quiz

Computers

12th Grade

Easy

Created by

RHSC Computing

Used 6+ times

FREE Resource

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

Picks a pivot and partitions the array around it

Merge Sort

Works well with almost sorted datasets

Quick Sort

Divides the array into two halves and merges them after sorting

Bubble Sort

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

4.

LABELLING QUESTION

1 min • 4 pts

Big O Notation

e
f
g
h

Linear Search

Merge Sort

Binary Search

Quick Sort

Insertion Sort

Dijkstra’s Shortest Path Algorithm

Bubble Sort

A* Algorithm

5.

MATCH QUESTION

1 min • 5 pts

Match the following

Dijkstra’s Shortest Path Algorithm

Requires the array to be sorted before searching

A* Algorithm

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

Linear Search

Uses a heuristic to guide its search

Binary Search

Uses a priority queue to find the shortest path