Quiz Space

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

PDSA Quiz 1: 26 February 2023 (January 2023 term)

The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 26 Feb 2023, in the January 2023 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
3
MSQ
3
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA AN2 EXAM QPD2 26 Feb 2023 · No negative marking.

Question 1

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

Correct answer

  • D
Question 1 on its own page

Question 2

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

Correct answer

  • D
Question 2 on its own page

Question 3

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

Correct answer

  • B
Question 3 on its own page

Question 4

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

Correct answer

  • C
Question 4 on its own page

Question 5

+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

  • D

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

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
  2. B
  3. C
  4. D
Show answer

Correct answer

  • C
Question 7 on its own page

Question 8

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

Correct answer

  • D
Question 8 on its own page

Question 9

+3 marksOne correct option
  1. A

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

  2. B

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

  3. C

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

  4. D

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

Show answer

Correct answer

  • A

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

Question 9 on its own page

Question 10

+3 marksOne correct option
  1. A

    3

  2. B

    4

  3. C

    5

  4. D

    6

  5. E

    7

Show answer

Correct answer

  • C

    5

Question 10 on its own page

Question 11

+4 marksNumerical answer
Show answer

Correct answer: 9

Question 11 on its own page

Question 12

+4 marksNumerical answer
Show answer

Correct answer: 5

Question 12 on its own page

Question 13

+4 marksNumerical answer
Show answer

Correct answer: 12

Question 13 on its own page

Question 14

+3 marksOne or more correct options

Select all that apply.

  1. A

    Insertion of the new node at the front of the linked list.

  2. B

    Insertion of the new node at the end of the linked list.

  3. C

    Deletion of the first node of the linked list.

  4. D

    Deletion of the last node of the linked list.

  5. E

    Deletion of the second node (from starting) of the linked list

Show answer

Correct answers

  • A

    Insertion of the new node at the front of the linked list.

  • B

    Insertion of the new node at the end of the linked list.

  • C

    Deletion of the first node of the linked list.

  • E

    Deletion of the second node (from starting) of the linked list

Question 14 on its own page

Question 15

+3 marksOne or more correct options

Select all that apply.

  1. A

    1,1,1,1,1,1

  2. B

    2,2,2,2,2,2

  3. C

    1,1,2,2,3,5

  4. D

    1,2,2,2,3,3

Show answer

Correct answers

  • B

    2,2,2,2,2,2

  • C

    1,1,2,2,3,5

Question 15 on its own page

Question 16

+3 marksOne or more correct options

Which of the following statement(s) is/are true about Depth First Search (DFS) on an undirected and connected graph?

Select all that apply.

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

Correct answers

  • A
  • B
  • C
  • E
Question 16 on its own page