CS333 Quiz

CS333 Quiz

Professional Development

8 Qs

quiz-placeholder

Similar activities

Hurricane

Hurricane

KG - Professional Development

9 Qs

Chemisty Reaction

Chemisty Reaction

Professional Development

10 Qs

Quiz Sucralbat

Quiz Sucralbat

Professional Development

10 Qs

Binary and Linear Searching Algorithms

Binary and Linear Searching Algorithms

KG - Professional Development

8 Qs

Sunday Quiz 2 - Space

Sunday Quiz 2 - Space

1st Grade - Professional Development

10 Qs

Quiz Webinar Vit D

Quiz Webinar Vit D

Professional Development

7 Qs

Clean Water and Sanitation

Clean Water and Sanitation

KG - Professional Development

10 Qs

The Environment

The Environment

KG - Professional Development

10 Qs

CS333 Quiz

CS333 Quiz

Assessment

Passage

Science

Professional Development

Hard

Created by

Oziel Sauceda

FREE Resource

8 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the big-Oh run time of Merge Sort of n items?

2.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the big-Oh run time of Heap Sort on n items?

3.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the big-Omega lower bound for comparison based sorting of n items?

4.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the worst case big-Oh run time to insert 1 item into an AVL-tree that contains n items?

5.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the worst case big-Oh time of binary search on an n item sorted list?

6.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the worst case big-Oh time to insert 1 item into a min-heap?

7.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the worst case big-Oh time to remove the minimum value from a min-heap?

8.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is the run time of breadth-first search (in terms of |V| and |E|)?