IIT M DEGREE AN EXAM QDB3 7 July 2024

Indian Institute of Technology, Madras - BS in Data Science and Applications
Notations :
1.Options shown in green color and with icon are correct.
2.Options shown in red color and with icon are incorrect.
Question Paper Name : IIT M DEGREE AN EXAM QDB3 7 July 2024

Subject Name : 2024 July07: IIT M AN EXAM QDB3
Creation Date : 2024-07-01 17:35:13
Duration : 180
Total Marks : 640
Display Marks: Yes
Share Answer Key With Delivery Engine : Yes
Actual Answer Key : Yes
Calculator : Scientific
Magnifying Glass Required? : No
Ruler Required? : No
Eraser Required? : No
Scratch Pad Required? : No
Rough Sketch/Notepad Required? : No
Protractor Required? : No
Show Watermark on Console? : Yes
Highlighter : No
Auto Save on Console? Yes
Change Font Color : No
Change Background Color : No
Change Theme : No
Help Button : No
Show Reports : No
Show Progress Bar : No
Group I
Group Number : 1
Group Id : 64065319020
Group Maximum Duration : 0
Group Minimum Duration : 90
Show Attended Group? : No
Edit Attended Group? : No
Break time : 0
Group Marks : 640
Is this Group for Examiner? : No
Examiner permission : Cant View
Show Progress Bar? : No
Revisit allowed for group Instructions? : Yes
Maximum Instruction Time : 0
Minimum Instruction Time : 0
Group Time In : Minutes
Revisit Section : Yes
Action on Revisit Section : View and Edit
Navigate To Group Summary From Last Question? : No
Disable Submit Button During Assessment? : No
Section Selection Time? : 0
No of Optional sections to be attempted : 0
Sw Testing
Section Id : 64065359439
Section Number : 1
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 15
Number of Questions to be attempted : 15
Section Marks : 100
Display Number Panel : Yes
Section Negative Marks : 0
Group All Questions : No
Enable Mark as Answered Mark for Review and
No
Clear Response :
Section Maximum Duration : 0
Section Minimum Duration : 0
Section Time In : Minutes
Sub-Section Number : 1
Sub-Section Id : 640653124182
Question Shuffling Allowed : No
Question Number : 1 Question Id : 640653829860 Question Type : MCQ

