Activity Selection Problem Quiz Online Practice Test

1. Five activities have the following start and finish times: activity 1 runs from time 1 to 3, activity 2 from 2 to 4, activity 3 from 3 to 6, activity 4 from 5 to 7, and activity 5 from 6 to 9. How many activities can be selected at most without conflicts?

2. Which approach is most suitable for solving the activity selection problem?

Greedy approach

Divide and conquer

Brute-force approach

Backtracking

3. Two activities A and B, with start/finish times SA, FA and SB, FB, are compatible under which condition?

SA equals FB

SA is greater than FB only

SA ≥ FB or SB ≥ FA

SA ≥ FB and SB equals FA

4. In the activity selection algorithm, activities are sorted by finish time and the first activity is displayed. For each subsequent activity j, if its start time is greater than or equal to the finish time of the last selected activity i, what should happen next?

Display the ith activity

Display the jth activity

Discard the activity

Skip to the next iteration

5. Six activities have the following start and finish times: activity 1 runs from time 1 to 2, activity 2 from 2 to 5, activity 3 from 1 to 5, activity 4 from 3 to 6, activity 5 from 6 to 8, and activity 6 from 4 to 9. Which sequence selects the maximum number of non-conflicting activities?

Activity 1, activity 2, activity 5

Activity 1, activity 2, activity 3, activity 4

Activity 1, activity 3, activity 5

Activity 1, activity 2, activity 6

6. What is the time complexity of solving the activity selection problem when the activity list is not already sorted?

O(n log n)

O(n)

O(n²)

O(log n)

7. Can the solution to the activity selection problem include two activities that overlap within the same time interval?

Yes, if both activities have the same finish time

Yes, since overlapping activities can share the resource

No, only mutually compatible activities are selected

No, but only if there are more than two activities

8. Four activities have the following start and finish times: activity 1 runs from time 1 to 2, activity 2 from 3 to 5, activity 3 from 4 to 6, and activity 4 from 5 to 8. Which activity gets left out of the optimal selection?

Activity 1

Activity 2

Activity 3

Activity 4

9. What is the best-case time complexity of the activity selection problem?

O(n)

O(1)

O(n²)

O(n log n)

Test Name:	Activity Selection Problem
Subject Category:	Design & Analysis of Algorithms
Test Type:	Multiple Choice Questions
Total Score / Questions:	9 / 9
Time Allowed:	3 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Activity Selection Problem MCQs-based Quiz Online Practice Test