ITSC-2214 Quiz 2

What is the Big O of inserting an element at the beginning of an array?

• O(1)

• O(n)

• O(log n)

• O(n log n)

Which of the following data structures allows duplicates?

• Set

• Bag

• Stack

• Queue

In an ArrayList-based stack implementation, which of the following operations is used to remove an element?

• add()

• remove()

• pop()

• push()

What is the Big O of finding the maximum element in an unsorted array?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the Big O of finding the maximum element in an unsorted array?

• O(1)

• O(n)

• O(log n)

• O(n log n)

A set allows duplicate elements.

• True

• False

A stack allows removal of any element, not just the top one.

• True

• False

An array-based queue implementation uses the rear of the array for dequeue operations.

• True

• False

What is the best-case time complexity for inserting a new node at the correct position in a sorted singly linked list of size n?

• O(n)

• O(1)

• O(log n)

• O(n^2)

When inserting a node in a sorted linked list, which condition should you check in each iteration to find the correct insertion point?

• If the node's next is null

• If the node's value is greater than the new node

• If the node's value is smaller than the new node

• If the next node's value is smaller than the new node