Correct Marks : 0
Question Label : Multiple Choice Question
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : SOFTWARE TESTING (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 :
6406532787072. YES
6406532787073. NO
Question Shuffling Allowed : Yes

Correct Marks : 5
Which type of testing is typically conducted after modifying or upgrading a software component to
verify that the modified component is working correctly and other components are not damaged
by the modification?
Options :
6406532787074. Functional testing
6406532787075. Performance testing
6406532787076. Usability testing
6406532787077. Regression testing

Correct Marks : 5
Consider an organization whose purpose in testing is to show the software’s failures. However,
looking for failures is considered a negative activity, which puts testers and developers in an
adversarial relationship. Determine the organization’s process maturity level based on its test
goals.
Options :
6406532787078. Level 1
6406532787079. Level 2
6406532787080. Level 3
6406532787081. Level 4
Correct Marks : 5
Options :
6406532787082. Tree edges
6406532787083. Back edges
6406532787084. Forward edges
6406532787085. Cross edges

Correct Marks : 5
Options :
6406532787086. Parameter coupling
6406532787087. Shared data coupling
6406532787088. External device coupling
6406532787089. Message-passing interfaces

Correct Marks : 5
Options :
6406532787106. 0
6406532787107. 1
6406532787108. 2
6406532787109. 3

Correct Marks : 6
Options :
6406532787090.
6406532787091.
6406532787092.
6406532787093.

Correct Marks : 6
Options :
6406532787094. It accepts all strings that have only odd number of as.
6406532787095. It accepts all strings that have only even number of as.
6406532787096. It accepts all strings that have odd number of as and even number of bs.
6406532787097. It accepts all strings that have even number of as and odd number of bs.

Correct Marks : 6
Consider the prime path [1, 2, 4, 5] and a path P = [1, 2, 3, 2, 4, 2, 3, 4, 5]. From among the given
options, identify the path with a detour but not a sidetrip.
Options :
6406532787138. [1, 2, 4, 2, 4, 5]
6406532787139. [1, 2, 3, 2, 4, 5]
6406532787140. [1, 2, 3, 4, 5]
6406532787141. [1, 2, 4, 5]
Question Number : 10 Question Id : 640653829867 Question Type : MSQ

Correct Marks : 6 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :
6406532787098.
6406532787099.
6406532787100.
6406532787101.

Options :
6406532787102.
6406532787103.
6406532787104.
6406532787105.
Question Id : 640653829870 Question Type : COMPREHENSION Sub Question Shuffling

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Question Numbers : (12 to 14)
Question Label : Comprehension
Based on the above data, answer the given subquestions.

Sub questions

Correct Marks : 6
Determine the number of prime paths in the given CFG.
Options :
6406532787110. 7
6406532787111. 8
6406532787112. 9
6406532787113. 10

Correct Marks : 6
Determine the minimum number of test paths required for prime path coverage of the given CFG.
Options :
6406532787114. 2
6406532787115. 3
6406532787116. 4
6406532787117. 5

Correct Marks : 6
From the following code segments identify the one that is best presented by the given CFG.
Options :
6406532787118.
6406532787119.
6406532787120.
6406532787121.


Sub questions
Correct Marks : 6
What is the minimum number of test paths are required for node coverage for the given CFG?
Options :
6406532787122. 1
6406532787123. 2
6406532787124. 3
6406532787125. 4

Correct Marks : 5
What is the cyclomatic complexity for the given CFG?
Options :
6406532787126. 2
6406532787127. 3
6406532787128. 4
6406532787129. 5

Sub questions

Correct Marks : 5
How many du-pairs are there for the variable x?
Options :
6406532787130. 7
6406532787131. 8
6406532787132. 9
6406532787133. 10

Correct Marks : 6
How many unique du-paths are there for the variable x?
Options :
6406532787134. 4
6406532787135. 5
6406532787136. 6
6406532787137. 7

Options :
6406532787142. [1, 2, 4, 6]
6406532787143. [1, 2, 4, 5, 6]
6406532787144. [1, 3, 6, 1, 2, 4, 6]
6406532787145. [1, 3, 6, 1, 2, 4, 5]
AI
Section Id : 64065359440
Section Number : 2
Section Marks : 25
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : AI: SEARCH METHODS FOR
PROBLEM SOLVING (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787146. YES
6406532787147. NO

Correct Marks : 0
Options :
6406532787148. Printed graph sheets were provided to me.
6406532787149. Printed graph sheets were not provided to me.
6406532787150. I did not use graph sheets.
Correct Marks : 1
Which of the following is/are guaranteed in any state space?
Options :
6406532787151. Each move is reversible.
6406532787152. Each state is reachable from every other state.
6406532787153. The goal state is reachable from the start state.
6406532787154. None of these.

Consider the 3-2-1 Water Jug puzzle with three jugs A, B and C of capacities 3L, 2L and 1L,
respectively.
A state is uniquely represented by the amount of water present in the three jugs, for example, the
tuple (3,0,0) describes the state where jug A contains 3L of water and jugs B and C are empty.
Two basic (atomic) moves are allowed: (1.) pick up a jug and fill up (top up) another jug, and (2.)
pick up a jug and empty it into another jug, without spilling any water in the process.
Start from (3,0,0) and construct the state space graph of this puzzle.
Which of the following states occur in the state space graph?

Options :
6406532787155.
6406532787156.
6406532787157.
6406532787158.

Which of the following is true about the 3-2-1 Water Jug state space?
Options :
6406532787159. Every move is reversible.
6406532787160. Every state is reachable from every other state.
6406532787161. From (3,0,0) there is a path to (1,1,1).

The figure shows a map with several locations on a grid where each tile is 1x1 in size.
The locations are at grid points and are connected by two-way edges.
Take S as the start node and G as the goal node.

The MoveGen function returns neighbours in alphabetical order.
The RemoveSeen procedure removes neighbours already present in OPEN/CLOSED lists.
Use Manhattan distance when needed.
When we say a node is inspected/expanded/refined it means: the node is picked up from

OPEN, and goal test is called, if goal test fails then MoveGen is called and depending on the
algorithm the neighbours are selectively placed in OPEN.

Sub questions
Question Number : 25 Question Id : 640653829888 Question Type : SA
Correct Marks : 1
Question Label : Short Answer Question
List the first 4 nodes inspected by Depth First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.

NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer Format: S,X,Y,Z
Response Type : Alphanumeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Answers Case Sensitive : No
Text Areas : PlainText
Possible Answers :
S,A,E,D

Correct Marks : 1
What is the path found by Depth First Search?
Enter the path as a comma separated list of node labels.

Enter NIL if there is no path.
Answer Format: S,X,Y,G
Possible Answers :
S,A,E,D,G

Correct Marks : 1
List the first 4 nodes inspected by Breadth First Search. List the nodes in the order they were

Possible Answers :
S,A,B,C

Correct Marks : 2
What is the path found by Breadth First Search?

Possible Answers :
S,B,D,G

Correct Marks : 1
List the first 4 nodes inspected by Best First Search. List the nodes in the order they were

Possible Answers :
S,C,E,H

Correct Marks : 2
What is the path found by Best First Search?

Possible Answers :
S,C,E,D,G

Correct Marks : 1
List the first 4 nodes inspected by Hill Climbing. List the nodes in the order they were inspected. If
the algorithm terminates early then list the nodes inspected up until termination.

Possible Answers :
S,C,E,H

Correct Marks : 1
What is the path found by Hill Climbing?

Possible Answers :
NIL

A tour of 12 cities is shown below. The edges are bi-directional. Use K,L,M,...,V as the reference
(index) sequence to prepare tour representations.

Sub questions

Select the valid path representations of the tour.
Options :
6406532787170. M,U,S,K,O,V,R,T,P,L,N,Q
6406532787171. K,S,U,M,Q,N,L,P,T,R,V,O
6406532787172. M,U,S,K,O,V,R,T,P,L,N,Q,M
6406532787173. K,S,U,M,Q,N,L,P,T,R,V,O,K

Select the valid adjacency representations of the tour.
Options :
6406532787174. O,N,U,Q,V,L,M,T,K,P,S,R
6406532787175. S,P,Q,L,K,T,N,V,U,R,M,O
6406532787176. P,N,U,Q,V,L,O,T,K,M,S,R
6406532787177. S,P,T,L,Q,K,N,V,U,R,M,O

Correct Marks : 2
Convert the path representation O,T,M,L,U,P,K,N,R,V,S,Q to ordinal representation.
Options :
6406532787178.
6406532787179.
6406532787180.
6406532787181.

Correct Marks : 2
Two tours in path representation are given below. Generate offspring using Partially Mapped
Crossover (PMX), use the locations from 5 to 8 as the mapping segment. Enter one of the child
tours in the textbox.
Enter a comma separated list of cities.
DO NOT ENTER SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answers Type : Set
Possible Answers :
U,N,M,L,O,V,R,T,K,P,S,Q
M,O,S,R,U,P,K,N,V,L,T,Q


Sub questions

Correct Marks : 1
Start from city C and construct a tour using Nearest Neighbour Heuristic. Enter the path
representation of the tour starting from city C. Use the same order in which cities were added to
the tour.
Enter a comma separated list of city names.

Answer format: C,X,Y,Z
Possible Answers :
C,E,D,A,F,B

Correct Marks : 1
What is the cost of the tour generated by Nearest Neighbour Heuristic?
Enter a number.
Answer format: 17
Response Type : Numeric
Possible Answers :
222

Correct Marks : 1
Construct a tour using Greedy Heuristic. Enter the path representation of the tour starting from
city C.

Answers Type : Set
Possible Answers :
C,E,F,B,D,A
C,A,D,B,F,E

Correct Marks : 1
What is the cost of the tour generated by Greedy Heuristic?
Enter a number.
Answer format: 17
Possible Answers :
227

Correct Marks : 1
Take C as the fulcrum node and compute the two missing values in the savings list (full list) given
below. Construct the savings tour. Enter the path representation of the tour starting from city C.

Answers Type : Set
Possible Answers :
C,E,A,D,B,F
C,F,B,D,A,E
Deep Learning
Section Id : 64065359441
Section Number : 3
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : DEEP LEARNING (COMPUTER
BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787188. YES
6406532787189. NO

Correct Marks : 3

Possible Answers :
1

Correct Marks : 3
Possible Answers :
2

Correct Marks : 3
Answers Type : Range
Possible Answers :
-0.2 to 0

Correct Marks : 3
Options :
6406532787191. YES
6406532787192. NO

Correct Marks : 3
As per gradient descent, we should move towards 180 degrees with respect to gradient direction.
What will happen if we move between 90 and 180 degrees? Consider the loss function to be
convex.
Options :
6406532787202. The loss function will increase.
6406532787203. The loss function will decrease, although not to the maximum possible extent.
6406532787204. The loss function will remain the same.
6406532787205. Can’t say. It depends on other parameters of the convex function.

Correct Marks : 3
Which of the following best describes the objective of gradient descent in relation to the Taylor
series expansion of a function f(x) around a given point x0?
Options :
6406532787206. Gradient descent aims to minimize the first-order term of the Taylor series
expansion to approximate the function f(x) globally.
6406532787207. Gradient descent seeks to minimize the first-order term of the Taylor series
expansion to efficiently navigate the local neighborhood around the given point x0.
6406532787208. Gradient descent utilizes the entire Taylor series expansion to approximate
the function f(x) and find its global minimum.

Correct Marks : 2
Any boolean function of n inputs can be represented exactly by a network of perceptrons
containing at least ____________ hidden layer(s) with at least ___________ perceptrons (each) and one
output layer containing one perceptron.
Options :
6406532787198.
6406532787199.
6406532787200.
6406532787201.

Correct Marks : 5
Consider the plot shown below:
Which of the following could be the correct equation for this plot?
Options :
6406532787209.
6406532787210.
6406532787211.
6406532787212.

Consider the MP neuron model and its applicability to representing boolean functions. Select the
correct statements:
Options :
6406532787194. The MP neuron model can represent a wide range of boolean functions (not
all) by appropriately adjusting its weights and thresholds.
6406532787195. The MP neuron model can approximate arbitrary boolean functions, including
non-linear ones.
6406532787196. The MP neuron model can accurately represent the XOR function by adjusting
its weights and thresholds.
6406532787197. The representation power of the MP neuron model increases when multiple
neurons are combined in a network architecture.

Consider a feed-forward neural network shown below
Sub questions

Correct Marks : 2
What is the total number of parameters (excluding bias) in the network?
Possible Answers :
12

Correct Marks : 2
Possible Answers :
0.5 to 0.6

Correct Marks : 2

Possible Answers :
-1.8 to -1.68

Correct Marks : 4
Options :
6406532787217. 0.09
6406532787218. 0.06
6406532787219. 0.001
6406532787220. 0.0001

Correct Marks : 4
Assume you are using mini-batch gradient descent with a total dataset size of 1,000 and a batch
size of 20. If you process 10,000 mini-batches, how many epochs have been completed?
Options :
6406532787221. 5 epochs
6406532787222. 10 epochs
6406532787223. 20 epochs
6406532787224. 200 epochs

Correct Marks : 4
If the batch size in mini-batch gradient descent is increased from 32 to 128 while keeping all other
parameters constant, what is the likely impact on the variance of the gradient estimates per
update?
Options :
6406532787225. Increases the variance
6406532787226. Decreases the variance
6406532787227. No impact on the variance
6406532787228. Initially decreases then increases the variance

Correct Marks : 4
What do contour lines on a contour plot represent?
Options :
6406532787229. The areas where the function value increases most rapidly
6406532787230. Lines connecting points where the function has the same output value
6406532787231. The maximum and minimum values of a function
6406532787232. The gradient of the function at those points
Data Viz
Section Id : 64065359442
Section Number : 4
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : DATA VISUALIZATION DESIGN
(PEN AND PAPER EXAM)"
REGISTERED BY YOU)
Options :
6406532787233. YES
6406532787234. NO

Correct Marks : 16
Instructions: The exam is pen & paper based and should be answered in the sheets provided to
you.
Part A (Multiple Choice Questions): Each question has four choices, out of which only one is the
correct answer. (8×2=16 marks)
1. In a survey about favorite ice cream flavors, the column indicating the flavor chosen by each
respondent would be considered what type of data?
A. Categorical data
B. Ordinal data
C. Interval data
D. Ratio data
2. What type of data is represented by the visualization shown in the figure given below?
A. Temporal
B. Hierarchical
C. Network-based
D. Geospatial
3. Which of the following scenarios best exemplifies ordinal data?
A. Recording the temperatures of different cities in Celsius.

B. Ranking movies based on their box office earnings.
C. Measuring the heights of students in a classroom.
D. Counting the number of pages in a book.
4. What does the diagram in the visualization shown below analytical represents?
A. Correlation
B. Distribution
C. Flow
D. Ranking
5. What is the primary purpose of retaining key landmarks on transport network maps?
A. They give a unique character to the map

B. To provide historical context
C. To aid in orienting passengers
D. They help to recognize the city
6. Based on the visualization provided, what was the primary inference drawn by Dr. Snow
regarding the transmission of Cholera within the city?
A. The fatalities from Cholera are reaching a plateau.
B. The time series data is not well-suited for the intended analysis
C. There was a notable surge in fatalities in the initial week of September 1854.
D. The combined fatalities during August and September are being considered.
7. The following map shows the migration of people from various cities to Delhi. It is an example
of _________.
A. Choropleth
B. Cartogram
C. Isopleth
D. Flow maps
8. Which of the following best describes the given picture scenario?
A. Visual confirmation
B. Visual discovery
C. Idea generation
D. Idea illustration
Options :
6406532787235. I have written answers on the answer sheets
6406532787236. Not applicable

Correct Marks : 18
Part B – Multiple Select Question: For the following questions, out of which one or more than
one choice(s) is the correct answer. (6×3=18 marks)
1. Which of the following scenarios best illustrates derived data?
A. Recording the average rainfall in a region over the past decade

B. Collecting the number of cars passing through a toll booth each day
C. Measuring the length of a river using GPS coordinates
D. Combining population data with geographic data to create population density data
E. Estimating the market value of a company based on its financial reports
2. In a study analyzing the effectiveness of different heating systems in homes, researchers

collected temperature data from various rooms in houses equipped with different heating
systems. Which of the following best describes the nature of the temperature data collected in the
study?
A. The temperature data is best characterized as categorical data because it represents different
heating systems.
B. The temperature data is categorized as ordinal data because it can be ordered based on the
effectiveness of the heating systems.
C. The temperature data is represented as interval data because the differences between
temperature measurements are meaningful.
D. The temperature data is categorized as ratio data because it possesses a true zero point
indicating the absence of temperature.
3. Which of the following statements accurately describes the importance of data semantics?
A. Data semantics primarily concerns the aesthetics of data visualizations.

B. Semantically rich data simplifies the process of data cleaning.
C. Consistent data semantics ensures uniformity in visual representations.
D. Data semantics do not impact the audience's engagement with visualizations.
E. Data semantics have no impact on uncovering hidden patterns within datasets.
F. Semantically rich data facilitates clearer communication of insights.
4. Select the accurate statements regarding specific visualization types:

A. Pie charts are suitable for displaying trends over time.
B. Bubble charts are effective for illustrating the hierarchical structure of data.
C. Treemaps are suitable for illustrating the hierarchical structure of categories.
D. Heatmaps are primarily utilized to visualize changes in data over time.
E. Scatter plots are ideal for showing correlations between two variables.
5. Which of the following statements regarding geospatial visualizations is/are correct?
A. Isopleths are adept at illustrating patterns in continuous data, such as temperature gradients.
B. Isopleths are primarily designed for showcasing discrete and categorical data.
C. Choropleth maps effectively convey variations in data across geographic regions using color
gradients.
D. Isopleths and Choropleths are interchangeable terms describing the same mapping technique.
6. Which statements accurately describe the characteristics of the provided visualizations?
A. Funnel charts can be used to represent the correlation between two variables.
B. Sankey diagrams depict the flow of information or resources between categories.
C. Ridgelines are used to visualize the distribution of data in various categories.
D. Choropleths display data using different shades or colors within predefined geographic areas.
Options :

Correct Marks : 16
Part C – Short Answer Questions: Write 100-150 words answers to each question. Answer using
pen & paper using the paper provided to you. (2x8=16 marks)
1. Given below are 2 charts. The first chart is about Media rights of some of the biggest domestic
franchise sports leagues in the world and IPL’s place in it. The second chart shows the change in
voters and electors in % terms between the 2019 and 2024 parliamentary elections in India.
Identify the key insight that each of the charts is attempting to highlight and critically analyze how
much they have succeeded in communicating it.
2. Critically analyze the visualization comparing dairy milk and plant-based "milks", and suggest at
least two redesigns with improvements.
Options :
Programming in C
Section Id : 64065359443
Section Number : 5
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : PROGRAMMING IN C (COMPUTER
BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787241. YES
6406532787242. NO

Select all the correct statements from the below.
Options :
6406532787243. Registers are the memory closest to the CPU
6406532787244. Cache can be used to store data that is not frequently accessed.
6406532787245. Main memory is faster than cache memory.
6406532787246. Main memory is slower than the registers.

Select all the valid variable names in C.
Options :
6406532787264. test@3
6406532787265. test34
6406532787266. 2nd_test
6406532787267. Test_3

Correct Marks : 3

Possible Answers :
2

Correct Marks : 3
Options :
6406532787248. Case 1: M[2] = 3, Case 2: M[2] = 2
6406532787249. Case 1: M[2] = -3, Case 2: M[2] = -2
6406532787250. Case 1: M[2] = -2, Case 2: M[2] = 3
6406532787251. Case 1: M[2] = 2, Case 2: M[2] = -3

Correct Marks : 3
Find the Hexadecimal representation of the word "FAX” in ASCII.
Hint: A - 65(decimal), B - 66, … in ASCII.

Options :
6406532787256. 0x46 0x41 0x58
6406532787257. 0x45 0x41 0x57
6406532787258. 0x46 0x31 0x58
6406532787259. 0x44 0x31 0x57

Correct Marks : 3
Options :
6406532787268. -9
6406532787269. -11
6406532787270. -8
6406532787271. -10

Correct Marks : 3
Options :
6406532787285. 3
6406532787286. 4
6406532787287. 5
6406532787288. 6

Correct Marks : 3
Options :
6406532787294. 3
6406532787295. 2
6406532787296. 1
6406532787297. 0

Correct Marks : 2
Convert the hexadecimal number 0xAC73 to its equivalent binary representation.
Options :
6406532787252. 1010 1100 1111 0101
6406532787253. 1100 1100 1111 0101
6406532787254. 1010 1100 0111 0011
6406532787255. 1010 1001 0111 0011

Correct Marks : 4
Find the minimum number of bits required to represent an instruction set where there are 8
unique instructions and each instruction can take at most 2 operands.
Assume the first operand should be able to represent 64 registers and the second operand should
be able to represent -127 to 127 in signed magnitude form.
Options :
6406532787260. 15
6406532787261. 16
6406532787262. 17
6406532787263. 18

Correct Marks : 4
Options :
6406532787272. G
6406532787273. f
6406532787274. D
6406532787275. e

Correct Marks : 4
Options :
6406532787276.
6406532787277.
6406532787278.
6406532787279.

Correct Marks : 4
Options :
6406532787280. 231
6406532787281. 221
6406532787282. 120
6406532787283. 241

Correct Marks : 4
Options :
6406532787290. ac
6406532787291. c
6406532787292. bd
6406532787293. d

Correct Marks : 2
Possible Answers :
5

Correct Marks : 4
Possible Answers :
16
DL(CV)
Section Id : 64065359444
Section Number : 6
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : DEEP LEARNING FOR COMPUTER
VISION (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787298. YES
6406532787299. NO

Options :
6406532787300.
6406532787301.
6406532787302.
6406532787303.

Options :
6406532787309.
6406532787310.
6406532787311.
6406532787312.

Which of the following are true? (Select all that apply)
Options :
6406532787359.
6406532787360.
6406532787361.
6406532787362.

Correct Marks : 2
Which of the following statements is True?
Options :
6406532787304. Gaussian filter is Separable filter because it is non linear.
6406532787305. Median filter is a non separable filter
6406532787306. Gaussian filter is a High Pass filter.
6406532787307. Mean filter is a non separable filter because it is non linear

Correct Marks : 2
In Bilateral filtering, we do not reject the pixels whose values differ too much from the central
pixel value.
Options :
6406532787313. TRUE
6406532787314. FALSE

Correct Marks : 2
Which of the following is the Fourier image of the given intensity image?
Options :
6406532787315.
6406532787316.
6406532787317.
6406532787318.
Correct Marks : 2
Identify the correct sequence of steps in Scale Invariant Feature Transform (SIFT) method. Steps
listed below:
1. Keypoint Descriptor
2. Keypoint Localization
3. Scale-space Extrema Detection
4. Orientation Estimation
Options :
6406532787322. 4→ 2→ 1→ 3
6406532787323. 3→ 2→ 4→ 1
6406532787324. 3→ 1→ 2→ 4
6406532787325. None of these

Correct Marks : 2
Options :
6406532787326. 1→iii, 2 → ii , 3→ i , 4 → iv
6406532787327. 1→iv, 2→ i , 3 → ii , 4→ iii
6406532787328. 1→ii, 2 → iii , 3→ iv , 4→ i
6406532787329. None of these

Correct Marks : 2
Options :
6406532787335. 1→ iii, 2→ i, 3 → ii
6406532787336. 1→ iii, 2→ ii, 3 → i
6406532787337. 1→ ii, 2→ iii, 3 → i
6406532787338. None of these

Correct Marks : 2
In RANSAC, what is the probability that the algorithm never selects a whole set of inliers from 20
data points (which has 5 inliers in total) for k = 2 time steps? Here, n = 2 is the minimum number of
samples to fit a model.
Options :
6406532787343. 0.2
6406532787344. 0.93
6406532787345. 0.87
6406532787346. 0

Correct Marks : 2
Suppose we have a codebook of 2048 SIFT visual words. We extract 1000 SIFT descriptors (SIFT is a
128-dimensional feature) from a new image. What is the dimensionality of the BoW (Bag-of-Words)
descriptor?
Options :
6406532787347. 1000
6406532787348. 128
6406532787349. 128 × 2048
6406532787350. 2048

Correct Marks : 2
Options :
6406532787351. 1→ iii, 2→ ii, 3 → vi, 4→ i
6406532787352. 1→ v, 2→i, 3 → vi, 4→ iii
6406532787353. 1→ iii, 2→ i, 3 → ii, 4 → v
6406532787354. 1→ ii, 2→ v, 3 → iv, 4→ iii

Correct Marks : 2
Options :
6406532787355. 1→ vi, 2→ iii, 3→ v, 4 → i
6406532787356. 1→ i, 2→ iv, 3 → iii, 4→ ii
6406532787357. 1→ i, 2→ v, 3 → iii, 4→ iv
6406532787358. 1→ iv, 2→ iii, 3→ ii, 4 → i

Correct Marks : 2
Consider a Convolutional Neural Network which processes an RGB image. It has 128 kernels each
of spatial dimension 5 × 5 in the first layer. They are convolved with a stride 1. This is followed by a
max-pooling layer with stride 2 and kernel size 5 × 5. What would be the receptive field size of a
single neuron in the pooling layer? (Recap: A receptive field is the size of the region in the input
image, which influences the activation of that specific neuron.)
Options :
6406532787365. 5×5
6406532787366. 7×7
6406532787367. 9×9
6406532787368. 3×3

Correct Marks : 2

Possible Answers :
30

Correct Marks : 2
NOTE: Enter your answer in two decimal places.

Possible Answers :
-0.33
Correct Marks : 2
What is the size of the feature map after applying two successive convolution operations with
given parameters? Image size = 64 x 64, Kernel size = 6 x 6, Padding = 1 and Stride = 2. (In
calculation, take floor(x) whenever x is non-integer. If the answer is FxF, write F in the blank).
___________
Possible Answers :
14

Correct Marks : 2
Let an input to a convolutional layer in a CNN have size Df × Df × M where Df = 64 and M = 16, and
output feature map (after passing input through conv layer) has Df × Df × N size where N = 8. Let
the kernel in the conv layer be k × k where k = 3. Calculate the number of parameters for this
convolution layer. (Assume appropriate padding is applied for all convolutions so the input and
output sizes are equal. Ignore the bias term in the calculation).
Possible Answers :
1152

Sub questions

Correct Marks : 1
Fill in the blank for (a)________________
Possible Answers :
2

Correct Marks : 1
Fill in the blank for (b)_____________________
Possible Answers :
5

Sub questions

Correct Marks : 2
Fill in the blank for (a)_____________________
Possible Answers :
high

Correct Marks : 1
Fill in the blank for (b) _____________________
Possible Answers :
high

Correct Marks : 1
Fill in the blank for (c) _____________________
Possible Answers :
smooth


Sub questions

Correct Marks : 2
Fill in the blank for (a):
Answers Type : Set
Possible Answers :
thick
coarse
large scale

Correct Marks : 2
Fill in the blank for (b):
Possible Answers :
fine


Sub questions

Correct Marks : 1

Possible Answers :
1

Correct Marks : 1

Possible Answers :
0.5

Correct Marks : 1

Possible Answers :
0

Correct Marks : 1

Possible Answers :
1
Algorithmic Thinking
Section Id : 64065359445
Section Number : 7
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : ALGORITHMIC THINKING IN
BIOINFORMATICS (COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787369. YES
6406532787370. NO

Correct Marks : 3
Scientists found an alien world where life follows the same central dogma principle. Their DNA
consists of 5 different types of nucleotides (and so is their RNA) and amino acids are generated
using codons of length 4. Also, due to some chemical structure of the nucleotides, any nucleotide
can occur exactly once in a codon. Calculate the maximum number of unique amino acids that be
generated.
Enter the value as a single integer.
Possible Answers :
120

Correct Marks : 3

Possible Answers :
2

Correct Marks : 3

Possible Answers :
27
The figure below shows the genetic code describing the translation of an RNA codon into one of
the twenty different amino acids. Use the figure below to answer the given subquestions.
Source: https://www.needpix.com/photo/93401/dna-amino-acids-biology-code-genetics-
molecular-science
Sub questions

Correct Marks : 3
Find the translation of the following RNA string into an amino acid string.
Options :
6406532787372. TDTGL
6406532787373. TDTGF
6406532787374. TETGF
6406532787375. TETGL
Correct Marks : 3
If the amino acid “Leucine (L)” is generated, then what is the probability that the codon
encountered starts with “Uracil (U)”? Assume that the different positions of the codon are set to a
nucleotide independently and uniformly at random.
Round your answer to two decimal digits.
Possible Answers :
0.33

A receptor R receives information about a pathogen and transmits the information to gene G via
the following edges.
• R to Y1 with edge probability 0.02.

• Y1 to Y2 with edge probability 0.03.
• Y2 to Y3 with edge probability 0.06.
• Y3 to G with edge probability 0.01.

Sub questions

Correct Marks : 3

Possible Answers :
36

Correct Marks : 3
In a random coloring of the nodes of the underlying GRN network using 6 colors, what is the
probability that this path is colorful? (Random coloring refers to coloring each node in the graph
with one of the 6 colors uniformly and independently at random.)
Round up the answer to 2 decimal points.
Possible Answers :
0.09

Correct Marks : 4
Options :
6406532787382. Yes, predicted to bind
6406532787383. No, not predicted to bind
Correct Marks : 4
Options :
6406532787390.
6406532787391.
6406532787392.
6406532787393.

Correct Marks : 3
In signaling pathway detection using the color coding algorithm, increasing the number of colors
increases the probability of detecting the best scoring path, as well as the running time of each
coloring run.
Options :
6406532787380. TRUE
6406532787381. FALSE
The following reads are found from a genome sequence of some organism.
ATG,CAT, TAG,GAT, TTA,AAT,ATA, AGA, ATC, TGC,GCA
As a biologist, you have to assemble the sequence of the genome from these reads for your
project. Answer the given subquestions with respect to the same. Recall that the Hamiltonian path
approach is used in an overlap graph and the Eulerian path approach is used in the de Bruijn
graph for the genome assembly problem.
Sub questions

Correct Marks : 4
How many nodes are there in the corresponding de Bruijn graph?
Enter the value as a single integer.
Possible Answers :
10

Correct Marks : 3
Which among the following statements is/are true?
Options :
6406532787386. The underlying genome can be constructed using both overlap and de Bruijn
graphs.
6406532787387. The underlying genome can be constructed using overlap graph but not with
de Bruijn graph.
6406532787388. The underlying genome can be constructed using de Bruijn graph but not with
overlap graph.
6406532787389. The underlying genome cannot be constructed as certain reads are either
missing or erroneous.

Sub questions

Correct Marks : 4

Possible Answers :
-9

Correct Marks : 4
Consider the global alignment between v and w. Let the score be computed as follows:
From the given options identify the highest-scoring global alignment(s) between the two strings.
Options :
6406532787395.
6406532787396.
6406532787397.
6406532787398.

Which among the following statements is/are correct?
Options :
6406532787399. Global alignment involves aligning the entire sequences, while local alignment
involves aligning smaller parts/substrings of the sequence.
6406532787400. Alignment problem can be solved using a greedy algorithm approach.
6406532787401. To compute the global alignment between two sequences, free rides (zero
weight edges) are added from the source (0, 0) to every node and from every node to the sink (n,
m) in the alignment graph.
6406532787402. The alignment problem can be solved in linear space.
Industry 4.0
Section Id : 64065359446
Section Number : 8
Section Marks : 20
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : INDUSTRY 4.0 (COMPUTER BASED
EXAM)"
REGISTERED BY YOU)
Options :
6406532787403. YES
6406532787404. NO

Correct Marks : 1
Match Col A with Col B for landmark outcome of industrial era
Options :
6406532787405. 1.0:CNC, 2.0:Mass production, 3.0:Digitization, 4.0:Steam Engine
6406532787406. 1.0:Steam Engine, 2.0:mass production, 3.0:digitization, 4.0:CNC
6406532787407. 1.0:Mass production, 2.0:Steam Engine, 3.0:digitization, 4.0:CNC
6406532787408. 1.0:Steam Engine, 2.0:mass production, 3.0:CNC, 4.0:Digitization

Correct Marks : 1
Identify the Industry 4.0 version of transportation.
Options :
6406532787409. IC engine
6406532787410. Electric car
6406532787411. Hyperloop

Correct Marks : 1
Following is the layout from an aircraft manufacturing company. Identify the layout from the
figure below.
Options :
6406532787420. Product layout
6406532787421. Process Layout
6406532787422. Group layout
6406532787423. Fixed position layout.

Correct Marks : 1
Select the appropriate layout for Quadrants A, B, D in the following figure:
Options :
6406532787424. A: Group layout, B: Product layout , D: Process layout
6406532787425. A: Product layout, B: Process layout , D: Group layout
6406532787426. A: Process layout, B: Group layout , D: Product layout

Correct Marks : 1
The Production rate of an assembly line is determined by its
Options :
6406532787431. Slowest station
6406532787432. Fastest station
6406532787433. Idle station
6406532787434. None of these

Select the layout(s) which do not require general supervision:
Options :
6406532787412. Product layout
6406532787413. Process layout
6406532787414. Group layout
6406532787415. Fixed position layout

Which of the following is an advantage of Process Layout?
Options :
6406532787416. Low material handling
6406532787417. Total production time per unit is small
6406532787418. Low training cost for the operators
6406532787419. It can accommodate high variety of products

Which of the following is an advantage of Product Layout?
Options :
6406532787427. Small in-process inventory
6406532787428. It can accommodate high variety of products
6406532787429. High utilization of machines
6406532787430. Low investment

Select the correct statements from below:
Options :
6406532787435. Optimal solution in a facility location problem using Euclidean method will
result in a region
6406532787436. Optimal solution in a facility location problem using Euclidean method rarely
matches the center of gravity
6406532787437. Optimal solution in a facility location problem using Euclidean method will
result in a point
6406532787438. Optimal solution in a facility location problem using Euclidean method
matches the center of gravity in neither cases

Identify the examples for Offshoring from the list below:
Options :
6406532787439. Micron Technology, a US based semiconductor giant, setting up a Supply
Chain Analytics team, in India.
6406532787440. Micron signs an agreement with Taiwan based TSMC Co., to manufacture
sillicon wafer for their ICs.
6406532787441. Western Australia’s electricity network agency assigns Tata Consultancy
Services at Pune, to support it with an overhaul of its legacy IT systems, aimed at delivering
cheaper and more reliable power.
6406532787442. Tata Motors assigns the manufacturing of its braking system to TACO group.

A factory works for two 8-hour shifts each day and produces a total of 30,000 electric bulbs using a
set of workstations. There are 8 activities required to manufacture the bulb, such that the sum of
all activity times is equal to 12 seconds. Answer the given subquestions:
Sub questions

Correct Marks : 1.5
What is the cycle time (in seconds) at any workstations (round your answer to one decimal).
Possible Answers :
1.7 to 2.0

Correct Marks : 1.5
What is the theoretical minimum number of workstations required?
Possible Answers :
7

Consider the following precedence diagram. It has 12 activities. The numbers in blue and within
the braces denote the respective activity times in minutes.
Answer the given subquestions based on the above diagram.

Sub questions

Correct Marks : 1
What is the minimum cycle time of the system?(in min)
Possible Answers :
12

Correct Marks : 1
What is the maximum cycle time of the system?(in min)
Possible Answers :
85

Correct Marks : 1.5
The factory works for one 8-hour shifts each day. Is it possible to achieve an output of 32
units/day,
Options :
6406532787447. Yes
6406532787448. No

Correct Marks : 2
What is the balance delay of the following layout (round it to two decimals)(in %)
(1,2) -> (3) -> (4) -> (5) -> (6,7) -> (8,9) -> (10,11,12)
Possible Answers :
18.5 to 19.5

Correct Marks : 1.5
What is the efficiency of the given layout? Round off to two decimals without percentage sign
(1,2) -> (3) -> (4) -> (5) -> (6,7) -> (8,9) -> (10,11,12)
Possible Answers :
80 to 81
Financial Forensics
Section Id : 64065359447
Section Number : 9
Section Marks : 25
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : FINANCIAL FORENSICS
(COMPUTER BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787451. YES
6406532787452. NO

D. Carson and F. Leggatt formed a partnership on June 1 to operate a shoe store. Carson
contributed $50,000 cash and Leggatt contributed $50,000 worth of shoe inventory.
During the month of June, the following transactions took place:
a. Additional shoe inventory was purchased at a cost of $24,000 cash
b. Total cash sales for the month were $31,000. The inventory that was sold had a cost of $15,000
c. Carson withdrew $6,200 of cash drawings. Leggatt withdrew only $3,700 of cash drawings.
d. The partnership borrowed $50,000 from the Third National Bank
e. Land and buildings were purchased at a cash cost of $25,000 and $50,000 respectively.
Based on the above text answer the given sub questions:

Sub questions

Correct Marks : 1
What is the cash balance of the company as of June 1.
Possible Answers :
50000

Correct Marks : 1
What is the Total Asset of the company as of June 30.
Possible Answers :
155600
The Hosmer Company had June sales of $275,000. The cost of goods sold was $164,000 and other
cash expenses were:
Rent: $3,300
Salaries: $27,400
Taxes: $1,375
Other: $50,240
Based on the above data, answer the given subquestions

Sub questions

Correct Marks : 1
What were the company’s Revenues
Possible Answers :
275000

Correct Marks : 1
What were the company’s Expenses
Possible Answers :
246315


Sub questions

Correct Marks : 0.5
What is the cash flow from activities related to Operations?
Possible Answers :
8100

Correct Marks : 0.5
What is the cash flow from activities related to Investment?
Possible Answers :
-9500

Correct Marks : 0.5
What is the cash flow from activities related to Financing?
Possible Answers :
21000

Correct Marks : 0.5
What is the total change in cash balance of the company at the end of the year?
Possible Answers :
19600

The January 1 balance sheet of the Marvin company, an unincorporated business, is as follows:
The following transactions took place in January:
• Jan 4 – Goods were sold for INR 12,000 which had a cost of INR 7,000
• Jan 6 – To Increase inventory, Marvin placed an order with Star company for goods that would
cost INR 7,000
• Jan 8 – Marvin received the goods ordered from star and agreed to pay INR 7,000 in 30 days
• Jan 11 – Goods costing INR 1,500 was sold for INR 2,500 in cash
• Jan 16 – Goods costing INR 2,000 was sold for INR 3,400 on a 30-day credit
• Jan 26 - Marvin paid employees for the month INR 4,200 in cash
• Jan 29 - Purchased land for INR 20,000 in cash
• Jan 31 - Marvin purchased a two-year insurance policy for INR 2,800 in cash
Based on the above text answer the given sub questions:

Sub questions

Correct Marks : 1
What is the Total asset of the company as of Jan 7th
Possible Answers :
80000

Correct Marks : 1
What is the retained earnings of the company as of Jan 16th
Possible Answers :
7400
Correct Marks : 1
What is the Total Asset of the company as of Jan 31st
Possible Answers :
85200

The Pierson Company purchased a two-year fire insurance policy, paying the $30,000 premium in
October 2011. The policy was dated October 1, 2011, and expired on September 30, 2013. With
respect to this policy, what were the expenses applicable to 2011, 2012, 2013 and what was the
asset value of the insurance as of December 31, 2011, 2012 and 2013?

Sub questions

Correct Marks : 0.5
Expenses in 2011 _____.
Possible Answers :
3750

Correct Marks : 0.5
Possible Answers :
15000

Correct Marks : 0.5
Possible Answers :
11250

Correct Marks : 0.5
Asset value as of 31st December 2011 _____.
Possible Answers :
26250

Correct Marks : 0.5
Possible Answers :
11250

Correct Marks : 0.5
Possible Answers :
0

Correct Marks : 1
What is the cost of goods sold for the company given the following information:

Possible Answers :
74000

Correct Marks : 1
A company purchased machinery worth ₹ 7,50,000 on January 2nd from a vendor. The company
paid 50% of the amount in cash, and the remaining 50% was taken on credit from the vendor for
30 days. How many changes must be made to the balance sheet to account for this transaction?
Possible Answers :
3

Correct Marks : 1
Sold goods worth ₹ 86,000 for ₹ 98,000. A cash discount of 10% was offered to the customer if
payment is settled immediately. The customer took advantage of the offer and transferred the
amount immediately through internet banking. What will be the value of the sale?
Possible Answers :
88200

Correct Marks : 1
Total salaries accrued for the month is ₹ 65,000, but only 50% of it was paid at the end of the
month and the rest was outstanding. The expenses on salaries in the income statement for the
month is _____
Possible Answers :
65000

Correct Marks : 1
The Bee company shows the following account amounts:
Determine how much cash was generated from sales during 2010
Possible Answers :
8207000

Correct Marks : 1
Which of the following would not appear in the investing section of the statement of cash flows?
Options :
6406532787471. Purchase of land for a new office building
6406532787472. Interest and dividend received
6406532787473. Purchase of inventory
6406532787474. Sale of obsolete equipment used in the factory

Correct Marks : 1
At the end of the financial period, how would an excess payment of taxes beyond its obligation be
presented in the financial statements?
Options :
6406532787479. as an accrual revenue
6406532787480. as a prepaid expenses within current assets
6406532787481. as a liability due within one year
6406532787482. as an expense in the income statement


Sub questions

Correct Marks : 2
What is the amount that was received as a part of the sales that was done previously and not as a
part of this year?
Possible Answers :
690

Correct Marks : 1
What is the cash flow from Investment activities?
Possible Answers :
-345

Correct Marks : 1
What is the cash flow from Operations?
Possible Answers :
7935

Correct Marks : 1
What is the cash flow from Financing activities?
Possible Answers :
-4140

Correct Marks : 1
What is the cash balance at the end of the year?
Possible Answers :
6900
Mathematical Thinking
Section Id : 64065359448
Section Number : 10
Section Marks : 40
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : MATHEMATICAL THINKING (PEN
AND PAPER EXAM)"
REGISTERED BY YOU)
Options :
6406532787488. YES
6406532787489. NO

Correct Marks : 15
Options :

Correct Marks : 25
Options :
LSM
Section Id : 64065359449
Section Number : 11
Section Marks : 40
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : LINEAR STATISTICAL MODELS
(PEN AND PAPER EXAM)"
REGISTERED BY YOU)
Options :
6406532787494. YES
6406532787495. NO

Correct Marks : 0
Options :
6406532787496. Useful Data has been mentioned above.
6406532787497. This data attachment is just for a reference & not for an evaluation.

Correct Marks : 8
Options :

Correct Marks : 7
Options :
Correct Marks : 25
Options :
Advanced Algorithms
Section Id : 64065359450
Section Number : 12
Section Marks : 50
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : ADVANCED ALGORITHMS
REGISTERED BY YOU)
Options :
6406532787504. YES
6406532787505. NO

Based on the above data answer the given subquestions.

Sub questions

Correct Marks : 2
What is the answer if the input is 1 1 2 1?
Possible Answers :
2

Correct Marks : 2
What is the answer if the input is 1 2 3 4 5 6 7 8 9 10?
Possible Answers :
25

Correct Marks : 2
What is the answer if 2n = 50 and the input is the set of all even numbers between 1 and 100?
(Hint: you might want to use the fact that the sum of the first n odd numbers is n2.)
Possible Answers :
1250

What is the general strategy for solving this problem? Select all strategies that are correct.
Options :
6406532787509. Pick the two smallest available numbers in every step.
6406532787510. Pair the smallest and largest numbers in every step.
6406532787511. Pair the smallest number with the median element in every step.
6406532787512. Pair the largest number with the median element in every step.
6406532787513. Pick the two largest available numbers in every step.

To play optimally means to play to force a win whenever possible.

Sub questions

Correct Marks : 2
Options :
6406532787514. Alice
6406532787515. Bob
6406532787516. Draw
Correct Marks : 2
Options :
6406532787517. Alice
6406532787518. Bob
6406532787519. Draw

Correct Marks : 2
Options :
6406532787520. Alice
6406532787521. Bob
6406532787522. Draw

Correct Marks : 2
Options :
6406532787523. Alice
6406532787524. Bob
6406532787525. Draw

Correct Marks : 2
Options :
6406532787526. Alice
6406532787527. Bob
6406532787528. Draw

Correct Marks : 2
What is the general strategy for Alice?
Options :
6406532787529. Pick the largest even number available.
6406532787530. Pick the largest odd number available.
6406532787531. Pick the largest number available.
6406532787532. Pick the smallest even number available.
6406532787533. Pick the smallest odd number available.
6406532787534. Pick the smallest number available.


Sub questions

Correct Marks : 1
Options :
6406532787535. TRUE
6406532787536. FALSE

Correct Marks : 2
Options :
6406532787537. TRUE
6406532787538. FALSE

Correct Marks : 2
Options :
6406532787539. TRUE
6406532787540. FALSE

Sub questions

Correct Marks : 2
What is the answer if there are four flowers with heights 3, 1, 4, 2 and beauties 10, 20, 30, 40,
respectively?
Possible Answers :
60

Correct Marks : 2
What is the answer if there are four flowers with heights 4, 3, 2, 1 and beauties 10, 20, 30, 40,
respectively?
Possible Answers :
40
Correct Marks : 3
What is the answer if there are nine flowers with heights 4, 2, 5, 8, 3, 6, 1, 7, 9 and beauties 6, 8, 8,
4, 6, 3, 5, 7, 5, respectively?
Possible Answers :
31

Correct Marks : 2
Consider the following greedy algorithm for the problem: scan the flowers left to right. If the
current flower violates the monotonicity condition with respect to the sequence we have so far,
remove it. Otherwise, keep it. Is this algorithm correct?
Options :
6406532787544. Yes
6406532787545. No

Correct Marks : 2
Consider the following greedy algorithm for the problem:
Phase 1. scan the flowers left to right. If the current flower violates the monotonicity condition
(increasing heights) with respect to the sequence we have so far, remove it. Otherwise, keep it. At
the end, suppose the total beauty of the remaining flowers is p.
Phase 2. Starting with the original set of flowers again, scan them right to left. If the current flower
violates the monotonicity condition (decreasing heights) with respect to the sequence we have so
far, remove it. Otherwise, keep it. At the end, suppose the total beauty of the remaining flowers is
q.
Return max(p, q). Is this algorithm correct?
Options :
6406532787546. Yes
6406532787547. No

Correct Marks : 2
Consider the following greedy algorithm for the problem. Initially, all flowers are unmarked.
Repeat until a monotonically increasing sequence is obtained: keep and mark the most beautiful
unmarked flower, and remove all flowers taller than it to its left and shorter than it to its right. Is
this algorithm correct?
Options :
6406532787548. Yes
6406532787549. No

Correct Marks : 1
Options :
6406532787550.
6406532787551.
6406532787552.
6406532787553.

Correct Marks : 1
Options :
6406532787554.
6406532787555.
6406532787556.
6406532787557.
6406532787558.

Correct Marks : 3
Options :
6406532787559.
6406532787560.
6406532787561.
6406532787562.
6406532787563.

The notion of treewidth can be defined in several ways. One way to frame the definition of
treewidth is by using the following game called the cops-and-robber game. The game consists of a
set of cops trying to catch a robber. The robber lives in the graph and can move with infinite speed
along the edges of the graph. He cannot, however, move through a vertex should a cop be
guarding it. The cops move about in helicopters, the point being that they are not constrained to
move along the edges of the graph, but they have finite speed. The game proceeds as follows.
Initially, the robber occupies some vertex of the graph. The cops announce their positions (a set of
vertices) and move towards them with finite speed. Seeing their positions, the robber announces
his position (a vertex) and moves to that vertex instantaneously. Not all cops need land on vertices
at once and not all cops need change positions, that is, if a cop occupies a vertex, it may continue
occupying that vertex in the next move of the game. The cops catch the robber when one of them
lands on a vertex occupied by him.
For example, on a cycle of length more than three, the robber can always escape a single cop. We
are interested in finding the smallest number of cops we need to deploy to ensure that the robber
can be caught in a finite number of rounds of this game.

Sub questions

Correct Marks : 1
How many cops are necessary and sufficient to catch the robber on a path?
Possible Answers :
1

Correct Marks : 2
How many cops are necessary and sufficient to catch the robber on a tree?
Possible Answers :
1

Correct Marks : 2
How many cops are necessary and sufficient to catch the robber on a cycle?
Possible Answers :
2

Correct Marks : 2
How many cops are definitely enough to catch the robber on a graph of treewidth k?
Options :
6406532787567.
6406532787568.
6406532787569.
6406532787570.
RL
Section Id : 64065359451
Section Number : 13
Section Marks : 40
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : REINFORCEMENT LEARNING
REGISTERED BY YOU)
Options :
6406532787571. YES
6406532787572. NO

Correct Marks : 0
Note:
1. For numerical answer type questions, enter your answer correct upto two decimal places
without rounding up or off unless stated otherwise.
Options :
6406532787573. Instructions has been mentioned above.
6406532787574. This Instructions is just for a reference & not for an evaluation.

Sub questions

Correct Marks : 2

Possible Answers :
0.095 to 0.105

Correct Marks : 2

Possible Answers :
0.795 to 0.805
Correct Marks : 2
Options :
6406532787577. Arm A1 is the optimal arm.
6406532787580. An optimal arm can not be determined.
6406532787581. There is a tie for the optimal arm.

Correct Marks : 2
Options :
6406532787582. Arm A1 has to provide a reward of 4 or more.
6406532787583. Arm A2 has to provide a reward strictly more than 6.
6406532787584. Arm A3 has to provide a reward strictly less than 0.
6406532787585. It can not be determined.
6406532787586. None of these.

Correct Marks : 2

Possible Answers :
3.12 to 3.13

Sub questions

Correct Marks : 2

Possible Answers :
3.245 to 3.255
Correct Marks : 2

Possible Answers :
1.395 to 1.405

Correct Marks : 3

Possible Answers :
0.66 to 0.67

Correct Marks : 4

Possible Answers :
2.82 to 2.83

Correct Marks : 2
Which of the following is the correct Bellman equation for stochastic transitions, stochastic policy
and stochastic rewards? The symbols have the usual meaning.
Options :
6406532787592.
6406532787593.
6406532787594.
6406532787595.
6406532787596.
6406532787597.

Sub questions

Correct Marks : 2

Possible Answers :
-4

Correct Marks : 2

Possible Answers :
-7

Options :
6406532787600. 1 and 2.
6406532787601. 1 and 3.
6406532787602. 2 and 3.
6406532787603. 2 and 5.
6406532787604. 13 and 9
6406532787605. 4 and 8.
6406532787606. None of these

Sub questions

Correct Marks : 2

Possible Answers :
10

Correct Marks : 2

Possible Answers :
2

Correct Marks : 3

Possible Answers :
16.03 to 16.13

Correct Marks : 3

Possible Answers :
12.23 to 12.25
Game Theory
Section Id : 64065359452
Section Number : 14
Section Marks : 25
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : GAME THEORY (COMPUTER
BASED EXAM)"
REGISTERED BY YOU)
Options :
6406532787611. YES
6406532787612. NO

