Quiz1-DSA-FCPC
Authored by ALVIN CERTEZA
Others
University
Used 2+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
50 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Big O notation is used to describe:
The exact runtime of an algorithm
The growth rate of an algorithm as input size increases
The memory size of a program
The programming language speed
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following represents the fastest time complexity?
O(1)
O(log n)
O(n)
O(n²)
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
If an algorithm takes the same amount of time regardless of input size, its time complexity is:
O(n)
O(n²)
O(1)
O(log n)
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following is better in terms of efficiency for large input sizes?
O(n²)
O(log n)
O(2ⁿ)
O(n³)
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The time complexity of inserting an element at the end of an array is usually:
O(1)
O(n)
O(n²)
O(log n)
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The Big O of binary search is:
O(1)
O(n)
O(log n)
O(n²)
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The nested loop below has what time complexity? for i in range(n): for j in range(n): print(i, j)
O(n)
O(n²)
O(log n)
O(n log n)
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?
