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.
Based on the above data, answer the given subquestions.
3ⁿ
2ⁿ
n³
n²
Based on the above data, answer the given subquestions.
2ⁿ
n
1
0
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 31 Aug 2025, in the May 2025 term, set QDB3: 21 questions for 50 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 31 Aug 2025 Set QDB3 at a glance |
|---|---|
| Term | May 2025 term |
| Subject | Advanced Algorithms |
| Course code | BSCS4021 |
| Questions | 21 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 18 |
| Numerical | 2 |
| MSQ | 1 |
| Official paper | IIT M DEGREE AN EXAM QDB3 31 Aug 2025 |
| Negative marking | No negative marking. |
| Updated |
