Quiz Space

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

PDSA Quiz 1: 16 October 2022 (September 2022 term)

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

Updated

Official paper: IIT M QUIZ 1 FOUNDATION DAD DIPLOMA QPD2 16 Oct 2022 · No negative marking.

Question 1

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

Correct answer

  • C
Question 1 on its own page

Question 2

+3 marksOne correct option
  1. A

    36

  2. B

    29

  3. C

    49

  4. D

    37

Show answer

Correct answer

  • C

    49

Question 2 on its own page

Question 3

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

Correct answer

  • C
Question 3 on its own page

Question 4

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

Correct answer

  • D
Question 4 on its own page

Question 5

+3 marksOne correct option
  1. A

    1 and 2

  2. B

    1 and 3

  3. C

    2 and 3

  4. D

    1, 2 and 3

Show answer

Correct answer

  • C

    2 and 3

Question 5 on its own page

Question 6

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

Correct answer

  • D
Question 6 on its own page

Question 7

+3 marksOne correct option
  1. A

    1, 2 and 4

  2. B

    1, 2 and 3

  3. C

    2, 3 and 4

  4. D

    1, 2, 3 and 4

Show answer

Correct answer

  • B

    1, 2 and 3

Question 7 on its own page

Question 8

+3 marksOne correct option
  1. A

    23, 36, 72, 12, 54, 83

  2. B

    36, 72, 23, 12, 54, 83

  3. C

    36, 23, 72, 12, 83, 54

  4. D

    36, 23, 72, 12, 54, 83

Show answer

Correct answer

  • C

    36, 23, 72, 12, 83, 54

Question 8 on its own page

Question 9

+3 marksOne correct option
  1. A

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

  2. B

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

  3. C

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

  4. D

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

Show answer

Correct answer

  • A

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

Question 9 on its own page

Question 10

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

Correct answer

  • C
Question 10 on its own page

Question 11

+3 marksOne correct option
  1. A

    6, 6, 6, 6, 6, 6, 1

  2. B

    4, 4, 4, 3, 3, 3, 2

  3. C

    5, 4, 3, 3, 2, 2, 1

  4. D

    7, 7, 6, 2, 1, 1, 2

Show answer

Correct answer

  • C

    5, 4, 3, 3, 2, 2, 1

Question 11 on its own page

Question 12

+3 marksOne correct option

Let G be an undirected connected graph and T be a breadth-first search tree for G, let x and y be nodes in T belonging to the levels i and j respectively, and let (x,y) be an edge of G. Then i and j differ by at most___.

  1. A

    0

  2. B

    1

  3. C

    2

  4. D

    3

Show answer

Correct answer

  • B

    1

Question 12 on its own page

Question 13

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

Correct answer

  • A
Question 13 on its own page

Question 14

+3 marksOne or more correct options

Which of the following statement(s) is/are true about Breadth First Search (BFS) on an undirected graph?

Select all that apply.

  1. A

    BFS systematically computes reachability in graphs.

  2. B

    The Time complexity of BFS is O(mn) when Adjacency List is used and O(m²) when Adjacency Matrix is used, where m represents the number of vertices and n represents the number of edges.

  3. C

    BFS cannot be used to check for cycles in the graph.

  4. D

    Paths discovered by BFS are the shortest paths in terms of the number of edges from source to destination.

Show answer

Correct answers

  • A

    BFS systematically computes reachability in graphs.

  • D

    Paths discovered by BFS are the shortest paths in terms of the number of edges from source to destination.

Question 14 on its own page

Question 15

+4 marksNumerical answer

NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 8

Question 15 on its own page

Question 16

+4 marksNumerical answer

A university offers an online learning program in which there are 12 courses in total. The program is divided into semesters of 6 months. Students can take any number of courses in one semester, but they can take a course only if they have finished taking its prerequisites.

There is no constraint on how many courses a student can take in a semester. The minimum number of semesters required to complete all 12 courses is ___.
NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 4

Question 16 on its own page