CS333 Quiz
Authored by Oziel Sauceda
Science
Professional Development
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
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?
(a)
2.
FILL IN THE BLANK QUESTION
1 min • 1 pt
What is the big-Oh run time of Heap Sort on n items?
(a)
3.
FILL IN THE BLANK QUESTION
1 min • 1 pt
What is the big-Omega lower bound for comparison based sorting of n items?
(a)
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?
(a)
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?
(a)
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?
(a)
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?
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
