uiz Space

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

Programming, Data Structures and Algorithms using Python End Term: 31 August 2025, Set QDD3 (May 2025 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 31 Aug 2025, in the May 2025 term, set QDD3: 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
6
Numerical
5
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN EXAM QDD3 31 Aug 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

  • D
Question 2 on its own page

Question 3

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

Correct answer

  • A
Question 3 on its own page

Question 4

+4 marksOne correct option

Consider the following statements:
1. While creating a DFS tree for a directed graph, among non-tree edges, only back edges correspond to cycles.
2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
Choose the correct option.

  1. A

    Only statement 1 is true

  2. B

    Only statement 2 is true

  3. C

    Both statements 1 and 2 are true

  4. D

    Both statements 1 and 2 are false

Show answer

Correct answer

  • C

    Both statements 1 and 2 are true

Question 4 on its own pageAlso asked in Quiz 1 16 Jul 2023

Question 5

+4 marksOne correct option

Given a graph where all edges have positive weights, the shortest path identified by Dijkstra's and Bellman Ford algorithm may be different but path weight would be same.

  1. A

    TRUE

  2. B

    FALSE

Show answer

Correct answer

  • A

    TRUE

Question 5 on its own page

Question 6

+4 marksOne correct option
  1. A

    3, 5, 4, 10

  2. B

    3, 5, 5, 9

  3. C

    2, 5, 5, 10

  4. D

    2, 5, 4, 9

Show answer

Correct answer

  • D

    2, 5, 4, 9

Question 6 on its own page

Question 7

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

Correct answer

  • D
Question 7 on its own page

Question 8

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

Correct answer

  • C
Question 8 on its own page

Question 9

+4 marksOne correct option
  1. A

    4

  2. B

    5

  3. C

    6

  4. D

    7

Show answer

Correct answer

  • B

    5

Question 9 on its own page

Question 10

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

Correct answer

  • C
Question 10 on its own page

Question 11

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

Correct answer

  • C
Question 11 on its own page

Question 12

+4 marksOne correct option
  1. A

    Edges {cd, bd}

  2. B

    Edges {cb, cd, bt}

  3. C

    Edges {ab, cd, cb}

  4. D

    Edges {bt, bd}

Show answer

Correct answer

  • C

    Edges {ab, cd, cb}

Question 12 on its own page

Question 13

+4 marksOne correct option
  1. A

    Only statement 1 is correct

  2. B

    Only statement 2 is correct

  3. C

    Both the statements are correct

  4. D

    Both the statements are wrong

Show answer

Correct answer

  • B

    Only statement 2 is correct

Question 13 on its own page

Question 14

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

Correct answer

  • B
Question 14 on its own page

Question 15

+4 marksOne or more correct options

Select all that apply.

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

Correct answers

  • B
  • C
Question 15 on its own page

Question 16

+4 marksOne or more correct options

Select all that apply.

  1. A

    17

  2. B

    37

  3. C

    62

  4. D

    57

  5. E

    82

Show answer

Correct answers

  • A

    17

  • B

    37

  • E

    82

Question 16 on its own page

Question 17

+4 marksOne or more correct options

Select all that apply.

  1. A

    23, 36, 72, 12, 54, 83

  2. B

    36, 72, 23, 54, 12, 83

  3. C

    36, 23, 72, 12, 83, 54

  4. D

    36, 23, 72, 12, 54, 83

Show answer

Correct answers

  • A

    23, 36, 72, 12, 54, 83

  • D

    36, 23, 72, 12, 54, 83

Question 17 on its own page

Question 18

+4 marksOne or more correct options

Select all that apply.

  1. A

    1

  2. B

    5

  3. C

    3

  4. D

    4

  5. E

    6

  6. F

    7

Show answer

Correct answers

  • A

    1

  • C

    3

  • E

    6

Question 18 on its own page

Question 19

+4 marksOne or more correct options

Select all that apply.

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

  5. E

    9

Show answer

Correct answers

  • A

    2

  • D

    5

  • E

    9

Question 19 on its own page

Question 20

+4 marksOne or more correct options

Select all that apply.

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

Correct answers

  • A
  • B
  • C
  • D
Question 20 on its own page

Question 21

+4 marksNumerical answer

What is the maximum number of edges in a directed graph with 9 vertices?

Show answer

Correct answer: 72

Question 21 on its own page

Question 22

+4 marksNumerical answer
Show answer

Correct answer: 10

Question 22 on its own page

Question 23

+4 marksNumerical answer

What is the minimum possible height of a binary tree with 12 nodes (assuming the empty tree height is 0)?

Show answer

Correct answer: 4

Question 23 on its own page

Question 24

+4 marksNumerical answer
Show answer

Correct answer: 5

Question 24 on its own page

Question 25

+4 marksNumerical answer
Show answer

Correct answer: 66

Question 25 on its own page