CPSC 131 midterm review

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)

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)

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)

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)

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)

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)

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)

What is the Efficiency Class of: push into a DLL-based stack

• O(1)

• O(log n)

• O(n)

• O(1) amoratized

• O(n^2)

What is the Efficiency Class of: pop from a vector-based stack

• O(1)

• O(log n)

• O(n)

• O(1) amoratized

• O(n^2)

What is the Efficiency Class of: push to a linked-list based stack

• O(1)

• O(log n)

• O(n)

• O(1) amoratized

• O(n^2)