An item is up for auction. Player 1 values the item at 3 while player 2 values the item at 5. Each
player can bid either 0, 1 or 2. If player i bids more than player j then i wins the good and pays his
bid, while the loser does not pay. If both players bid the same amount, then a coin is tossed to
determine who the winner is, who gets the good and pays his bid while the loser pays nothing.
Formulate the game in matrix form and answer the given subquestions.
Sub questions

Correct Marks : 2
Which player does not have strictly dominated strategy?
Options :
6406532787613. Player 1
6406532787614. Player 2
6406532787615. None

Correct Marks : 3
Which strategies survive Iterated Elimination of Strictly Dominated Strategy?
Options :
6406532787616. (0, 0)
6406532787617. (1, 1)
6406532787618. (2, 2)
6406532787619. None

(Hawk-Dove) The following game has been widely used in evolutionary biology to understand how
“fighting” and “display” strategies by animals could coexist in a population. For a typical Hawk-
Dove game there are resources to be gained (i.e. food, mates, territories, etc.) denoted as v. Each
of two players can chooses to be aggressive, called “Hawk” (H), or can be compromising, called
“Dove” (D). If both players choose H then they split the resources, but loose some payoff from
injuries, denoted as k. Assume that k > v/2. If both choose D then they split the resources, but
engage in some display of power that a display cost d, with d < v/2. Finally, if player i chooses H
while j chooses D, then i gets all the resources while j leaves with no benefits and no costs.
Describe the game as a game matrix and answer the following question.
The outcomes cannot be supported as pure strategy Nash equilibrium, given v = 10, k = 6, and d =
4, is (are)
Options :
6406532787620. (H, H)
6406532787621. (H, D)
6406532787622. (D, H)
6406532787623. (D, D)

