uiz Space

January 2026 term · Advanced Algorithms · BSCS4021

Advanced Algorithms End Term: 10 May 2026 (January 2026 term)

The IIT Madras BS Advanced Algorithms (Advanced Algorithms) End Term paper sat on 10 May 2026, in the January 2026 term: 47 questions for 100 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
47
Marks
100
Duration
180 min
MCQ
44
Numerical
1
MSQ
2
Take as mock testPractise with answers

Updated

Official paper: Advanced Algorithms 10 May 26 · No negative marking.

Question 1

+1 markOne correct option

Can the disk with dimensions [2,1,2] be placed above [3,2,3]?

  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • A

    Yes

Question 1 on its own page

Question 2

+1 markOne correct option

Can the disk with dimensions [2,2,2] be placed above [3,2,3]?

  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • B

    No

Question 2 on its own page

Question 3

+2 marksNumerical answer

Suppose the input consists of the following triplets: [[3, 5, 7], [3, 2, 2], [3, 1, 1], [5, 5, 9]]. What's the answer?

Show answer

Correct answer: 11

Question 3 on its own page

Question 4

+2 marksOne correct option
  1. A

    This approach is correct.

  2. B
  3. C

    This approach is incorrect because the values we are looking up may not be computed correctly when we need them.

Show answer

Correct answer

  • B
Question 4 on its own page

Question 5

+2 marksOne correct option
  1. A

    This approach is correct.

  2. B
  3. C

    This approach is incorrect because the values we are looking up may not be computed correctly when we need them.

Show answer

Correct answer

  • C

    This approach is incorrect because the values we are looking up may not be computed correctly when we need them.

Question 5 on its own page

Question 6

+2 marksOne correct option
  1. A

    This approach is correct.

  2. B
  3. C

    This approach is incorrect because the values we are looking up may not be computed correctly when we need them.

Show answer

Correct answer

  • A

    This approach is correct.

Question 6 on its own page

Question 7

+2 marksOne correct option

What is the complexity of this algorithm?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
Question 7 on its own page

Question 8

+3 marksOne correct option

Answer the given subquestions about matroids.

  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • A

    Yes

Question 8 on its own page

Question 9

+2 marksOne correct option

Answer the given subquestions about matroids.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 9 on its own page

Question 10

+2 marksOne or more correct options

Answer the given subquestions about matroids.

Choose the correct option(s):

Select all that apply.

  1. A
  2. B
Show answer

Correct answer

  • A
Question 10 on its own page

Question 11

+1 markOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 11 on its own page

Question 12

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 12 on its own page

Question 13

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 13 on its own page

Question 14

+3 marksOne or more correct options

In this question, we will examine the relationship of treewidth with other graph parameters.

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • B
  • D
Question 14 on its own page

Question 15

+2 marksOne correct option

In this question, we will examine the relationship of treewidth with other graph parameters.

  1. A

    One

  2. B

    Two

  3. C
  4. D
  5. E
  6. F
Show answer

Correct answer

  • B

    Two

Question 15 on its own page

Question 16

+3 marksOne correct option
  1. A

    Yes, this is a valid set of constraints.

  2. B
  3. C
Show answer

Correct answer

  • A

    Yes, this is a valid set of constraints.

Question 16 on its own page

Question 17

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
Question 17 on its own page

Question 18

+2 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 18 on its own page

Question 19

+2 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 19 on its own page

Question 20

+2 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 20 on its own page

Question 21

+2 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 21 on its own page

Question 22

+2 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 22 on its own page

Question 23

+2 marksOne correct option
  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • A

    Yes

Question 23 on its own page

Question 24

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
Question 24 on its own page

Question 25

+2 marksOne correct option
  1. A
  2. B
Show answer

Correct answer

  • A
Question 25 on its own page

Question 26

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 26 on its own page

Question 27

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 27 on its own page

Question 28

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 28 on its own page

Question 29

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 29 on its own page

Question 30

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 30 on its own page

Question 31

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 31 on its own page

Question 32

+2 marksOne correct option

The ILP is guaranteed to be feasible.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 32 on its own page

Question 33

+3 marksOne correct option

Consider the given statements and answer if they are true or false.

The worst-case running time and expected running time are equal to within constant factors for any randomized algorithm.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 33 on its own pageAlso asked in End Term 24 Dec 2023, End Term 24 Dec 2023

Question 34

+3 marksOne correct option

Consider the given statements and answer if they are true or false.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 34 on its own page

Question 35

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 35 on its own page

Question 36

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 36 on its own page

Question 37

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 37 on its own page

Question 38

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 38 on its own page

Question 39

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 39 on its own page

Question 40

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 40 on its own page

Question 41

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 41 on its own page

Question 42

+2 marksOne correct option

After modifying the input instance, we can solve DISJOINT CLUSTER VERTEX DELETION by solving a matching problem on a bipartite graph.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 42 on its own page

Question 43

+2 marksOne correct option

DISJOINT CLUSTER VERTEX DELETION is NP-Hard.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 43 on its own page

Question 44

+2 marksOne correct option
  1. A

    True

  2. B

    False

Show answer

Correct answer

  • A

    True

Question 44 on its own page

Question 45

+3 marksOne correct option
  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • B

    No

Question 45 on its own page

Question 46

+3 marksOne correct option
  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • A

    Yes

Question 46 on its own page

Question 47

+3 marksOne correct option
  1. A

    The problem is solvable in polynomial time.

  2. B

    The problem is NP-complete.

  3. C

    The problem is in P but not known to be NP-complete.

  4. D

    The problem is not in NP.

Show answer

Correct answer

  • B

    The problem is NP-complete.

Question 47 on its own page