The IIT Madras BS Computational Thinking (Computational Thinking (CT)) End Term paper sat on 11 Dec 2022, in the September 2022 term, set 1: 43 questions for 111 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
THIS IS QUESTION PAPER FOR THE SUBJECT "FOUNDATION LEVEL: SEMESTER 1: COMPUTATIONAL THINKING" ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT? CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECT TO BE WRITTEN. (IF IT IS NOT THE CORRECT SUBJECT ,PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS REGISTERED BY YOU)
YES
NO
Correct answer
YES
Useful Data has been mentioned above.
This data attachment is just for a reference & not for an evaluation.
Correct answer
Useful Data has been mentioned above.
Number of pairs of students with the same gender
Number of pairs of students with the same TownCity
Number of pairs of students with the same gender and the same TownCity
Number of pairs of students with the same TownCity but different genders
Correct answer
Number of pairs of students with the same TownCity but different genders
X and Y is said to be a fair pair if X has more marks than Y in Physics and Y hasmore marks than X in Mathematics
X and Y is said to be a fair pair if X has more marks than Y in Mathematics andY has more marks than X in Physics
X and Y is said to be a fair pair if X has more marks than Y in at least onesubject and Y has more marks than X in at least one subject
X and Y is said to be a fair pair if X has more marks than Y in Physics andMathematics or Y has more marks than X in Physics and Mathematics
Correct answer
X and Y is said to be a fair pair if X has more marks than Y in Physics andMathematics or Y has more marks than X in Physics and Mathematics
Correct answer
Number of maximum frequency words with letter count less than averageletter count
Number of maximum frequency words with letter count greater than averageletter count
Number of minimum frequency words with letter count less than averageletter count
Number of minimum frequency words with letter count greater than averageletter count
Correct answer
Number of maximum frequency words with letter count greater than averageletter count
L = [4, 0, 2, 1, 3, 5]
L = [4, 1, 0, 2, 3, 5]
L = [4, 3, 2, 0, 1, 5]
L = [4, 1, 2, 3, 0, 5]
Correct answer
L = [4, 1, 0, 2, 3, 5]
Let D be a dictionary whose keys are strings and values are integers. For each key A in D, D[A] is the letter count of A. Choose the correct statement(s) about dictionary D. It is a Multiple Select Question (MSQ).
Correct answers
Let D be a dictionary. Choose the correct statement(s) about the dictionary D. It is a Multiple Select Question (MSQ).
For each key X in D, D[X] is a distinct value
keys(D) has no duplicate elements
All the keys of D must be of the same datatype
We can obtain the key from the value of the key stored in D
The values of D can be of different datatypes
Correct answers
keys(D) has no duplicate elements
The values of D can be of different datatypes
Based on the above data, answer the given subquestions.
length(LB) == length(LA)
TRUE
FALSE
Correct answer
TRUE
Based on the above data, answer the given subquestions.
At the end of the execution, LC == [1 ]
TRUE
FALSE
Correct answer
FALSE
Based on the above data, answer the given subquestions.
Each element of LB is a list of different length
TRUE
FALSE
Correct answer
TRUE
Based on the above data, answer the given subquestions.
last(LB) == LA
TRUE
FALSE
Correct answer
FALSE
Based on the above data, answer the given subquestions.
Only one of element of LB is an empty list
TRUE
FALSE
Correct answer
FALSE
Based on the above data, answer the given subquestions.
What will the value of X represent at the end of the execution?
The highest number among all the elements of listL
The smallest number among all the elements of listL
The highest number among intA and all the elements of listL
The smallest number among intA and all the elements of listL
Correct answer
The smallest number among intA and all the elements of listL
Based on the above data, answer the given subquestions.
How many times will the procedure calculate be called, excluding the initial call in line 1?
length(listL)
length(listL) - 1
length(listL) + 1
Depends on the elements in listL
Depends on the value of A
Correct answer
length(listL)
Based on the above data, answer the given subquestions.
What will outList represent at the end of the execution?
List of lists(pairs) of first and second word of each sentence
List of lists(pairs) of second and first word of each sentence
List of lists (pairs) of last and first word of each sentence
List of lists (pairs) of first and last word of each sentence
Correct answer
List of lists (pairs) of first and last word of each sentence
Based on the above data, answer the given subquestions.
The values of length(outList) and A will be same at the end of the execution.
TRUE
FALSE
Correct answer
TRUE
Based on the above data, answer the given subquestions.
There may be multiple pairs having the same maximum distance. If we wish to find the pair that is closest to the first station in the list, which of the following is the correct code fragment?
Correct answer
Based on the above data, answer the given subquestions.
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?
Correct answer
Based on the above data, answer the given subquestions.
Which of the following statements about the variable flag1 is True at the end of the execution of the given pseudocode?
It is True if and only if stn is a starting or ending station for at least one train inthe list
It is False if and only if stn is a starting or ending station for at least one trainin the list
It is True if and only if stn is a stating station for one train and ending stationfor some other train in the list
It is False if and only if stn is a starting station for one train and ending stationfor some other train in the list
Correct answer
It is True if and only if stn is a starting or ending station for at least one train inthe list
Based on the above data, answer the given subquestions.
What will the variable count represent at the end of the execution of the given pseudocode?
It is number of trains associated with stn
It is the number of trains for which stn is a starting station
It is the number of trains for which stn is an ending station
It is the number of trains for which stn is neither a starting nor an endingstation
Correct answer
It is the number of trains for which stn is neither a starting nor an endingstation
Based on the above data, answer the given subquestions.
At the end of the execution of the code given, what can be said about the values stored by the Boolean variables flag1 and flag2?
flag1 and flag2 always store the same value
flag1 and flag2 always store opposite values
flag1 always stores the value True
flag2 always stores the value True
There is no relationship between these two variables
Correct answer
flag1 and flag2 always store the same value
Study the pseudocode given above and answer the given subquestions.
either they are from different city/town or have the same gender
either they are from the same city/town or have the same gender
they are from the same city/town and have the same gender
they are from different city/town and have the same gender
Correct answer
they are from different city/town and have the same gender
Study the pseudocode given above and answer the given subquestions.
Which of the following statements are true about this graph? It is a Multiple Select Question (MSQ).
There are only two cliques in this graph
In every clique, each pair of students has the same gender
The graph is undirected
All students in a given clique are from different cities/towns
Correct answers
In every clique, each pair of students has the same gender
The graph is undirected
All students in a given clique are from different cities/towns
Based on the above data, answer the given subquestions.
What will the value of S be at the end of the execution when L= [3, 2, 1, 4, 1, 2, 3] ?
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
What will the value of S be at the end of the execution when L = [4, 3, 2, 1, -1, -2, -3, -4] ?
A written answer, not marked automatically.
A chess tournament is conducted for n players. Each player plays with every other player d times. The result of each match is either a win or loss. The results are stored in a list chess. Each match where player i beats j is recorded as a list (pair) [i, j] in chess. Based on the above data, answer the given subquestions.
The following pseudocode generates graph G (Matrix M) from chess. Each node corresponds to a player. There is an edge from i to j if Player i has beaten Player j at least once. Each edge is associated with a label t that denotes the number of times Player i has beaten Player j in the tournament. Choose the correct code fragment to complete the following pseudocode.
The following pseudocode generates graph G (Matrix M) from chess. Each node corresponds to a player. There is an edge from i to j if Player i has beaten Player j at least once. Each edge is associated with a label t that denotes the number of times Player i has beaten Player j in the tournament. Choose the correct code fragment to complete the following pseudocode.
Correct answer
A chess tournament is conducted for n players. Each player plays with every other player d times. The result of each match is either a win or loss. The results are stored in a list chess. Each match where player i beats j is recorded as a list (pair) [i, j] in chess. Based on the above data, answer the given subquestions.
Choose the correct statement(s) about graph G. It is a Multiple Select Question.
G is a directed graph
For each vertex i in G, in-degree and out-degree are the same
For each pair of vertices i and j in G, M[i][j] >= d
G is always acyclic
Correct answer
G is a directed graph
A chess tournament is conducted for n players. Each player plays with every other player d times. The result of each match is either a win or loss. The results are stored in a list chess. Each match where player i beats j is recorded as a list (pair) [i, j] in chess. Based on the above data, answer the given subquestions.
When i is not beaten by any other player
When i is beaten by every other player
When i has beaten every other player and not been beaten by any player
When i has not beaten any player
Correct answer
When i has not beaten any player
Based on the above data, answer the given subquestions.
If matrixPh[i][j] = 1, then
i scored at most 10 and at least 20 more marks in Physics than j
i scored at least 10 and at most 20 more marks in Physics than j
j scored at least 10 and at most 20 more marks in Physics than i
j scored at most 10 and at least 20 more marks in Physics than i
Correct answer
j scored at least 10 and at most 20 more marks in Physics than i
Based on the above data, answer the given subquestions.
Choose the correct statement based on given pseudocode.
Correct answer
Based on the above data, answer the given subquestions.
Consider the dictionary D, and the matrices matrixPh, matrixCh and matrixMa computed in the previous question. The following pseudocode generate the adjacency matrix matrixHelp.
Consider the dictionary D, and the matrices matrixPh, matrixCh and matrixMa computed in the previous question. The following pseudocode generate the adjacency matrix matrixHelp. Let i and j be indices of two students. Choose the correct statement(s) from the given options. It is a Multiple Select Question (MSQ)
Correct answers
Based on the above data, answer the given subquestions.
At the end of the following pseudocode, A captures the number of distinct pairs of students who can help each other in at least one subject, and B captures the number of distinct pairs of students where one can help the other in all subjects. Choose the correct code fragment to complete the pseudocode.
At the end of the following pseudocode, A captures the number of distinct pairs of students who can help each other in at least one subject, and B captures the number of distinct pairs of students where one can help the other in all subjects. Choose the correct code fragment to complete the pseudocode.
Correct answer
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Study the pseudocode given above and answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
A chess tournament is conducted for n players. Each player plays with every other player d times. The result of each match is either a win or loss. The results are stored in a list chess. Each match where player i beats j is recorded as a list (pair) [i, j] in chess. Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
