Skip to content
College Subject Practice · College Year 2

Advanced Algorithms practice questions — College Subject Practice · College Year 2 Algorithms

Practise advanced 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 a segment tree with lazy propagation, range updates can be performed in time:

1 sample question · No signup needed

Something unclear? Report this question.

2
In a Fibonacci heap, the potential function is typically defined as Φ=t(H)+2m(H)\Phi = t(H) + 2m(H), where t(H)t(H) and m(H)m(H) denote:
3
A problem is in class P if it can be solved by a deterministic algorithm in:
Start a sample session

50 published questions available for this topic.