Skip to content
College Subject Practice · College Year 1

Greedy Algorithms practice questions — College Subject Practice · College Year 1 Algorithms

Practise greedy algorithms with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
In Prim's algorithm, the key value of a vertex not yet in the tree represents:

1 sample question · No signup needed

Something unclear? Report this question.

2
Which data structure does Kruskal's algorithm typically use to detect cycles?
3
For Huffman's optimality proof, the inductive step replaces the two least-frequent symbols x,yx,y with a merged symbol zz of frequency f(x)+f(y)f(x)+f(y) to show:
Start a sample session

50 published questions available for this topic.