What is the Big Oh notation for an algorithm with a constant run time?

• O(n)

• O(log n)

• O(1)

• O(n log n)

In a singly linked list, what is the run time complexity for insertion at the head or tail?

• O(n)

• O(log n)

• O(1)

• O(n^2)

Which of the following operations on a binary search tree (BST) has a run time complexity of O(log n) when the tree is balanced?

• Insertion

• Searching

• Deletion

• All of the above

What is the primary difference between a singly linked list and a doubly linked list?

• Singly linked lists have nodes with references to both next and previous nodes

• Doubly linked lists have nodes with references to both next and previous nodes

• Singly linked lists are more complex to implement

• Doubly linked lists do not support traversal

What is the purpose of the MinHeapify algorithm in a heap?

• To delete the minimum value

• To maintain the min-heap property after insertion

• To search for a value

• To traverse the heap

Which data structure is typically used to implement a priority queue?

• Linked list

• Binary search tree

• Heap

• Array

What is the run time complexity of the bubble sort algorithm?

• O(n log n)

• O(n^2)

• O(log n)

• O(n)

Which sorting algorithm is based on the divide and conquer strategy and has a run time complexity of O(n log n)?

• Bubble sort

• Insertion sort

• Quick sort

• Radix sort

What is the primary advantage of using an AVL tree over a binary search tree?

• AVL trees are easier to implement

• AVL trees are self-balancing, ensuring O(log n) operations

• AVL trees use less memory

• AVL trees do not require rotations

In the context of the book, what does the term 'yield' mean in pseudocode?

• To return a single value and exit the function

• To build a sequence of values

• To pause the function execution

• To throw an exception