Question

Given a set of activities with start and finish times:

(1,4), (3,5), (0,6), (5,7), (3,9), (5,9), (6,10), (8,11), (8,12), (2,14), (12,16). If you apply the greedy activity selection algorithm (sort by finish time), which activities are selected?

A (1,4), (5,7), (8,11), (12,16)

B (0,6), (6,10), (12,16)

C (1,4), (3,5), (5,9), (8,12)

D (1,4), (5,9), (8,11)

E (0,6), (8,11), (12,16)

Practice Next

More IT Operating System Questions

What does a diamond shape represent in an ER diagram?
In which network topology does each node have a direct connection to every other node?
Which searching algorithm requires the data to be sorted beforehand?
Which layer of the OSI model is responsible for establishing, managing, and terminating connections between applications?
In tuple calculus, what does the symbol '|' represent when specifying a query?
In the context of synchronization, what is a deadlock?
Wi-Fi networks (IEEE 802.11) primarily use which medium access control method to avoid collisions?
Why probe packets are transmitted in the network
What is a deadlock in a computer system?
In the context of ADTs, what does "encapsulation" refer to?

Given a set of activities with start and finish times:

Solution