PDSA

Section Id : 64065387444
Section Number : 4
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 26
Number of Questions to be attempted : 26
Section Marks : 100
Display Number Panel : Yes
Section Negative Marks : 0
Group All Questions : No
Enable Mark as Answered Mark for Review and
No
Clear Response :
Section Maximum Duration : 0
Section Minimum Duration : 0
Section Time In : Minutes
Maximum Instruction Time : 0
Sub-Section Number : 1
Sub-Section Id : 640653193194
Question Shuffling Allowed : No

Question Number : 65 Question Id : 6406531246033 Question Type : MCQ

Correct Marks : 0
Question Label : Multiple Choice Question
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : PROGRAMMING, DATA
STRUCTURES AND ALGORITHMS USING PYTHON (COMPUTER BASED EXAM)"

ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT?
CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN.

(IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS
REGISTERED BY YOU)
Options :
6406534201083. YES
6406534201084. NO
Sub-Section Number : 2
Sub-Section Id : 640653193195
Question Shuffling Allowed : Yes

Question Number : 66 Question Id : 6406531246034 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :

6406534201085.

6406534201086.

6406534201087.

6406534201088.

Question Number : 67 Question Id : 6406531246035 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406534201089. 2
6406534201090. 3
6406534201091. 4
6406534201092. 5

Question Number : 68 Question Id : 6406531246036 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question
What is the worst case time complexity of Selection Sort ?
Options :

6406534201093.

6406534201094.

6406534201095.

6406534201096.

Question Number : 69 Question Id : 6406531246037 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :

6406534201097.

6406534201098.

6406534201099.

6406534201100.

Question Number : 70 Question Id : 6406531246038 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question
Consider a graph G with V vertices and E edges represented using an adjacency list. What is the
worst case complexity for Breadth First Search?
Options :

6406534201101.

6406534201102.

6406534201103.

6406534201104.

Question Number : 71 Question Id : 6406531246039 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201105. 8
6406534201106. 7
6406534201107. 6
6406534201108. 5

Question Number : 72 Question Id : 6406531246040 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201109. [41, 29, 26, 17, 15, 10, 9, 12, 11]
6406534201110. [41, 29, 26, 17, 15, 10, 9, 11, 12]
6406534201111. [41, 29, 26, 15, 17, 10, 9, 11, 12]
6406534201112. [41, 29, 26, 15, 17, 10, 9, 12, 11]

Question Number : 73 Question Id : 6406531246041 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question
While inserting the elements [13, 7, 26, 33, 5, 10, 12, 11, 9] in an empty binary search tree (BST) in
the sequence shown, the element at maximum depth is__.
Options :
6406534201113. 33
6406534201114. 9
6406534201115. 11
6406534201116. 5

Question Number : 74 Question Id : 6406531246042 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201117. 1
6406534201118. 2
6406534201119. 3
6406534201120. 4

Question Number : 75 Question Id : 6406531246043 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :

6406534201121.

6406534201122.

6406534201123.

6406534201124.

Question Number : 76 Question Id : 6406531246044 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201125. 8
6406534201126. 6
6406534201127. 4
6406534201128. 2

Question Number : 77 Question Id : 6406531246045 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201129. 5
6406534201130. 6
6406534201131. 7
6406534201132. 8

Question Number : 78 Question Id : 6406531246046 Question Type : MCQ

Correct Marks : 4
Question Label : Multiple Choice Question

Options :
6406534201133. 4
6406534201134. 5
6406534201135. 11
6406534201136. 12
Sub-Section Number : 3
Sub-Section Id : 640653193196
Question Shuffling Allowed : Yes

Question Number : 79 Question Id : 6406531246047 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :

6406534201137.

6406534201138.

6406534201139.

6406534201140.

Question Number : 80 Question Id : 6406531246048 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :
6406534201141. 22, 33, 44, 52, 26, 63
6406534201142. 22, 26, 33, 44, 52, 63
6406534201143. 26, 44, 33, 22, 52, 63
6406534201144. 33, 44, 52, 22, 26, 63
6406534201145. 44, 33, 52, 22, 26, 63

Question Number : 81 Question Id : 6406531246049 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Which of the following statement is/are false?
Options :

6406534201146.

6406534201147.
6406534201148.

6406534201149.

Question Number : 82 Question Id : 6406531246050 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Which of the below statements are true about Dynamic programming?
Options :
6406534201150. Increases both time complexity and space complexity.
6406534201151. It replaces recursion with iteration, so there are no stack overflow errors.
6406534201152. Increases time complexity and decreases space complexity.
6406534201153. It avoids computing sub-problems more than once.

Question Number : 83 Question Id : 6406531246051 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Which of these correspond to non-polynomial time complexity?
Options :

6406534201154.

6406534201155.

6406534201156.

6406534201157.

6406534201158.

Question Number : 84 Question Id : 6406531246052 Question Type : MSQ

Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question

Options :

6406534201159.

6406534201160.

6406534201161.

6406534201162.

6406534201163.

Sub-Section Number : 4
Sub-Section Id : 640653193197
Question Shuffling Allowed : Yes

Question Number : 85 Question Id : 6406531246053 Question Type : SA

Correct Marks : 4
Question Label : Short Answer Question
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
6

Question Number : 86 Question Id : 6406531246054 Question Type : SA

Correct Marks : 4
Question Label : Short Answer Question

Response Type : Numeric

Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
15
Question Number : 87 Question Id : 6406531246055 Question Type : SA
Correct Marks : 4
Question Label : Short Answer Question

Response Type : Numeric

Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
164

Question Number : 88 Question Id : 6406531246056 Question Type : SA

Correct Marks : 4
Question Label : Short Answer Question

Response Type : Numeric

Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
8

Question Number : 89 Question Id : 6406531246057 Question Type : SA

Correct Marks : 4
Question Label : Short Answer Question

Response Type : Numeric

Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
18

Question Number : 90 Question Id : 6406531246058 Question Type : SA

Correct Marks : 4
Question Label : Short Answer Question

Response Type : Numeric

Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText