Quiz Space

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

PDSA End Term: 1 September 2024, Set QDF1 (May 2024 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 1 Sept 2024, in the May 2024 term, set QDF1: 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
16
Numerical
5
MSQ
4
Take as mock testPractise with answers

Updated

Official paper: IIT M FOUNDATION DIPLOMA AN EXAM QDF3 01 Sep 2024 · 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

    8

  2. B

    9

  3. C

    10

  4. D

    11

Show answer

Correct answer

  • A

    8

Question 2 on its own page

Question 3

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

Correct answer

  • C
Question 3 on its own page

Question 4

+4 marksOne correct option
  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer

Correct answer

  • D

    4

Question 4 on its own page

Question 5

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

Correct answer

  • A
Question 5 on its own page

Question 6

+4 marksOne correct option
  1. A

    6,3,2,1,4,5,7

  2. B

    6,3,2,1,5,4,7

  3. C

    6,3,2,4,1,5,7

  4. D

    6,3,5,7,2,4,1

Show answer

Correct answer

  • A

    6,3,2,1,4,5,7

Question 6 on its own page

Question 7

+4 marksOne correct option
  1. A

    4

  2. B

    5

  3. C

    3

  4. D

    6

Show answer

Correct answer

  • D

    6

Question 7 on its own page

Question 8

+4 marksOne correct option
  1. A

    Only I is correct

  2. B

    Only II is Correct

  3. C

    Both I and II are correct

  4. D

    Both I and II are incorrect

Show answer

Correct answer

  • B

    Only II is Correct

Question 8 on its own page

Question 9

+4 marksOne correct option
  1. A

    Only statement I and II are correct

  2. B

    Only statement I and III are correct

  3. C

    Only statement II and III are correct

  4. D

    All statements are correct

  5. E

    All statements are incorrect

Show answer

Correct answer

  • A

    Only statement I and II are correct

Question 9 on its own page

Question 10

+4 marksOne correct option
  1. A

    12

  2. B

    11

  3. C

    14

  4. D

    8 is a leaf node.

Show answer

Correct answer

  • B

    11

Question 10 on its own page

Question 11

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

Correct answer

  • A
Question 11 on its own page

Question 12

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

Correct answer

  • B
Question 12 on its own page

Question 13

+4 marksOne correct option
  1. A

    14

  2. B

    25

  3. C

    19

  4. D

    20

Show answer

Correct answer

  • C

    19

Question 13 on its own page

Question 14

+4 marksOne correct option

Let Z be an NP-complete problem and X and Y be two other problems not known to be in NP. X is polynomial time reducible to Z and Z is polynomial-time reducible to Y. Which one of the following statements is true?

  1. A

    Y is NP-complete

  2. B

    Y is NP-hard

  3. C

    X is NP-complete

  4. D

    X is NP-hard

Show answer

Correct answer

  • B

    Y is NP-hard

Question 14 on its own pageAlso asked in End Term 1 Sept 2024

Question 15

+4 marksNumerical answer
Show answer

Correct answer: 3

Question 15 on its own page

Question 16

+4 marksNumerical answer
Show answer

Correct answer: 13

Question 16 on its own page

Question 17

+4 marksNumerical answer
Show answer

Correct answer: 7

Question 17 on its own page

Question 18

+4 marksNumerical answer
Show answer

Correct answer: 7

Question 18 on its own page

Question 19

+4 marksNumerical answer
Show answer

Correct answer: 52

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
Show answer

Correct answers

  • A
  • D
Question 20 on its own page

Question 21

+4 marksOne or more correct options

Consider a binary max-heap implemented using list. Which of the following lists represents a binary max-heap?

Select all that apply.

  1. A

    [25, 12, 16, 13, 10, 8, 14]

  2. B

    [25, 14, 13, 16, 10, 8, 12]

  3. C

    [25, 14, 16, 13, 10, 8, 12]

  4. D

    [25, 14, 16, 13, 12, 8, 10]

Show answer

Correct answers

  • C

    [25, 14, 16, 13, 10, 8, 12]

  • D

    [25, 14, 16, 13, 12, 8, 10]

Question 21 on its own page

Question 22

+4 marksOne or more correct options

Which of the following statement(s) is/are true about Huffman algorithm ?

Select all that apply.

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

Correct answers

  • A
  • B
Question 22 on its own page

Question 23

+4 marksOne or more correct options

Select all that apply.

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

Correct answers

  • A
  • B
  • D
Question 23 on its own page

Question 24

+4 marksOne correct option

Based on the above data, answer the given subquestions.

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

Correct answer

  • A
Question 24 on its own page

Question 25

+4 marksOne correct option

Based on the above data, answer the given subquestions.

What is the time complexity of the given algorithm ?

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

Correct answer

  • C
Question 25 on its own page