Consider the following number of activities with their start and finish time given below. Which of following activity will be left out?
| Activity | Starting time | Finish time |
| A1 | 1 | 2 |
| A2 | 3 | 5 |
| A3 | 4 | 6 |
| A4 | 5 | 8 |
A. A1
B. A2
C. A3
D. A4
Answer: Option C
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