On which algorithm is heap sort based on? FIFO Priority queue Binary tree Fibonacci heap The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________ n/4 : 3n/4 n/2 : (n/2) – 1 n/2 : n/3 n/4 : 3n/2 Consider the following heap after buildheap phase. What will be its corresponding array? 26,41,53,97,31,58,59 97,53,59,26,41,58,31 26,53,41,97,58,59,31 26,31,41,53,58,59,97
On which
FIFO
Priority queue
Binary tree
Fibonacci heap
The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________
n/4 : 3n/4
n/2 : (n/2) – 1
n/2 : n/3
n/4 : 3n/2
Consider the following heap after buildheap phase. What will be its corresponding array?
26,41,53,97,31,58,59
97,53,59,26,41,58,31
26,53,41,97,58,59,31
26,31,41,53,58,59,97
Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?
7 6 14 11 9 4 3 12
6 4 3 7 11 9 14 12
6 3 4 7 9 14 11 12
7 6 4 3 9 14 11 12
Quick sort follows Divide-and-Conquer strategy.
True
False
Assume you have the array 7,9,6,10,3,5,8. What will the array look like after we call build-min-heap on the entire array?
3, 7, 5, 10, 9, 8, 6
3, 5, 6, 7, 8, 9, 10
3, 7, 5, 10, 9, 6, 8
10, 9, 8, 7, 6, 5, 3
3, 5, 7, 10, 9, 6, 8
Assume you have the following array: 30, 50, 20, 80, 10, 90, 100. Assume you were to select the quicksort pivot as the middle element of the array. What are the two sub-arrays to be sorted that result after one iteration of quicksort?
30, 50, 20, 10 | 90, 100
10, 20, 30, 50 | 90, 100
30, 50, 20, 10 | 100, 90
30, 20, 50, 10 | 100, 9
Assume you have the following array: 8, 5, 30, 15, 100, 10, 20. What are the swaps that occur in order while performing single pass of the partition part of the quicksort algorithm (Min to max value, pivot placed at the end)?
30-10, 100-20, 30-15
30-15, 30-10, 100-20
100-20, 30-10, 30-15
30-15, 30-10
100-20, 30-15, 30-10
30, 50, 10, 20 | 90, 100
Assume you have a sorted list of 100 pre-sorted elements and a recursive implementation of Quicksort. How many calls to Quicksort are made in order to fully sort it. Assume that the algorithm makes the recursive Quicksort calls before checking if it has an array of size 1 (see https://www.geeksforgeeks.org/quick-sort/ for specific pseudo code or the textbook Introduction to Algorithms 3rd Edition page 171).
85
101
50
103
199
Assume you have the following array: 40, 20, 15, 40, 90, 60, 50, 70. Which of the following elements, if selected as the pivot, would give you the most unequal sub-arrays to be sorted using quicksort?
30, 70
20, 15
40, 90
90, 70
90, 15
Assume you have the following array: 40, 20, 15, 40, 90, 60, 50, 70. Which of the following elements, if selected as the pivot, would give you the most unequal sub-arrays to be sorted using quicksort?
30, 70
20, 15
40, 90
90, 70
90, 15
Assume we have the array 4,10,3,5,1,2,5,6,1,2,3. What are the swaps that will occur after we call min-heapify on node 10?
10-1, 10-2
10-5, 10-6
10-5, 10-1
3-5, 4-5
10-1, 10-3
Assume you have the max-heap 100, 80, 70, 60, 50, 40, 30, 50, 10, 20. What is the final state of the array after one full iteration of heapsort (stop before the recursive call ono sub arrays, Sorts from min to max values, pivot placed at the end) is called?
80, 60, 70, 50, 50, 40, 30, 30, 20, 10, 100
80, 60, 70, 50, 50, 40, 30, 30, 20, 10
100, 80, 70, 60, 50, 50, 40, 30, 30, 20, 10
100, 80, 60, 70, 50, 50, 40, 30, 30, 20, 10
60, 70, 50, 50, 40, 30, 30, 20, 10, 100, 80
Assume you have the following array: 8, 5, 30, 15, 100, 10, 20. What will the array look like after a single pass of the Partition part of the quicksort algorithm (Min to max value, pivot placed at the end)?
5, 8, 15, 20, 30, 10
8, 5, 15, 10, 20, 30, 100
8, 5, 15, 10, 20, 100, 30
8, 5, 15, 10, 100, 30, 20
15, 8, 5, 20, 100, 30
Assume you have the array 7,9,6,10,3,5,8, what are the swaps that occur when we call build-min-heap?
6-5, 9-3
9-3, 7-3
6-5, 7-3, 9-3
9-3, 7-3, 6-5
6-5, 9-3, 7-3
Assume we have the array 4,10,3,5,1,2,5,6,1,2,3. What is the final state of the array after the min-heapify is called on node 10?
10 , 6, 5, 5, 4, 3, 3, 2, 2, 1, 1
4, 1, 3, 5, 2, 2,5,6,1,10,3
1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 10
4, 1, 2, 5, 3, 2, 5, 6, 1, 10, 3
4, 1, 3, 5, 10, 2, 5, 6, 1, 2, 3
Step by step
Solved in 4 steps
