Big O
Authored by Matt Hunt
Computers
2nd Grade
Used 3+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
72 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The performance (speed) of the algorithm under optimal conditions.
Best Case
Worst Case
Average Case
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In a linear search, the item being searched is the first item in the list.
Best Case
Worst Case
Average Case
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The performance of the algorithm in the most unfavourable conditions.
Best Case
Worst Case
Average Case
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In a linear search, the item being searched is the last item in the list.
Best Case
Worst Case
Average Case
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The performance of the algorithm in expected normal conditions.
Best Case
Worst Case
Average Case
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Unless stated otherwise, Big O represents the...
Best Case
Worst Case
Average Case
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Rank 1 in terms of efficiency
Constant
Logarithmic
Linear
Polynomial
Exponential
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 Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
