Quiz Space

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

PDSA End Term: 24 December 2023, Set ADD3 (September 2023 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 24 Dec 2023, in the September 2023 term, set ADD3: 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
17
MSQ
3
Numerical
5
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA FN EXAM FDD1 24 Dec 2023 · No negative marking.

Question 1

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

Correct answer

  • D
Question 1 on its own page

Question 2

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

Correct answer

  • A
Question 2 on its own page

Question 3

+4 marksOne correct option
  1. A

    4

  2. B

    6

  3. C

    9

  4. D

    10

Show answer

Correct answer

  • C

    9

Question 3 on its own page

Question 4

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

Correct answer

  • A
Question 4 on its own page

Question 5

+4 marksOne correct option
  1. A

    A

  2. B

    B

  3. C

    C

  4. D

    D

Show answer

Correct answer

  • D

    D

Question 5 on its own page

Question 6

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

Correct answer

  • A
Question 6 on its own page

Question 7

+4 marksOne correct option
  1. A

    1, 4, 3, 6, 5, 2

  2. B

    1, 4, 5, 6, 3, 2

  3. C

    1, 4, 6, 5, 3, 2

  4. D

    1, 4, 6, 3, 5, 2

Show answer

Correct answer

  • C

    1, 4, 6, 5, 3, 2

Question 7 on its own page

Question 8

+4 marksOne correct option
  1. A

    This strategy will not solve the problem correctly.

  2. B

    This strategy will only work if the graph is acyclic.

  3. C

    This strategy will solve the problem correctly and is as efficient as Dijkstra’s algorithm.

  4. D

    This strategy will solve the problem correctly, but is not as efficient as Dijkstra’s algorithm.

Show answer

Correct answer

  • D

    This strategy will solve the problem correctly, but is not as efficient as Dijkstra’s algorithm.

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

    [40, 20, 5, 15, 23, 10, 3, 2]

  2. B

    [40, 23, 10, 15, 20, 2, 3, 5]

  3. C

    [40, 23, 20, 15, 10, 2, 3, 5]

  4. D

    [40, 23, 10, 20, 15, 2, 3, 5]

Show answer

Correct answer

  • D

    [40, 23, 10, 20, 15, 2, 3, 5]

Question 10 on its own page

Question 11

+4 marksOne correct option
  1. A

    19

  2. B

    15

  3. C

    16

  4. D

    21

Show answer

Correct answer

  • B

    15

Question 11 on its own page

Question 12

+4 marksOne correct option
  1. A

    4

  2. B

    5

  3. C

    6

  4. D

    7

Show answer

Correct answer

  • B

    5

Question 12 on its own page

Question 13

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

Correct answer

  • D
Question 13 on its own page

Question 14

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

Correct answer

  • B
Question 14 on its own page

Question 15

+4 marksOne correct option

Which of the following combination of input text T and pattern P will exhibit the worst case running time behavior for Boyer-Moore skipping heuristic?

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

Correct answer

  • C
Question 15 on its own page

Question 16

+4 marksOne correct option
  1. A

    2x + y <= 50

  2. B

    x + 2y <= 50

  3. C

    x >= 0 , y >= 0

  4. D

    x + 2y <= 40

Show answer

Correct answer

  • B

    x + 2y <= 50

Question 16 on its own page

Question 17

+4 marksOne correct option
  1. A

    It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of n, and every subject node in G is connected to the sink node with capacity of 2n.

  2. B

    It can be modelled as a network flow problem, where the source node is connected to every teacher node in G, and every subject node in G is connected to the sink node. All edges in the network flow graph have equal capacity.

  3. C

    It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of 2, and every subject node in G is connected to the sink node with capacity of 1.

  4. D

    It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of 1, and every subject node in G is connected to the sink node with capacity of 2.

Show answer

Correct answer

  • C

    It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of 2, and every subject node in G is connected to the sink node with capacity of 1.

Question 17 on its own page

Question 18

+4 marksOne or more correct options

Select all that apply.

  1. A

    E - F - C - D - B - A

  2. B

    F - E - A - C - D - B

  3. C

    F - E - A - D - C - B

  4. D

    E - F - C - D - A - B

  5. E

    F - C - D - A - E - B

Show answer

Correct answers

  • A

    E - F - C - D - B - A

  • B

    F - E - A - C - D - B

  • D

    E - F - C - D - A - B

Question 18 on its own page

Question 19

+4 marksOne or more correct options

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

Select all that apply.

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

Correct answers

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

Question 20

+4 marksOne or more correct options

Which of the following is/are true about AVL Tree? Assume that the height of the empty tree is 0.

Select all that apply.

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

Correct answers

  • A
  • B
Question 20 on its own page

Question 21

+4 marksNumerical answer

Consider a simple undirected connected graph G with 65 edges with the least number of vertices possible. What will be the number of vertices in graph G?

Show answer

Correct answer: 12

Question 21 on its own page

Question 22

+4 marksNumerical answer

In a binary tree T of 25 nodes, if the number of nodes with two children is 6, then the number of nodes with one child is ___ .

Show answer

Correct answer: 12

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

Question 23

+4 marksNumerical answer

The pre-order traversal of a binary search tree is:
4, 1, 3, 2, 7, 5, 6, 8
What would be the sum of elements stored in the leaf nodes of a binary search tree?

Show answer

Correct answer: 16

Question 23 on its own page

Question 24

+4 marksNumerical answer
Show answer

Correct answer: 3

Question 24 on its own page

Question 25

+4 marksNumerical answer
Show answer

Correct answer: 26

Question 25 on its own page