Determined to crack down on the drug trade, a city mayor puts more officers out on patrol to
disrupt the business of drug dealers. A drug dealer in a neighborhood can work his trade either on
a street corner or in the park. Each day, he decides where to set up shop, knowing that word
about his location will travel among users. Because a good snitch is lacking, word does not travel
to the police. The police officer on the beat then needs to decide whether she will patrol the park
or the street corner, while not knowing where the drug dealer is hanging out that day.
The decision of the officer and the dealer determine the extent of drug trades that day. Let
suppose the total number of potential trades in the market is 100. A dealer's payoff is determined
by the number of trades he consummates, while the officer’s payoff is based on the number of
trades she disrupts. The table below illustrates the payoffs for both parties according to their
respective strategies in the game.

Sub questions
Correct Marks : 1
Choose the correct statement
Options :
6406532787624. There is a unique Nash equilibrium in pure strategy
6406532787625. There are finitely many Nash equilibria in this game in pure strategy
6406532787626. There is no Nash equilibrium in this game in pure strategy
6406532787627. None of these

Correct Marks : 1
Choose the correct statement
Options :
6406532787628. There is a unique Nash equilibrium in this game
6406532787629. There are finitely many Nash equilibria in this game
6406532787630. There is no Nash equilibrium in this game
6406532787631. None of these

