Response Time : N.A Think Time : N.

A Minimum Instruction Time : 0

Correct Marks : 3

Question Label : Short Answer Question

Find the P(X ≥ 2).Enter the answer correct to two decimal places.

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Range

Text Areas : PlainText

Possible Answers :

0.08 to 0.14

Sem1 CT
Section Id : 64065338396

Section Number : 7

Section type : Online

Mandatory or Optional : Mandatory

Number of Questions : 21

Number of Questions to be attempted : 21

Section Marks : 100

Display Number Panel : Yes

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 : 64065380887

Question Shuffling Allowed : No

Is Section Default? : null

Question Number : 177 Question Id : 640653565856 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 "FOUNDATION LEVEL : SEMESTER 1:

COMPUTATIONAL THINKING (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 :

6406531891210. YES

6406531891211. NO

Question Number : 178 Question Id : 640653565857 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

Options :

6406531891212. Useful Data has been mentioned above

6406531891213. This data attachment is just for a reference & not for an evaluation.

Sub-Section Number : 2

Sub-Section Id : 64065380888

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 179 Question Id : 640653565858 Question Type : MCQ Is Question

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

Correct Marks : 3

Question Label : Multiple Choice Question

The following pseudocode is executed using the "Scores" dataset. What will count represent at the
end of the execution?

Options :

6406531891214. Number of students who are either female or are from Chennai.

6406531891215. Number of female students from other than Chennai.

6406531891216. Number of female students from Chennai + number of male students from
other than Chennai.

6406531891217. Number of all students except female students from other than Chennai.

Question Number : 180 Question Id : 640653565859 Question Type : MCQ Is Question

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

Correct Marks : 3

Question Label : Multiple Choice Question

The following pseudocode is executed using the "Words" dataset. What will B represent at the end
of the execution?
Options :

6406531891218. Number of nouns with letter count more than 4.

6406531891219. Number of words other than nouns with letter count more than 4.

6406531891220. Number of nouns with letter count less than or equal to 4.

6406531891221. Number of words other than nouns with letter count less than or equal to 4.

Sub-Section Number : 3

Sub-Section Id : 64065380889

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 181 Question Id : 640653565860 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 following pseudocode is executed using the "Words" dataset. The variable count stores the
number of words which are either nouns or have letter count at most 5, but not both. Choose the
correct code fragment to complete the pseudocode.
Options :

6406531891222.

6406531891223.

6406531891224.
6406531891225.

Question Number : 182 Question Id : 640653565861 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 following pseudocode is executed using the "Library" dataset. At the end of the execution, N
captures the name of a book written in a language other than English with the maximum number
of pages, and A captures the number of pages in the book.

Assume that the rows of the table are shuffled in any random order, choose the correct option.
Options :

6406531891226. There might be some change in the values of both A and N, based on the
order of rows

6406531891227. There might be a change in the value of N, based on the order of rows

6406531891228. There will be NO change in the values of both A and N, based on the order of
rows

6406531891229. There might be a change in the value of A, based on the order of rows

Question Number : 183 Question Id : 640653565862 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 following pseudocode is executed using the "Scores" dataset. What will B represent at the end
of the execution?

Options :

6406531891230. Number of female students with Physics marks less than 90 and Mathematics
marks more than 90
6406531891231. Number of male students with either Physics marks less than 90 or with
Mathematics marks more than 90

6406531891232. Number of male students with Physics marks less than 90 and Mathematics
marks more than 90

6406531891233. Number of female students with either Physics marks less than 90 or with
Mathematics marks more than 90

Question Number : 184 Question Id : 640653565863 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 following pseudocode is executed using the "Olympics" dataset. What will dict represent at
the end of the execution?

Options :

6406531891234. A dictionary with player's names as keys mapped to the list of all the medals
won by the player

6406531891235. A dictionary with player's names as keys mapped to the list of distinct medal
types won by the player

6406531891236. A dictionary with medal types as keys mapped to the list of players who have
won that medal

6406531891237. A dictionary with medal types as keys mapped to the list of unique players who
have won that medal

Question Number : 185 Question Id : 640653565864 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 following pseudocode is executed using the "Scores" dataset. What will first(D[i]) - last(D[i])
represent for a given key i ?

Options :

6406531891238. The difference between highest and lowest Mathematics marks of the city i

6406531891239. The difference between overall highest and lowest Mathematics marks of the
dataset
6406531891240. The difference between highest and second highset Mathematics marks of the
city i

6406531891241. It will be always 0

Sub-Section Number : 4

Sub-Section Id : 64065380890

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 186 Question Id : 640653565865 Question Type : MCQ Is Question

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

Correct Marks : 6

Question Label : Multiple Choice Question

The following pseudocode is executed using the “Words” dataset. What will wordCount represent
at the end of the execution?
Options :

6406531891242. Number of words in which vowels occur consecutively

6406531891243. Number of words in which no two vowels occur consecutively

6406531891244. Number of words in which either vowels or consonants occur consecutively

6406531891245. Number of words in which no two vowels and no two consonants occur
consecutively

Question Number : 187 Question Id : 640653565866 Question Type : MCQ Is Question

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

Correct Marks : 6
Question Label : Multiple Choice Question

Consider the following graph with six nodes. M is the 6 × 6 adjacency matrix corresponding to the
graph below. Assume that M has already been computed.

What will the value of L be after executing the following pseudocode?

Options :

6406531891246. L = [2, 0, 1, 3, 4, 5]

6406531891247. L = [2, 0, 1, 3, 5, 4]
6406531891248. L = [2, 0, 1, 5, 4, 3]

6406531891249. L = [2, 0, 1, 5, 3, 4]

Sub-Section Number : 5

Sub-Section Id : 64065380891

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 188 Question Id : 640653565867 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 the procedure given below where A and B are two rows in the "Words" dataset. Let
procedure getSomething(A) returns a dictionary with characters of A.Word as keys mapped to
their frequency in A.Word.

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :

Sub-Section Number : 6

Sub-Section Id : 64065380892

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 189 Question Id : 640653565868 Question Type : SA Calculator : None

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

Correct Marks : 5

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 :

Sub-Section Number : 7

Sub-Section Id : 64065380893
Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 190 Question Id : 640653565869 Question Type : MSQ Is Question

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

Correct Marks : 3 Selectable Option : 0

Question Label : Multiple Select Question

Let D be a dictionary. Choose the correct statement(s) about the dictionary D. It is a Multiple Select
Question (MSQ).

Options :

6406531891252. keys(D) is an ordered list

6406531891253. keys(D) is a list of distinct elements

6406531891254. All the values of D must be of the same datatype

6406531891255. Value of a key in D can be another dictionary

Sub-Section Number : 8

Sub-Section Id : 64065380894

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 191 Question Id : 640653565870 Question Type : MSQ Is Question

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

Correct Marks : 4 Selectable Option : 0

Question Label : Multiple Select Question

Options :

6406531891256. return(reverse(rest(L)) ++ [first(L)])

6406531891257. return([last(L)] ++ reverse(rest(L)))

6406531891258. return([last(L)] ++ reverse(rest(init(L))) ++ [first(L)])

6406531891259. return([first(L)] ++ reverse(rest(init(L))) ++ [last(L)])

Sub-Section Number : 9

Sub-Section Id : 64065380895

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 192 Question Id : 640653565871 Question Type : MSQ Is Question

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

Correct Marks : 5 Selectable Option : 0

Question Label : Multiple Select Question

The procedure visitedShop(B) returns the list of names of customers who have visited shop B in
the "Shopping Bills" dataset. Additionally, each customer must be represented exactly once in the
returned list. The following pseudocode may have mistakes. Identify all such mistakes(if any).
Assume that all statements not listed in the options below are free of errors. It is a Multiple Select
Question (MSQ).
Options :

6406531891260. Line 2: Incorrect initialization of S

6406531891261. Line 6: Incorrect condition to update S

6406531891262. Line 7: Incorrect update of S

6406531891263. Line 16: Incorrect initialization of present

6406531891264. No error

Sub-Section Number : 10

Sub-Section Id : 64065380896

Question Shuffling Allowed : Yes

Is Section Default? : null

Question Number : 193 Question Id : 640653565872 Question Type : MSQ Is Question

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

Correct Marks : 6 Selectable Option : 0

Question Label : Multiple Select Question

The following pseudocode is executed using the "Shopping Bills" dataset. At the end of the
execution, L stores the list of distinct shops from which only one category of items have been
bought. But the pseudocode may have mistakes. Identify all such mistakes (if any). Assume that all
statements not listed in the options below are free of errors. It is a Multiple Select Question (MSQ).

Options :

6406531891265. Line 1: Incorrect initialization of A

6406531891266. Line 5: Incorrect conditional statement

6406531891267. Line 16: Incorrect update of L

6406531891268. Line 21: Incorrect conditional statement

6406531891269. Line 22: Incorrect updation of dictionary D

Sub-Section Number : 11

Sub-Section Id : 64065380897

Question Shuffling Allowed : No

Is Section Default? : null

Question Id : 640653565873 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 : (194 to 195)

Question Label : Comprehension

stations is a list that contains the sequence of stations visited by a train from the "Trains" dataset.
Each element in stations is a pair: [Name, Distance], the first entry is the name of the station, while
the second entry is the distance of this station from the first station in the list.

maxDist is a procedure that accepts stations as a parameter and returns the names of a pair of
consecutive stations which have the longest distance between them on this route. Complete the
following procedure.

Based on the above data, answer the given subquestions.

Sub questions
Question Number : 194 Question Id : 640653565874 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

There may be multiple pairs having the same maximum distance. If we wish to find a pair of
stations closest to the first station in the list, which of the following is the correct code fragment?

Options :

6406531891270.

6406531891271.

6406531891272.

6406531891273.

Question Number : 195 Question Id : 640653565875 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

There may be multiple pairs having the same maximum distance. If we wish to find a pair of
stations closest to the last station in the list, which of the following is the correct code fragment?

Options :

6406531891274.

6406531891275.

6406531891276.

6406531891277.

Sub-Section Number : 12

Sub-Section Id : 64065380898

Question Shuffling Allowed : No

Is Section Default? : null

Question Id : 640653565876 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 : (196 to 198)

Question Label : Comprehension

trains is a list that contains information about trains associated with a station stn. Specifically,
each element in this list is a pair: [Arrival, Departure]. If the arrival or departure time is empty, it is
represented as "None".

Based on the above data, answer the given subquestions.

Sub questions

Question Number : 196 Question Id : 640653565877 Question Type : MCQ Is Question

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

Correct Marks : 3

Question Label : Multiple Choice Question

Which of the following statements about the variable flag1 is True at the end of execution of the
given pseudocode?

Options :

6406531891278. It is True if and only if stn is a starting or ending station for at least one train in
the list
6406531891279. It is False if and only if stn is a starting or ending station for at least one train
in the list

6406531891280. It is True if and only if stn is a starting station for one train and ending station
for some other train in the list

6406531891281. It is False if and only if stn is a starting station for one train and ending station
for some other train in the list

Question Number : 197 Question Id : 640653565878 Question Type : MCQ Is Question

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

Correct Marks : 3

Question Label : Multiple Choice Question

What does the variable count represent at the end of execution of the given pseudocode?

Options :

6406531891282. It is the number of trains associated with stn

6406531891283. It is the number of trains for which stn is a starting station

6406531891284. It is the number of trains for which stn is an ending station

6406531891285. It is the number of trains for which stn is neither a starting nor an ending
station

Question Number : 198 Question Id : 640653565879 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

At the end of execution of the code given, what can be said about the values stored by the
Boolean variables flag1 and flag2?

Options :

6406531891286.
 flag1 and flag2 always store the same value

6406531891287. flag1 and flag2 always store opposite values

6406531891288. flag1 always stores the value True

6406531891289. flag2 always stores the value True

Question Id : 640653565883 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 : (199 to 201)

Question Label : Comprehension

Let M be the adjacency matrix of the graph G given below. Consider the procedure given below.
Based on above information, answer the given subquestions.

Sub questions

Question Number : 199 Question Id : 640653565884 Question Type : SA Calculator : None

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

Correct Marks : 3

Question Label : Short Answer Question

What will be the value of B at the end of the execution of the pseudocode given below?

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :

Question Number : 200 Question Id : 640653565885 Question Type : SA Calculator : None

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

Correct Marks : 3

Question Label : Short Answer Question

What will be the value of B at the end of execution of pseudocode given below?

Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :

Question Number : 201 Question Id : 640653565886 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

What will be the value of B at the end of execution of pseudocode given below?
Response Type : Numeric

Evaluation Required For SA : Yes

Show Word Count : Yes

Answers Type : Equal

Text Areas : PlainText

Possible Answers :

Sub-Section Number : 13

Sub-Section Id : 64065380899

Question Shuffling Allowed : No

Is Section Default? : null

Question Id : 640653565880 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 : (202 to 203)

Question Label : Comprehension

Consider the procedure evaluate given below, where P and Q are the lists of same length. If L1 =
[1, 2, 0, 4, 3] and L2 = [0, 2, 3, 5, 1] then answer the given subquestions.

Sub questions

Question Number : 202 Question Id : 640653565881 Question Type : MCQ Is Question

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