Consider the following number of activities with their start and finish time given below. In which sequence will the activity be selected in order to maximize the number of activities, without any conflicts?
| Activity | Starting time | Finish time |
| A1 | 1 | 2 |
| A2 | 2 | 5 |
| A3 | 1 | 5 |
| A4 | 3 | 6 |
| A5 | 6 | 8 |
| A6 | 4 | 9 |
A. A1, A2, A5
B. A1, A2, A3, A4
C. A1, A3, A5
D. A1, A2, A5, A6
Answer: Option A
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion