At each iteration, pick the remaining request with the fewest number of conflicts with other remaining requests (breaking ties arbitrarily).
At each iteration, pick the remaining request with the earliest start time.
At each iteration, pick the remaining request with the earliest finish time.
At each iteration, pick the remaining request which requires the least time (i.e., has the smallest value of ti — si) (breaking ties arbitrarily).
Neither algorithm always correctly determines whether or not a given tree graph has a perfect matching.
Both algorithms always correctly determine whether or not a given tree graph has a perfect matching.
Algorithm B always correctly determines whether or not a given tree graph has a perfect matching; algorithm A does not.
Algorithm A always correctly determines whether or not a given tree graph has a perfect matching; algorithm B does not.
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Advanced Algorithms (Advanced Algorithms) End Term paper sat on 1 Sept 2024, in the May 2024 term, set QDB1: 53 questions for 100 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Advanced Algorithms End Term 1 Sept 2024 Set QDB1 at a glance |
|---|---|
| Term | May 2024 term |
| Subject | Advanced Algorithms |
| Course code | BSCS4021 |
| Questions | 53 |
| Marks | 100 |
| Duration | 180 min |
| MCQ | 42 |
| Numerical | 8 |
| MSQ | 3 |
| Official paper | IIT M DEGREE AN EXAM QDB3 01 Sep 2024 |
| Negative marking | No negative marking. |
| Updated |
