2.3.1(f) Big O Do Now

2.3.1(f) Big O Do Now

12th Grade

5 Qs

quiz-placeholder

Similar activities

Sorting Algorithms

Sorting Algorithms

9th - 12th Grade

10 Qs

Algorithmic Strategies

Algorithmic Strategies

12th Grade

10 Qs

A Level Computing 2.3.1 Algorithms -  Sorting algorithms #1

A Level Computing 2.3.1 Algorithms - Sorting algorithms #1

11th - 12th Grade

10 Qs

Paper Practice 1

Paper Practice 1

9th - 12th Grade

10 Qs

Modular Programming & Algorithmic Strategies

Modular Programming & Algorithmic Strategies

12th Grade

10 Qs

N5 - Standard Algorithms

N5 - Standard Algorithms

12th Grade

10 Qs

Encryption - AQA A Level Computer Science

Encryption - AQA A Level Computer Science

11th - 12th Grade

10 Qs

CrashCourse Computer Science Quiz

CrashCourse Computer Science Quiz

9th - 12th Grade

9 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

Bubble Sort

Works well with almost sorted datasets

Quick Sort

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

Merge Sort

Divides the array into two halves and merges them after sorting

Insertion Sort

Picks a pivot and partitions the array around it

4.

LABELLING QUESTION

1 min • 4 pts

Big O Notation

e
f
g
h

Dijkstra’s Shortest Path Algorithm

Quick Sort

Insertion Sort

A* Algorithm

Linear Search

Bubble Sort

Binary Search

Merge Sort

5.

MATCH QUESTION

1 min • 5 pts

Match the following

Binary Search

Requires the array to be sorted before searching

A* Algorithm

Uses a priority queue to find the shortest path

Dijkstra’s Shortest Path Algorithm

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

Linear Search

Uses a heuristic to guide its search