uiz Space

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

Programming, Data Structures and Algorithms using Python Quiz 2: 1 December 2024 (September 2024 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 1 Dec 2024, in the September 2024 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
Numerical
4
MSQ
2
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN EXAM QDD2 01 Dec 2024 · No negative marking.

Question 1

+3 marksOne correct option
  1. A

    A-II, B-I, C-III, D-IV

  2. B

    A-II, B-I, C-IV, D-III

  3. C

    A-I, B-II, C-III, D-IV

  4. D

    A-III, B-II, C-IV, D-I

Show answer

Correct answer

  • A

    A-II, B-I, C-III, D-IV

Question 1 on its own page

Question 2

+3 marksOne correct option
  1. A

    B, E, C, F, A, D, G

  2. B

    B, E, F, A, C, G, D

  3. C

    B, E, F, C, A, G, D

  4. D

    B, E, F, A, C, D, G

Show answer

Correct answer

  • C

    B, E, F, C, A, G, D

Question 2 on its own page

Question 3

+3 marksOne correct option
  1. A

    Only statement 1 is correct.

  2. B

    Only statement 2 is correct.

  3. C

    Both statements are correct.

  4. D

    Both statements are incorrect.

Show answer

Correct answer

  • C

    Both statements are correct.

Question 3 on its own page

Question 4

+3 marksOne correct option
  1. A

    C

  2. B

    E

  3. C

    F

  4. D

    I

Show answer

Correct answer

  • B

    E

Question 4 on its own page

Question 5

+3 marksOne correct option
  1. A

    14

  2. B

    15

  3. C

    16

  4. D

    17

Show answer

Correct answer

  • A

    14

Question 5 on its own page

Question 6

+3 marksOne correct option

Select the correct match of recurrence relation with corresponding complexity.

  1. A

    A-2, B-4, C-3, D-1

  2. B

    A-2, B-3, C-4, D-1

  3. C

    A-2, B-3, C-1, D-4

  4. D

    A-3, B-2, C-4, D-1

Show answer

Correct answer

  • B

    A-2, B-3, C-4, D-1

Question 6 on its own page

Question 7

+3 marksOne correct option

Apply the divide and conquer strategy to find the closest pair of points in a set. After dividing the set into two halves and recursively finding the closest pairs in each half, what additional step is required?

  1. A

    Combine the results directly

  2. B

    Perform a linear search for the closest pair

  3. C

    Consider pairs that span both halves

  4. D

    Sort the points by their distances

Show answer

Correct answer

  • C

    Consider pairs that span both halves

Question 7 on its own pageAlso asked in Quiz 2 24 Mar 2024

Question 8

+3 marksOne correct option
  1. A

    Only statement 1 is correct.

  2. B

    Only statement 2 is correct.

  3. C

    Both statements are correct.

  4. D

    Both statements are incorrect.

Show answer

Correct answer

  • B

    Only statement 2 is correct.

Question 8 on its own page

Question 9

+3 marksNumerical answer
Show answer

Correct answer: 12

Question 9 on its own page

Question 10

+3 marksNumerical answer
Show answer

Correct answer: 88

Question 10 on its own page

Question 11

+3 marksNumerical answer
Show answer

Correct answer: 5

Question 11 on its own page

Question 12

+3 marksNumerical answer
Show answer

Correct answer: 136

Question 12 on its own page

Question 13

+3 marksOne or more correct options

Select all that apply.

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

Correct answers

  • A
  • B
Question 13 on its own page

Question 14

+3 marksOne or more correct options

Consider a min-heap with 45 distinct elements implemented using array A with index 0 to 44. The largest element can not be in between ___.

Select all that apply.

  1. A

    A[11] and A[21] (both inclusive)

  2. B

    A[0] and A[10] (both inclusive)

  3. C

    A[31] and A[44] (both inclusive)

  4. D

    A[22] and A[30] (both inclusive)

Show answer

Correct answers

  • A

    A[11] and A[21] (both inclusive)

  • B

    A[0] and A[10] (both inclusive)

Question 14 on its own page

Question 15

+4 marksOne correct option
  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    0

Show answer

Correct answer

  • A

    1

Question 15 on its own page

Question 16

+4 marksOne correct option
  1. A

    15 bits

  2. B

    16 bits

  3. C

    17 bits

  4. D

    18 bits

Show answer

Correct answer

  • D

    18 bits

Question 16 on its own page