← Back to Data Structures & Algorithms
Advanced algorithms quiz
Five questions on Advanced algorithms. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
A greedy algorithm:
Question 2 of 5
The optimal greedy rule for selecting the most non-overlapping activities is:
Question 3 of 5
Exchange arguments are used to:
Question 4 of 5
Huffman coding gives frequent symbols:
Question 5 of 5
A prefix-free code guarantees that: