CS333 Quiz

CS333 Quiz

Professional Development

8 Qs

quiz-placeholder

Similar activities

Prueba diagnòstica de Ciencias Naturales 10 EGB

Prueba diagnòstica de Ciencias Naturales 10 EGB

Professional Development

12 Qs

All About Our India

All About Our India

KG - Professional Development

10 Qs

our galaxy planet

our galaxy planet

4th Grade - Professional Development

10 Qs

DYS 1 5th Sep Mastermind Behind The Mysterious Universe

DYS 1 5th Sep Mastermind Behind The Mysterious Universe

Professional Development

11 Qs

Formation of Galaxy Epic

Formation of Galaxy Epic

KG - Professional Development

11 Qs

Technicianing 1

Technicianing 1

Professional Development

10 Qs

Marine biology

Marine biology

8th Grade - Professional Development

12 Qs

LITERATURA - PRE SAN MARCOS

LITERATURA - PRE SAN MARCOS

Professional Development

10 Qs

CS333 Quiz

CS333 Quiz

Assessment

Passage

Science

Professional Development

Practice Problem

Hard

Created by

Oziel Sauceda

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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|)?