Correct Marks : 2
What are the randomization probabilities of a police officer for patrolling the streets and patrolling
the park respectively under equilibrium?
Options :
6406532787632. 6/13, 7/13
6406532787633. 7/13, 6/13
6406532787634. 5/13, 8/13
6406532787635. 8/13, 5/13

Correct Marks : 2
The randomization probabilities of the drug dealer choosing between street and park respectively
under equilibrium are
Options :
6406532787636. 7/13, 6/13
6406532787637. 6/13, 7/13
6406532787638. 4/13, 9/13
6406532787639. 9/13, 4/13

Consider a two-player game in which player 1 can choose A or B. The game ends if he chooses A
while it continues to player 2 if he chooses B. Player 2 can either choose C or D, with the game
ending after C and continuing again with player 1 after D. Player 1 then can choose E or F, and
then the game ends after each of these choices.
Imagine that the payoffs following choice A by player 1 are (2, 0), following C by player 2 are (3, 1),
following E by player 1 are (0, 0) and following F by player 1 are (1, 2)
Model this as an extensive form game and answer the given subquestions:
Sub questions

Correct Marks : 1
This is a game of
Options :
6406532787640. Perfect information
6406532787641. Imperfect information
6406532787642. None
6406532787643. Can’t be determined

Correct Marks : 1
How many terminal nodes does this game have?
Options :
6406532787644. 3
6406532787645. 2
6406532787646. 4
6406532787647. 5

