Complexity and Searching Sorting

Complexity and Searching Sorting

Assessment

Flashcard

Computers

9th Grade

Hard

Created by

Wayground Content

FREE Resource

Student preview

quiz-placeholder

10 questions

Show all answers

1.

FLASHCARD QUESTION

Front

Which notation is used for "longest" run time of an algorithm? Options: O, Ω, θ

Back

O

2.

FLASHCARD QUESTION

Front

Which notation is used for "shortest" run time of an algorithm? Options: O, Ω, θ

Back

Ω

3.

FLASHCARD QUESTION

Front

Which notation is used if the "longest" and "shortest" run time of an algorithm is the same? Options: O, Ω, θ

Back

θ

4.

FLASHCARD QUESTION

Front

What is the omega notation for selection sort?

Back

5.

FLASHCARD QUESTION

Front

What is the omega notation for bubble sort?

Back

Ω(n)

6.

FLASHCARD QUESTION

Front

Which algorithm has a θ(n^2) run time? Options: Linear Search, Binary Search, Selection Sort, Bubble Sort

Back

Bubble Sort

7.

FLASHCARD QUESTION

Front

What algorithm is the provided code segment implementing? Options: linear search, binary search, selection sort, bubble sort

Back

bubble sort

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?