Question 2 MCQ · 0.0 marks
Useful Data has been mentioned above.
This data attachment is just for a reference & not for an evaluation.
A published solution is not available for this question yet.
Computational Thinking · End Term · May 2026 · AN
Computational Thinking · End Term · May 2026 AN
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 21 published solutions
Question 3 MCQ · 5.0 marks
The following pseudocode is executed using the "**Words**" dataset. Assume that each sentence in
the dataset ends with a full stop. Ignore the upper and lower case, and punctuation symbols while
comparing with other words. What will **minWord** represent at the end of the execution?
A list of words with the lowest overall frequency across all sentences.
A list containing the lowest frequency words from each sentence.
A list of words with the lowest overall frequency across all sentences not
ending with a question mark.
A list containing the last word of every sentence evaluated in the dataset.
A published solution is not available for this question yet.
Question 4 MCQ · 5.0 marks
Consider the "**Scores**" dataset. What will **targetCity** represent at the end of the execution of the
pseudocode?
The city with the maximum difference between its highest Mathematics score
and lowest Physics score.
The city with the maximum difference between its highest Physics score and
lowest Mathematics score.
The city with the maximum difference between its highest Physics score and
highest Mathematics score.
The city with the maximum difference between its lowest Physics score and
lowest Mathematics score.
A published solution is not available for this question yet.
Question 5 MCQ · 5.0 marks
The following pseudocode is executed using the “**Library**” dataset. What does **authorsCount**
represent at the end of the execution?
Number of authors who have published more than one book.
Number of authors who have published books in more than one distinct
genre.
Number of genres that have more than one author.
Total number of distinct books written by multi-genre authors.
A published solution is not available for this question yet.
Question 6 MCQ · 5.0 marks
Let **Z** be a row in the "Words" table such that **Z.Word = "statistics"**. What will the value of **Dict['t']**
be at the end of the execution?
-1
0
1
2
A published solution is not available for this question yet.
Question 7 MCQ · 5.0 marks
The following pseudocode is executed using the "**Words**" dataset. Assume that the rows in Table 1
are sorted in the increasing order of sequence number.
What does the list **L** contain at the end of execution?
The list of nouns that come immediately after an adjective
The list of adjectives that come immediately after a noun
The list of nouns that come immediately before an adjective
The list of adjectives that come immediately before a noun
A published solution is not available for this question yet.
Question 8 MCQ · 4.0 marks
The following pseudocode is executed using the "**Shopping Bills**" dataset. At the end of the
execution, the variable D captures the following information: for each customer Z, D[Z]["Shop"]
stores the shops visited by Z, and D[Z]["Category"] stores the categories of the items purchased by
Z. But the pseudocode may have mistakes. Identify all such mistakes (if any).
1 D = {}
2 while (Pile 1 has more cards) {
3 Read the top card X in Pile 1
4 D = updateDictionary(D, X)
5 Move X to Pile 2
6 }
7
8 Procedure updateDictionary(D, Y)
9 if (not isKey(D, Y.CustomerName)) {
10 D[Y.CustomerName] = {"Shop": [], "Category": []}
11 }
12 D[Y.CustomerName]["Shop"][Y.ShopName] = True
13 foreach A in Y.ItemList {
14 D[Y.CustomerName]["Category"][A.Category] = True
15 }
16 return(D)
17 End updateDictionary
Error in Line 1
Error in Line 10
Error in Line 13
Error in Line 14
Error in Line 16
No errors
A published solution is not available for this question yet.
Question 9 MCQ · 4.0 marks
Consider the procedure given below.
If L1 and L2 are two lists, and L = eliminate(L1, L2), choose the correct option regarding L.
It will contain all the elements of L2 that are not present in L1
It will contain all the elements of L1 that are not present in L2
It will contain all the elements common to L1 and L2
It will contain the elements present in L1 or L2 but not both
A published solution is not available for this question yet.
Question 10 MSQ · 5.0 marks
The following pseudocode is executed using the "**Scores**" table.
Which of the following statements are true about the dictionary **D**?
gives the total number of male students from Chennai
who scored more than 80 in both Mathematics and Physics.
If a city has no students scoring more than 80 in both subjects, the city will still
appear as a key in the dictionary with value 0.
can be at most 2.
is a dictionary mapping cities to the number of female students from
those cities who met the score condition.
A published solution is not available for this question yet.
Question 11 MSQ · 5.0 marks
The given pseudocode is executed using the "Scores" dataset. Here, Sequence Number of cards,
starts from 0. **matrix** represents an adjacency matrix.
Which of the following statements is/are TRUE?
The graph represented by
is a directed graph where
might not equal
.
The graph represented by
is an undirected graph.
implies students
and
are of different genders and
their total scores differ by at most 10.
A student
can have
.
A published solution is not available for this question yet.
Question 12 MSQ · 5.0 marks
Consider a graph generated from the "**Scores**" table that is represented by a matrix B. Each node
in the graph corresponds to a student from the table. SeqNo is used to label the nodes in the
graph and SeqNo starts from 0. Study the given pseudocode and answer the following questions.
Which of the following statements are true about this graph?
There are two cliques in this graph, one for each gender
In every clique, there is at least a pair of students having different genders
All students in a given clique have the same gender
All students in a given clique are from the same city/town
There are no cliques in this graph
A published solution is not available for this question yet.
Question 13 MSQ · 5.0 marks
The following pseudocode is executed using the “**Shopping Bills**” dataset.
Which of the following statements is/are true at the end of the execution?
contains the total cost of all bills for each customer.
maps a customer's name to the number of times they had a single bill
exceeding 500 in cost.
A customer will not be in
if each of their individual bills had a total cost of
500 or less.
contains the average cost of all bills for each customer.
A published solution is not available for this question yet.
Question 14 MSQ · 6.0 marks
**Mix** is a recursive procedure that interleaves two lists. If the lists have different lengths, the
remaining elements of the longer list are appended at the end. Select the correct code fragment(s)
to complete the pseudocode.
**Examples:**
•
returns
.
•
returns
.
•
returns
.
A published solution is not available for this question yet.
Question 15 MSQ · 6.0 marks
Consider the following pseudocode which processes a list of words.
Which of the following statements is/are TRUE at the end of the execution?
The list
contains exactly the same elements as
but in sorted order.
The list
contains exactly the distinct words found in
, preserving
their first appearance order.
will have a value of 3.
is equal to
.
A published solution is not available for this question yet.
Question 16 NAT · 6.0 marks
Consider the following pseudocode for a mathematical procedure. Assume **a** and **b** are positive
integers.
What is the return value of
?
A published solution is not available for this question yet.
Question 17 NAT · 5.0 marks
What will the value of **S** be at the end of the execution of the following pseudocode?
A published solution is not available for this question yet.
Question 18 NAT · 5.0 marks
Consider the following procedure.
What will be the return value of **mysterySum(304)**?
A published solution is not available for this question yet.
Question 19 MCQ · 5.0 marks
Let **M** be the adjacency matrix of the following directed graph **G**.
Consider the following pseudocode, where
represents the list of all vertices in **G**:
Based on the above data, answer the given subquestions.
What does the procedure **countPaths** calculate?
The maximum length of a directed path in the graph.
The number of paths of length 2 where there is no direct edge between the
starting and ending vertices.
The number of paths of length exactly 3.
The number of vertices that have no outgoing edges.
A published solution is not available for this question yet.
Question 20 NAT · 5.0 marks
Let **M** be the adjacency matrix of the following directed graph **G**.
Consider the following pseudocode, where
represents the list of all vertices in **G**:
Based on the above data, answer the given subquestions.
Based on the graph **G** and procedure **countPaths(M)** provided in the previous question, what will
be the return value of **countPaths(M)**?
A published solution is not available for this question yet.
Question 21 MCQ · 5.0 marks
Let **H** be the adjacency matrix of the following directed graph **K**.
Consider the following pseudocode, where
represents the list of all vertices in **K**:
Based on the above data, answer the given subquestions.
What does the procedure **analyzeGraph** compute?
The list of vertices from which every other vertex is reachable in at most 2
steps.
The list of vertices that can be reached by every other vertex in at most 2
steps.
The list of vertices from which every other vertex is reachable in exactly 2
steps.
The list of vertices that have an outgoing edge to every other vertex in the
graph.
A published solution is not available for this question yet.
Question 22 NAT · 4.0 marks
Let **H** be the adjacency matrix of the following directed graph **K**.
Consider the following pseudocode, where
represents the list of all vertices in **K**:
Based on the above data, answer the given subquestions.
Based on the graph **K** and procedure **analyzeGraph(H)** provided, what will the value of
be?
A published solution is not available for this question yet.