Skip to content
College Subject Practice · College Year 3

Randomized Algorithms practice questions — College Subject Practice · College Year 3 Algorithms

Practise randomized 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
The Karger-Stein algorithm improves Karger's min-cut running time mainly by:

1 sample question · No signup needed

Something unclear? Report this question.

2
The expected running time of randomized quicksort on an array of nn elements is:
3
For a single run of Karger's algorithm on a graph with nn vertices, the probability of returning a specific minimum cut is at least:
Start a sample session

50 published questions available for this topic.