uiz Space

January 2025 term · Programming, Data Structures and Algorithms using Python · BSCS2002

Programming, Data Structures and Algorithms using Python End Term: 13 April 2025, Set QDD1 (January 2025 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 13 Apr 2025, in the January 2025 term, set QDD1: 25 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
25
Marks
100
Duration
180 min
MCQ
14
MSQ
5
Numerical
6
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN EXAM QDD3 13 Apr 2025 · No negative marking.

Question 1

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

Correct answer

  • B
Question 1 on its own page

Question 2

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

Correct answer

  • A
Question 2 on its own page

Question 3

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

Correct answer

  • C
Question 3 on its own page

Question 4

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

Correct answer

  • C
Question 4 on its own page

Question 5

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

Correct answer

  • C
Question 5 on its own page

Question 6

+4 marksOne correct option
  1. A

    5, 3, 2, 1, 1, 1

  2. B

    4, 3, 2, 2, 1, 1

  3. C

    5, 3, 2, 1, 2, 1

  4. D

    4, 2, 2, 1, 1, 1

Show answer

Correct answer

  • C

    5, 3, 2, 1, 2, 1

Question 6 on its own page

Question 7

+4 marksOne correct option
  1. A

    7

  2. B

    8

  3. C

    9

  4. D

    10

Show answer

Correct answer

  • B

    8

Question 7 on its own page

Question 8

+4 marksOne correct option
  1. A

    [8, 9, 11, 19, 17, 36, 39, 21, 27]

  2. B

    [8, 9, 11, 19, 17, 36, 39, 27, 21]

  3. C

    [8, 9, 11, 17, 19, 36, 39, 21, 27]

  4. D

    [8, 9, 11, 17, 19, 36, 39, 27, 21]

Show answer

Correct answer

  • D

    [8, 9, 11, 17, 19, 36, 39, 27, 21]

Question 8 on its own page

Question 9

+4 marksOne correct option

While inserting the elements [16, 8, 19, 13, 26, 21, 23, 14, 31] in an empty binary search tree (BST) in the sequence shown, the element at maximum depth is_____________.

  1. A

    26

  2. B

    21

  3. C

    23

  4. D

    31

Show answer

Correct answer

  • C

    23

Question 9 on its own page

Question 10

+4 marksOne correct option
  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer

Correct answer

  • D

    4

Question 10 on its own page

Question 11

+4 marksOne correct option
  1. A

    10

  2. B

    8

  3. C

    6

  4. D

    4

Show answer

Correct answer

  • D

    4

Question 11 on its own page

Question 12

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

Correct answer

  • D
Question 12 on its own page

Question 13

+4 marksOne correct option
  1. A

    8

  2. B

    9

  3. C

    10

  4. D

    11

Show answer

Correct answer

  • D

    11

Question 13 on its own page

Question 14

+4 marksOne correct option
  1. A

    4

  2. B

    5

  3. C

    9

  4. D

    8

Show answer

Correct answer

  • A

    4

Question 14 on its own page

Question 15

+4 marksOne or more correct options

Select all that apply.

  1. A

    13, 24, 32, 26, 63, 12

  2. B

    13, 12, 24, 32, 26, 63

  3. C

    12, 13, 24, 32, 26, 63

  4. D

    63, 26, 32, 24, 13, 12

  5. E

    26, 12, 24, 13, 32, 63

Show answer

Correct answers

  • B

    13, 12, 24, 32, 26, 63

  • C

    12, 13, 24, 32, 26, 63

  • E

    26, 12, 24, 13, 32, 63

Question 15 on its own page

Question 16

+4 marksOne or more correct options

Suppose we obtain the following BFS tree rooted at node G for an undirected graph with vertices {A, B, C, D, E,F, G, H, I, J, K}.

Which of the following can not be an edge/edges in the original graph?

Select all that apply.

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

Correct answers

  • A
  • B
  • C
Question 16 on its own page

Question 17

+4 marksOne or more correct options

Which of the below statements are true about Dynamic programming?

Select all that apply.

  1. A

    Increases both time complexity and space complexity.

  2. B

    It replaces recursion with iteration, so there are no stack overflow errors.

  3. C

    Increases time complexity and decreases space complexity.

  4. D

    It avoids computing sub-problems more than once.

Show answer

Correct answers

  • B

    It replaces recursion with iteration, so there are no stack overflow errors.

  • D

    It avoids computing sub-problems more than once.

Question 17 on its own pageAlso asked in End Term 13 Apr 2025

Question 18

+4 marksOne or more correct options

Select all that apply.

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

Correct answers

  • B
  • C
Question 18 on its own page

Question 19

+4 marksOne or more correct options

Which of these correspond to non-polynomial time complexity?

Select all that apply.

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

Correct answers

  • C
  • D
Question 19 on its own page

Question 20

+4 marksNumerical answer
Show answer

Correct answer: 7

Question 20 on its own page

Question 21

+4 marksNumerical answer

What is the weight of the minimum spanning tree for the given graph?

Show answer

Correct answer: 18

Question 21 on its own page

Question 22

+4 marksNumerical answer
Show answer

Correct answer: 161

Question 22 on its own page

Question 23

+4 marksNumerical answer
Show answer

Correct answer: 17

Question 23 on its own page

Question 24

+4 marksNumerical answer
Show answer

Correct answer: 34

Question 24 on its own page

Question 25

+4 marksNumerical answer
Show answer

Correct answer: 8

Question 25 on its own page