uiz Space

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

Programming, Data Structures and Algorithms using Python Quiz 2: 16 March 2025 (January 2025 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term: 16 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
16
Marks
50
Duration
120 min
MCQ
10
MSQ
2
Numerical
4
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN EXAM QDD2 16 Mar 2025 · No negative marking.

Question 1

+3 marksOne correct option
  1. A

    P R T S U Q V

  2. B

    P R T S Q U V

  3. C

    P R T U S V Q

  4. D

    P R T S U V Q

Show answer

Correct answer

  • D

    P R T S U V Q

Question 1 on its own page

Question 2

+3 marksOne correct option
  1. A

    Only statement I is true

  2. B

    Only statement II is true

  3. C

    Both statements are true

  4. D

    Both statements are not true

Show answer

Correct answer

  • B

    Only statement II is true

Question 2 on its own page

Question 3

+3 marksOne correct option

What is the minimum and maximum number of nodes possible in AVL Trees with height 9? Assume that the height of the empty tree is 0.

  1. A

    Minimum: 255, Maximum: 1023

  2. B

    Minimum: 9, Maximum: 255

  3. C

    Minimum: 88, Maximum: 511

  4. D

    Minimum: 256, Maximum: 511

Show answer

Correct answer

  • C

    Minimum: 88, Maximum: 511

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

  • C

    4

Question 4 on its own page

Question 5

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

Correct answer

  • C
Question 5 on its own page

Question 6

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

Correct answer

  • C
Question 6 on its own page

Question 7

+3 marksOne correct option
  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
  1. A

    3

  2. B

    4

  3. C

    5

  4. D

    6

Show answer

Correct answer

  • A

    3

Question 8 on its own page

Question 9

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

Correct answer

  • D
Question 9 on its own page

Question 10

+4 marksOne correct option
  1. A

    A - 3, B - 3, C - 5, D - 1, E - 5, F - 4

  2. B

    A - 3, B - 2, C - 5, D - 2, E - 5, F - 4

  3. C

    A - 3, B - 3, C - 5, D - 2, E - 5, F - 4

  4. D

    A - 3, B - 2, C - 5, D - 1, E - 5, F - 4

Show answer

Correct answer

  • D

    A - 3, B - 2, C - 5, D - 1, E - 5, F - 4

Question 10 on its own page

Question 11

+3 marksOne or more correct options

Which of the following is/are always true about the Floyd-Warshall algorithm?

Select all that apply.

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

Correct answers

  • A
  • C
Question 11 on its own page

Question 12

+3 marksOne or more correct options

Which of the following arrays represent a valid min-heap when implemented as a 0-indexed array?

Select all that apply.

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

Correct answers

  • A
  • D
Question 12 on its own page

Question 13

+3 marksNumerical answer
Show answer

Correct answer: 72

Question 13 on its own page

Question 14

+3 marksNumerical answer
Show answer

Correct answer: 9

Question 14 on its own page

Question 15

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: 6

Question 15 on its own page

Question 16

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: 2

Question 16 on its own page