Correct Marks : 1
How many information sets does this game have?
Options :
6406532787648. 2
6406532787649. 3
6406532787650. 4
6406532787651. 1

Correct Marks : 1
How many pure strategies does player 1 have?
Options :
6406532787652. 1
6406532787653. 2
6406532787654. 3
6406532787655. 4

Correct Marks : 1
How many pure strategies does player 2 have?
Options :
6406532787656. 1
6406532787657. 2
6406532787658. 3
6406532787659. 4

Correct Marks : 1
How many pure strategy Nash equilibria does this game have?
Options :
6406532787660. 1
6406532787661. 2
6406532787662. 3
6406532787663. 4

Correct Marks : 2
Which one of the Nash equilibria is also a subgame perfect equilibrium?
Options :
6406532787664. (AE, D)
6406532787665. (AF, D)
6406532787666. (BE, C)
6406532787667. (BF, C)

Correct Marks : 1
No. of sub games this game has
Options :
6406532787668. 1
6406532787669. 2
6406532787670. 3
6406532787671. 4

Correct Marks : 2
A firm (player 1) is considering entering an established industry with one incumbent firm (player
2). Player 1 must choose whether to enter or to not enter the industry. If player 1 enters the
industry, then player 2 can either accommodate the entry, or fight the entry with a price war.
Player 1’s most preferred outcome is entering with player 2 not fighting, and his least preferred
outcome is entering with player 2 fighting. Player 2’s most preferred outcome is player 1 not
entering, and his least preferred outcome is player 1 entering with player 2 fighting.
Model this as an extensive form game tree (choose ordinal payoffs that represent the preferences)
and answer the following questions.
Strategies of Player 1:
E: Entering the Industry, N: Not entering the Industry
Strategies of Player 2:
A: Accommodate, F: Fight.
What is the subgame perfect equilibrium in this game?

