If f(n) is O(g(n)), then g(n) is:

Quick sort is a space-optimized version of which sorting mechanism?

The average successful search time for sequential search on a list of 'x' items is:

Which type of graph cannot contain K_3,3 as a minor?

The pivot element used to partition an unsorted list is a key concept in which sorting algorithm?

The recurrence relation that captures the optimal time complexity of the Tower of Hanoi problem with n discs is:

Given a pattern of length 5, find the valid match in the given text.

Pattern: 2 1 9 3 6
Text: 9 2 7 2 1 8 3 0 5 7 1 2 1 2 1 9 3 6 2 3 9 7

Which of the following is the correct recurrence relation for the worst-case time complexity of Binary Search?

Given an empty AVL tree, how would you construct the AVL tree when a set of numbers are provided, without performing any rotations?

Given an unsorted array where every element is at most k distance from its position in the sorted array, where k is a positive integer smaller than the size of the array, which sorting algorithm can be easily modified to sort this array efficiently?