Data Structures

a) Partitions b) Structures c) Trees d) None of the above

a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach

a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

a) Heap sort b) Quick sort c) Merge sort d) Radix sort

 a) Ω (1) b) Ω (n) c) Ω (nlogn) d) Ω (n2)

a) O(n) b) O(nlogn) c) O(n2) d) O(n2logn)

 a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

a) Insertion sort b) Counting sort c) Selection sort d) Bubble sort

 a) Counting sort b) Radix sort c) Bucket sort d) None

 a) θ (n) b) θ (nlogn) c) θ (n2) d) None

a) θ (n) b) θ (nlogn) c) θ (n2) d) none

a) 0 b) n c) nlogn d) n2 

a) Counting sort b) Bucket sort c) Radix sort d) All of the above

a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

a) Counting sort b) Bucket sort c) Radix sort d) Quick sort

 a) θ (n) b) θ (nlogn) c) θ (n2)  d) θ (n(logn) 2)