Options :
6406532787672. (N, F)
6406532787673. (E, A)
6406532787674. Both (N, F) and (E, A)
6406532787675. None
Managerial Economics
Section Id : 64065359453
Section Number : 15
Section Marks : 25
No
Clear Response :

Correct Marks : 0
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : MANAGERIAL ECONOMICS
REGISTERED BY YOU)
Options :
6406532787676. YES
6406532787677. NO

Correct Marks : 1
Options :
6406532787678. Both MPL and MPK are constant
6406532787679. MPL is increasing but MPK is constant
6406532787680. MPL is decreasing and MPK is constant
6406532787681. Both MPL and MPK are decreasing

Correct Marks : 1
A firm can always trade three units of labour for one unit of capital and still keep output constant.
The production technology for this firm can most suitably represented by
Options :
6406532787682. Cobb-Douglas production function
6406532787683. Leontief production function
6406532787684. Linear production function
6406532787685. None

Correct Marks : 1
A firm finds that it requires exactly two full-time workers to operate each piece of machinery in the
factory. The production technology for this firm can most suitably represented by
Options :
6406532787686. Cobb-Douglas production function
6406532787687. Leontief production function
6406532787688. Linear production function
6406532787689. None

Correct Marks : 1
The marginal product of labour is defined as
Options :
6406532787690. a firm’s total output divided by total labour input
6406532787691. the extra output produced by employing one more unit of labour while
allowing other inputs to vary
6406532787692. the extra output produced by employing one more unit of labour while
holding other inputs constant
6406532787693. the extra output produced by employing one more unit of capital while
holding labour input constant

