uiz Space

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

Programming, Data Structures and Algorithms using Python Quiz 1: 26 October 2025 (September 2025 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 26 Oct 2025, in the September 2025 term: 17 questions for 50 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
17
Marks
50
Duration
120 min
MCQ
9
MSQ
2
Numerical
6
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN EXAM QDD2 26 Oct 2025 · No negative marking.

Question 1

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

Correct answer

  • B
Question 1 on its own page

Question 2

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

Correct answer

  • B
Question 2 on its own page

Question 3

+3 marksOne correct option
  1. A

    35, 51, 39, 47

  2. B

    35, 51, 47

  3. C

    35, 51, 43, 47

  4. D

    35, 55, 39, 47

  5. E

    None of these

Show answer

Correct answer

  • C

    35, 51, 43, 47

Question 3 on its own page

Question 4

+3 marksOne correct option
  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer

Correct answer

  • D

    5

Question 4 on its own page

Question 5

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

Correct answer

  • B
Question 5 on its own page

Question 6

+3 marksOne correct option
  1. A

    Only Statement 1

  2. B

    Only Statement 2

  3. C

    Only Statement 3

  4. D

    Statements 1 and 2

  5. E

    Statements 2 and 3

Show answer

Correct answer

  • A

    Only Statement 1

Question 6 on its own page

Question 7

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

Correct answer

  • C
Question 7 on its own page

Question 8

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

Correct answer

  • A
Question 8 on its own page

Question 9

+2 marksOne correct option
  1. A

    1-a, 2-b, 3-c, 4-d

  2. B

    1-b, 2-a, 3-d, 4-c

  3. C

    1-a, 2-b, 3-d, 4-c

  4. D

    1-c, 2-b, 3-a, 4-d

Show answer

Correct answer

  • B

    1-b, 2-a, 3-d, 4-c

Question 9 on its own page

Question 10

+3 marksOne or more correct options

Select all that apply.

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

Correct answers

  • B
  • E
Question 10 on its own page

Question 11

+3 marksOne or more correct options

Consider a connected, undirected graph G with n vertices. A Breadth-First Search (BFS) traversal is performed starting from a source vertex s. Let d(s, v) denote the shortest distance (in terms of number of edges) from s to vertex v.
Which of the following statements is true about the BFS traversal?

Select all that apply.

  1. A

    All vertices at distance k from s are visited before any vertex at distance k + 1 from s.

  2. B

    Once a vertex is visited, it is never visited again during the traversal.

  3. C

    BFS may fail to visit some vertices, even if the graph is connected.

  4. D

    The time complexity of BFS using an adjacency list representation is O(n²).

Show answer

Correct answers

  • A

    All vertices at distance k from s are visited before any vertex at distance k + 1 from s.

  • B

    Once a vertex is visited, it is never visited again during the traversal.

Question 11 on its own page

Question 12

+3 marksNumerical answer
Show answer

Correct answer: 2

Question 12 on its own page

Question 13

+3 marksNumerical answer
Show answer

Correct answer: 24

Question 13 on its own page

Question 14

+3 marksNumerical answer
Show answer

Correct answer: 6

Question 14 on its own page

Question 15

+3 marksNumerical answer
Show answer

Correct answer: 190

Question 15 on its own page

Question 16

+3 marksNumerical answer
Show answer

Correct answer: 4

Question 16 on its own page

Question 17

+3 marksNumerical answer
Show answer

Correct answer: 2

Question 17 on its own page