Time Left - 15:00 mins
GATE 2025 algorithm Foundation Quiz 7
Attempt now to get your rank among 40 students!
Question 1
Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
Question 2
Which of the following graphs Topological ordering is not possible?
Question 3
What is the time complexity of job sequencing with deadline algorithm if we use greedy method?
Question 4
Choose the incorrect statement about merge sort from the following?
Question 5
Find the maximum possible value for fractional Knapsak problem?
Knapsack capacity (W) = 20
Knapsack capacity (W) = 20
- 40 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSAlgorithmsNov 20GATE & PSU CS
