Time Left - 15:00 mins
GATE 2025 algorithm Foundation Quiz 8
Attempt now to get your rank among 41 students!
Question 1
The greedy algorithm generates ………..loadings.
Question 2
Which of the following is true about Huffman coding?
Question 3
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?
i. Merge Sort
ii. Quick Sort
iii. Heap Sort
iv. Insertion Sort
Which of the following(s) is/are optimal comparison sorts?
Question 4
Fractional knapsack problem is solved most efficiently by which of the following algorithm?
Question 5
What is the maximum profit obtained by processing below jobs by using job sequencing algorithm?
- 41 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSAlgorithmsNov 22GATE & PSU CS