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 QDD1 (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 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 31 Aug 2025 · No negative marking.

Question 1

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

Correct answer

  • C
Question 1 on its own page

Question 2

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

Correct answer

  • B
Question 2 on its own page

Question 3

+4 marksOne correct option
  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer

Correct answer

  • D

    5

Question 3 on its own page

Question 4

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

Correct answer

  • C
Question 4 on its own page

Question 5

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

Correct answer

  • B
Question 5 on its own page

Question 6

+4 marksOne correct option

Given a weighted graph where weights of all edges are unique, there is always a unique shortest path from a source to destination in such a graph.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

Question 6 on its own page

Question 7

+4 marksOne correct option
  1. A

    [65, 50, 55, 30, 40, 35, 45, 10, 20]

  2. B

    [65, 50, 55, 40, 30, 35, 45, 10, 20]

  3. C

    [65, 55, 50, 40, 30, 35, 45, 10, 20]

  4. D

    [65, 50, 55, 40, 30, 35, 45, 20, 10]

Show answer

Correct answer

  • B

    [65, 50, 55, 40, 30, 35, 45, 10, 20]

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
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
Question 9 on its own page

Question 10

+4 marksOne correct option
  1. A

    4

  2. B

    5

  3. C

    6

  4. D

    7

Show answer

Correct answer

  • C

    6

Question 10 on its own page

Question 11

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

Correct answer

  • D
Question 11 on its own page

Question 12

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

Correct answer

  • A
Question 12 on its own page

Question 13

+4 marksOne correct option
  1. A

    14

  2. B

    15

  3. C

    13

  4. D

    16

Show answer

Correct answer

  • A

    14

Question 13 on its own page

Question 14

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

Correct answer

  • C
Question 14 on its own page

Question 15

+4 marksOne or more correct options

Which of the following sorting algorithms will have the same time complexity irrespective of the sequence of elements in the input?

Select all that apply.

  1. A

    Selection Sort

  2. B

    Merge Sort

  3. C

    Quick Sort

  4. D

    Insertion Sort

Show answer

Correct answers

  • A

    Selection Sort

  • B

    Merge Sort

Question 15 on its own pageAlso asked in End Term 3 Sept 2023, End Term 3 Sept 2023

Question 16

+4 marksOne or more correct options

Select all that apply.

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

Correct answers

  • B
  • D
Question 16 on its own page

Question 17

+4 marksOne or more correct options

Select all that apply.

  1. A

    13

  2. B

    8

  3. C

    9

  4. D

    10

  5. E

    11

Show answer

Correct answers

  • B

    8

  • C

    9

Question 17 on its own page

Question 18

+4 marksOne or more correct options

Select all that apply.

  1. A

    10

  2. B

    20

  3. C

    22

  4. D

    25

  5. E

    40

Show answer

Correct answers

  • A

    10

  • C

    22

  • E

    40

Question 18 on its own page

Question 19

+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
  • D
  • E
Question 19 on its own page

Question 20

+4 marksNumerical answer

An undirected graph has 300 edges. What is the minimum number of vertices it must have?

Show answer

Correct answer: 25

Question 20 on its own page

Question 21

+4 marksNumerical answer
Show answer

Correct answer: 8

Question 21 on its own page

Question 22

+4 marksNumerical answer
Show answer

Correct answer: 14

Question 22 on its own page

Question 23

+4 marksNumerical answer

A binary tree has 7 nodes. What is the minimum possible height of this tree (assuming the empty tree height is 0)?

Show answer

Correct answer: 3

Question 23 on its own page

Question 24

+4 marksNumerical answer
Show answer

Correct answer: 6

Question 24 on its own page

Question 25

+4 marksNumerical answer
Show answer

Correct answer: 76

Question 25 on its own page