GATE 2023 Algorithm Quiz 8

The greedy algorithm generates ………..loadings.

Which of the following is true about Huffman coding?

Consider the following comparison sorting algorithms:
i. Merge Sort
ii. Quick Sort
iii. Heap Sort
iv. Insertion Sort
Which of the following(s) is/are optimal comparison sorts?

What is the maximum profit obtained by processing below jobs by using job sequencing algorithm?

Which of the following is true about insertion sort?

I. Insertion sort work better when the array is almost sorted.

II. Insertion Sort will asymptotically work better when we use binary search instead of linear search.

III. Insertion sort best case is O(n²).

IV. Between insertion sort and Selection sort, Selection sort is preferred when swap is costly instead of insertion sort.