CPSC 131 midterm review
Authored by Alan Cortez
Computers
University
Used 52+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
45 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: enqueue an item into a sll-based queue
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: Retrieve the last element from a singly linked list (assuming there isnt a tail pointer)
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: Retrieve the front element from a singly linked list
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: Retrieve the last element from a doubly linked list with a tail pointer
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: Retrieve the last element from a doubly linked list
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: Remove all elements in a doubly linked list
O(1)
O(log n)
O(n)
O(n log(n))
O(n^2)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the Efficiency Class of: push an element to the back of the vector
O(1)
O(log n)
O(n)
O(1) amoratized
O(n^2)
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?
