The IIT Madras BS Computational Thinking (Computational Thinking (CT)) End Term paper sat on 31 Aug 2025, in the May 2025 term, set 6: 25 questions for 105 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 : 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)
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.
Correct answer
Correct answer
Number of students from the cities with the average total marks of the citygreater than the average total marks of the dataset.
Number of students from the cities with the average total marks of the cityless than the average total marks of the dataset.
Number of cities with the average total marks less than the average totalmarks of the dataset.
Number of cities with the average total marks more than the average totalmarks of the dataset
Correct answer
Number of students from the cities with the average total marks of the cityless than the average total marks of the dataset.
Dictionary with authors as keys mapped to the year of publication of theirlatest book
Dictionary with authors as keys mapped to the year of publication of their firstbook
Dictionary with authors as keys mapped to the year of publication of theirsecond book
Dictionary with authors as keys mapped to the year of publication of theirsecond latest book
Correct answer
Dictionary with authors as keys mapped to the year of publication of theirlatest book
Number of pairs of students with different gender or same Town/City
Number of pairs of students with same gender or different Town/City
Number of pairs of students with different gender and same Town/City
Number of pairs of students with same gender and different Town/City
Correct answer
Number of pairs of students with different gender or same Town/City
There are 5 cliques of size three present in the graph.
The nodes 0, 2, 3 and 4 form a clique of size four.
The maximum size of clique that appears in the graph is 3.
The nodes 1, 2 and 3 form a clique of size three.
Correct answers
There are 5 cliques of size three present in the graph.
The nodes 0, 2, 3 and 4 form a clique of size four.
When L = [5, 8, 6, 1, 3], the output of findSomething1(L) is 8.
When L = [5, 8, 6, 1, 3], the output of findSomething1(L) is 1.
When L = [5, 8, 6, 1, 3], the output of findSomething2(L) is 8.
When L = [5, 8, 6, 1, 3], the output of findSomething2(L) is 1.
Correct answers
When L = [5, 8, 6, 1, 3], the output of findSomething1(L) is 8.
When L = [5, 8, 6, 1, 3], the output of findSomething2(L) is 8.
The first element of both the lists, cumuList and aList, will be same.
Number of elements in cumuList will be one lesser than that of aList.
cumuList is a list of numbers in decreasing order.
Number of elements in both lists, cumuList and aList, will be different.
Correct answer
cumuList is a list of numbers in decreasing order.
N represents maximum number of bills issued to a single customer.
count represents number of customers.
At the end of the execution, the value of A will be 1.
N represents maximum number of bills issued to a single customer from thesame shop.
Correct answers
N represents maximum number of bills issued to a single customer.
count represents number of customers.
At the end of the execution, the value of A will be 1.
Correct answers
A written answer, not marked automatically.
A written answer, not marked automatically.
A written answer, not marked automatically.
A written answer, not marked automatically.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Based on the above data, answer the given subquestions.
If (i, j) is a pair of stations, which of the following statements about the dictionary A[i][j] are true?
Each key corresponds to a train that goes from station i to j without stoppingat any intermediate station.
Each key corresponds to a train that goes from station i to j. It may stop atmultiple stations between i and j.
The value corresponding to key t of the dictionary is the distance betweenstations i and j on t’s route.
The value corresponding to key t of the dictionary is the minimum distancebetween stations i and j on t’s route.
Correct answers
Each key corresponds to a train that goes from station i to j without stoppingat any intermediate station.
The value corresponding to key t of the dictionary is the distance betweenstations i and j on t’s route.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Based on the above data, answer the given subquestions.
ijMin is a procedure that accepts a pair of stations (i, j), and the matrix A as input. It returns a train which goes from i to j by covering the least distance, without stopping at any intermediate station. If there is no train connecting these two stations, the procedure returns -1. The pseudocode may have mistakes. Identify all of them (if any).
ijMin is a procedure that accepts a pair of stations (i, j), and the matrix A as input. It returns a train which goes from i to j by covering the least distance, without stopping at any intermediate station. If there is no train connecting these two stations, the procedure returns -1. The pseudocode may have mistakes. Identify all of them (if any).
Error in line 3
Error in line 5
Error in line 7
Error in line 9
Correct answers
Error in line 7
Error in line 9
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Based on the above data, answer the given subquestions.
newMatrix [2] [4] = 1
newMatrix [1] [1] = 0
newMatrix [3] [0] = 1
newMatrix [1] [3] = 0
Correct answers
newMatrix [2] [4] = 1
newMatrix [3] [0] = 1
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Based on the above data, answer the given subquestions.
3
5
6
9
Correct answer
6
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3.
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3. Let D be the value returned by getDictionary([5, 10, 20, 30, 20, 10, 20, 5, 15]). Answer the given subquestions based on D.
What is the value of D[20] ?
7
10
30
20
Correct answer
20
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3.
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3. Let D be the value returned by getDictionary([5, 10, 20, 30, 20, 10, 20, 5, 15]). Answer the given subquestions based on D.
What is the value of length(keys(D)) ?
A written answer, not marked automatically.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Consider the following condensed version of the “Trains” dataset. There are a total of n stations, with stations being indexed from 0 to n − 1. There are M rows in the table. Each row contains information about a train that connects two stations without any stops in between.
Row r, tells us that train t departs from station i and arrives at station j after covering a distance of d kilometers without stopping at any intermediate station. Therefore, each train t will occupy multiple rows in this table.
This scenario is modeled as a graph and is represented by a matrix A. Each node in the graph corresponds to a station. Assume that the value of n is already given to you. Consider the following pseudocode.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Let M be an adjacency matrix of a graph G given below, where M[i][j] = 1 if there is an edge from i to j, otherwise 0. ListV represents the list of vertices of the graph G.
Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3.
Consider the implementation of the following procedure getDictionary. Assume that the procedure absolute takes an integer as parameter and returns the absolute value. For example, absolute(-2) = 2 and absolute(3) = 3. Let D be the value returned by getDictionary([5, 10, 20, 30, 20, 10, 20, 5, 15]). Answer the given subquestions based on D.
A written answer, not marked automatically.