Correct Marks : 1
If marginal costs equal average total costs
Options :
6406532787694. average total costs are falling
6406532787695. average total costs are maximized
6406532787696. average total costs are rising
6406532787697. average total costs are minimized

Correct Marks : 2
Options :
6406532787698. 5, 20
6406532787699. 20, 5
6406532787700. 20, 10
6406532787701. 10, 20

The short-run cost function of a company is given by the equation TC = 200 + 55q, where TC is the
total cost and q is the total quantity of output.

Sub questions

Correct Marks : 1
What is the company’s fixed cost?__________
Possible Answers :
200

Correct Marks : 1
If the company produced 100 units of goods, what would be its average variable cost? ___________
Possible Answers :
55


Sub questions

Correct Marks : 2
What is the opportunity cost of filling this order (i.e., selling these cartons to the fraternity)?
_____________ (in $)
Possible Answers :
25

Correct Marks : 1
Should you sell the Fritos to the fraternity?
Options :
6406532787727. YES
6406532787728. NO

Sub questions

Correct Marks : 1
The slope of the budget line is
Options :
6406532787706.
6406532787707.
6406532787708.
6406532787709.

Correct Marks : 1
Intercepts on the axis are
Options :
6406532787710. 50 on X-axis and 100 on Y-axis

Correct Marks : 1
If keeping income unchanged, price of the coconut is halved, what will be the new slope of the
budget line
Options :
6406532787714.
6406532787715.
6406532787716.
6406532787717.

Correct Marks : 1
New intercepts on the axis are
Options :

Correct Marks : 1
If income is halved keeping the original prices unchanged
Options :
6406532787722. Slope remains same and both intercepts are doubled
6406532787723. Slope remains same and both intercepts are halved
6406532787724. Slope changes and both intercepts are doubled
6406532787725. Slope changes and both intercepts remain same


Sub questions

Correct Marks : 2
If the firm is currently using 3 hours of labour for each hour of machine time, is it minimizing its
costs of production?
Options :
6406532787702. YES
6406532787703. NO

Correct Marks : 2
If not, what will be the optimal combination of labour and capital. L* = _________
Possible Answers :
0

Correct Marks : 2
If not, what will be the optimal combination of labour and capital. K* = _________
Possible Answers :
4

Correct Marks : 2
The marginal product of labour in the production of chips is 50 kg chips per hour. The marginal
rate of technical substitution of hours of labour for hours of machine capital is 1/4.
What is the marginal product of capital in kg per hour? (only write the no.) __________
Possible Answers :
200

IIT M DEGREE AN EXAM QDB3 7 July 2024

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IIT M DEGREE AN EXAM QDB3 7 July 2024

Uploaded by

Copyright:

Available Formats

Indian Institute of Technology, Madras - BS in Data Science and Applications

Question Paper Name : IIT M DEGREE AN EXAM QDB3 7 July 2024

Question Number : 1 Question Id : 640653829860 Question Type : MCQ

Question Number : 2 Question Id : 640653829861 Question Type : MCQ

Question Number : 3 Question Id : 640653829862 Question Type : MCQ

Question Number : 5 Question Id : 640653829864 Question Type : MCQ

Question Number : 6 Question Id : 640653829869 Question Type : MCQ

Question Number : 7 Question Id : 640653829865 Question Type : MCQ

Question Number : 8 Question Id : 640653829866 Question Type : MCQ

Question Number : 9 Question Id : 640653829880 Question Type : MCQ

Question Number : 10 Question Id : 640653829867 Question Type : MSQ

Question Number : 11 Question Id : 640653829868 Question Type : MSQ

Question Id : 640653829870 Question Type : COMPREHENSION Sub Question Shuffling

Based on the above data, answer the given subquestions.

Question Number : 12 Question Id : 640653829871 Question Type : MCQ

Question Number : 13 Question Id : 640653829872 Question Type : MCQ

Question Number : 14 Question Id : 640653829873 Question Type : MCQ

Question Id : 640653829874 Question Type : COMPREHENSION Sub Question Shuffling

Based on the above data, answer the given subquestions.

Question Number : 16 Question Id : 640653829876 Question Type : MCQ

Question Id : 640653829877 Question Type : COMPREHENSION Sub Question Shuffling

Question Number : 17 Question Id : 640653829878 Question Type : MCQ

Question Number : 18 Question Id : 640653829879 Question Type : MCQ

Question Number : 19 Question Id : 640653829881 Question Type : MSQ

Question Number : 20 Question Id : 640653829882 Question Type : MCQ

Question Number : 21 Question Id : 640653829883 Question Type : MCQ

Question Number : 23 Question Id : 640653829885 Question Type : MSQ

Which of the following states occur in the state space graph?

Question Number : 24 Question Id : 640653829886 Question Type : MSQ

Question Id : 640653829887 Question Type : COMPREHENSION Sub Question Shuffling

Take S as the start node and G as the goal node.

Use Manhattan distance when needed.

When we say a node is inspected/expanded/refined it means: the node is picked up from

Based on the above data, answer the given subquestions.

Enter a comma separated list of node labels.

Question Number : 26 Question Id : 640653829889 Question Type : SA

Enter the path as a comma separated list of node labels.

Question Number : 27 Question Id : 640653829890 Question Type : SA

Enter a comma separated list of node labels.

Question Number : 28 Question Id : 640653829891 Question Type : SA

Enter the path as a comma separated list of node labels.

Question Number : 29 Question Id : 640653829892 Question Type : SA

Enter a comma separated list of node labels.

Question Number : 30 Question Id : 640653829893 Question Type : SA

Enter the path as a comma separated list of node labels.

Question Number : 31 Question Id : 640653829894 Question Type : SA

Enter a comma separated list of node labels.

Question Number : 32 Question Id : 640653829895 Question Type : SA

Enter the path as a comma separated list of node labels.

Question Id : 640653829896 Question Type : COMPREHENSION Sub Question Shuffling

Based on the above data, answer the given subquestions.

Question Number : 33 Question Id : 640653829897 Question Type : MSQ

Question Number : 34 Question Id : 640653829898 Question Type : MSQ

Question Number : 35 Question Id : 640653829899 Question Type : MCQ

Question Number : 36 Question Id : 640653829900 Question Type : SA

Question Id : 640653829901 Question Type : COMPREHENSION Sub Question Shuffling

Based on the above data, answer the given subquestions.

Question Number : 37 Question Id : 640653829902 Question Type : SA

Enter a comma separated list of city names.

Question Number : 38 Question Id : 640653829903 Question Type : SA

Question Number : 39 Question Id : 640653829904 Question Type : SA

Enter a comma separated list of city names.

Question Number : 40 Question Id : 640653829905 Question Type : SA

Question Number : 41 Question Id : 640653829906 Question Type : SA