19.3.4 - Counterexamples to Strategies
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
Define a greedy algorithm in your own words.
💡 Hint: Think about choices made without looking ahead.
What is interval scheduling in the context of algorithms?
💡 Hint: Consider a room booked at different times.
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
What is a characteristic of a greedy algorithm?
💡 Hint: Consider how greedy algorithms settle for choices.
True or False: The earliest start time always leads to maximizing bookings in interval scheduling.
💡 Hint: Reflect on how overlapping bookings affect scheduling.
Get performance evaluation
Challenge Problems
Push your limits with advanced challenges
You have 5 bookings prioritized by the following intervals: (1, 4), (2, 3), (3, 6), (4, 7), (5, 8). Using the earliest finish time strategy, determine the maximum number of non-overlapping bookings.
💡 Hint: Firstly, sort by finish times and find compatible slots.
Construct a counterexample demonstrating that the strategy of choosing bookings based on the minimum number of conflicts can fail.
💡 Hint: Consider a scenario where minimized conflicts lead to total exclusion of useful options.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.