7

Question Number : 134 Question Id : 640653815075 Question Type : MSQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 2 Max. Selectable Options : 0

Question Label : Multiple Select Question

Choose the correct expression(s) for the statement given below:

Name all the teams from England, with atmost 5 wins and at least 3 draws.

Options :

6406532730865.

6406532730866.

6406532730867.

6406532730868.

PDSA
Section Id : 64065356657

Section Number : 7

Section type : Online

Mandatory or Optional : Mandatory

Number of Questions : 24
Number of Questions to be attempted : 24

Section Marks : 100

Display Number Panel : Yes

Section Negative Marks : 0

Group All Questions : No

Enable Mark as Answered Mark for Review and

Yes
Clear Response :

Maximum Instruction Time : 0

Sub-Section Number : 1

Sub-Section Id : 640653118678

Question Shuffling Allowed : No

Is Section Default? : null

Question Number : 135 Question Id : 640653815076 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

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 :

6406532730869. YES

6406532730870. NO

Sub-Section Number : 2

Sub-Section Id : 640653118679
Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 136 Question Id : 640653815077 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730871.

6406532730872.

6406532730873.

6406532730874.

Question Number : 137 Question Id : 640653815078 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4
Question Label : Multiple Choice Question

Options :

6406532730875.

6406532730876.

6406532730877.

6406532730878.

Question Number : 138 Question Id : 640653815079 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730879.

6406532730880.

6406532730881.

6406532730882.

Question Number : 139 Question Id : 640653815081 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730888. 20, 10, 20, 10, 20

6406532730889. 20, 20, 10, 10, 20

6406532730890. 10, 20, 20, 10, 20

6406532730891. 10, 20, 10, 20, 20

Question Number : 140 Question Id : 640653815082 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730892. 2

6406532730893. 3
6406532730894. 4

6406532730895. 5

Question Number : 141 Question Id : 640653815083 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

You are given a computer network represented as an adjacency list. Each node in the network
represents a computer, and an edge between two nodes indicates a network connection. A virus
has infected one of the computers. The virus spreads from an infected computer to each of its
neighbors in one time step. Your task is to find the minimum number of time steps required for
the virus to infect all computers in the network.

Which of the following algorithm is best suited and efficient for solving this problem?

Options :

6406532730896. Breadth-first search.

6406532730897. Depth-first search.

6406532730898. Dijkstra's Algorithm

6406532730899. Bellman-Ford algorithm

Question Number : 142 Question Id : 640653815086 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730908. 5

6406532730909. 6

6406532730910. 7

6406532730911. 8

Question Number : 143 Question Id : 640653815088 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730913.

6406532730914.

6406532730915.

6406532730916.

Question Number : 144 Question Id : 640653815090 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Consider the elements 71, 45, 56, 98, 33, 48 and 96 inserted into empty binary search tree in the
same sequence. Which element will be inserted in the lowest level?

Options :
6406532730918. 56

6406532730919. 33

6406532730920. 96

6406532730921. 48

Question Number : 145 Question Id : 640653815091 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730922.

6406532730923.

6406532730924.

6406532730925.

Question Number : 146 Question Id : 640653815092 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730926. 4

6406532730927. 5

6406532730928. 3

6406532730929. 7

Sub-Section Number : 3

Sub-Section Id : 640653118680

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 147 Question Id : 640653815080 Question Type : MSQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4 Max. Selectable Options : 0

Question Label : Multiple Select Question

Options :

6406532730883.

6406532730884.
6406532730885.

6406532730886.

6406532730887.

Question Number : 148 Question Id : 640653815084 Question Type : MSQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4 Max. Selectable Options : 0

Question Label : Multiple Select Question

Options :

6406532730900.

6406532730901.

6406532730902.

6406532730903.
Question Number : 149 Question Id : 640653815085 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4 Max. Selectable Options : 0

Question Label : Multiple Select Question

Options :

6406532730904.

6406532730905.

6406532730906.

6406532730907.

Sub-Section Number : 4

Sub-Section Id : 640653118681

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 150 Question Id : 640653815087 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
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 :

Question Number : 151 Question Id : 640653815089 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

Correct Marks : 4

Question Label : Short Answer Question

Consider a complete binary tree T with 17 nodes. The number of leaf nodes in T is ____.

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :
9

Question Number : 152 Question Id : 640653815093 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

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 :

12

Question Number : 153 Question Id : 640653815094 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

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 :

Question Number : 154 Question Id : 640653815095 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

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 :

Question Number : 155 Question Id : 640653815099 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

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 :

Question Number : 156 Question Id : 640653815100 Question Type : SA Calculator : None

Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

Correct Marks : 4

Question Label : Short Answer Question

Let G be a simple graph with 20 vertices. The size of the minimum vertex cover of G is 8. What is
the size of the maximum independent set of graph G?

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :

12

Sub-Section Number : 5

Sub-Section Id : 640653118682
Question Shuffling Allowed : No

Is Section Default? : null

Question Id : 640653815096 Question Type : COMPREHENSION Sub Question Shuffling

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

Question Numbers : (157 to 158)

Question Label : Comprehension

Based on the above data, answer the given subquestions.

Sub questions

Question Number : 157 Question Id : 640653815097 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730933.

6406532730934.

6406532730935.

6406532730936.

Question Number : 158 Question Id : 640653815098 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730937.

6406532730938.

6406532730939.

6406532730940.
Question Id : 640653815101 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0

Question Numbers : (159 to 160)

Question Label : Comprehension

Based on the above data, answer the given subquestions.

Sub questions

Question Number : 159 Question Id : 640653815102 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

The value of the maximum flow in the given network is__

Options :

6406532730943. 21

6406532730944. 24

6406532730945. 23
6406532730946. 26

Question Number : 160 Question Id : 640653815103 Question Type : MCQ Is Question

Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0

Correct Marks : 4

Question Label : Multiple Choice Question

Options :

6406532730947. (a, b)

6406532730948. (d, b)

6406532730949. (b, t)

6406532730950. (d, t)

AppDev1
Section Id : 64065356658

Section Number : 8

Section type : Online

Mandatory or Optional : Mandatory

Number of Questions : 32

Number of Questions to be attempted : 32

Section Marks : 100

Display Number Panel : Yes