Data Science and Artificial Intelligence
GATE DA format:nat PYQs
Build your understanding with focused practice from past exam papers.
How to practice format:nat
Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.
Questions 1–10 of 46. Imported answers require independent review unless marked reviewed.
Question 29
Open questionDANAT1 markNeeds review
Consider that for a supervised learning task, the objective function being minimized is
, where
is the input and
is the parameter. Stochastic Gradient Descent with learning rate of 0.10 is used for parameter updates. Suppose that at the end of iteration
, the value of
becomes 10.00. Let
be the input for iteration
. The value of
at the end of iteration
is __________ . (Rounded off to two decimal places)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 30
Open questionDANAT1 markNeeds review
Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies. There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value. Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game. At the root, the best strategy for MAX is __________ . (Answer in integer)

Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 31
Open questionDANAT1 markNeeds review
Let
be a sorted array containing 1000 distinct integers. You perform a recursive binary search on
to find an element
. Suppose each comparison checks whether the middle element computed during the current recursive step is equal to, less than, or greater than
. The maximum number of comparisons that may have to be performed if
is not an element of
is ________ . (Answer in integer)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 32
Open questionDANAT1 markNeeds review
In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records. Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes. The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is ________ . (Answer in integer)
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 33
Open questionDANAT1 markNeeds review
The number of bijections
from the set
to itself such that
, for all
, is ________ . (Answer in integer)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 34
Open questionDANAT1 markNeeds review
Let
be an exponentially distributed random variable with mean
. If
, then the conditional probability
is ________ . (Rounded off to two decimal places)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 35
Open questionDANAT1 markNeeds review
The value of
is ____________ . (Answer in integer)Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 55
Open questionDANAT2 marksNeeds review
Consider that Linear Ridge Regression is being used to learn a prediction function
, where
and Mean Absolute Error (MAE) is used to measure the prediction error. A weight of 0.20 is associated with the regularizer.At an intermediate step of the training process, assume that the parameter
. In the next step, for the input
, the predicted value of
is noted. Let the relation between
and the true value of
be
.The value of the overall regularized loss function for this instance is _____. (Rounded off to two decimal places)
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 56
Open questionDANAT2 marksNeeds review
Consider a fully-connected feed-forward multi-layer perceptron. It has 30 neurons in the input layer, followed by two hidden layers and an output layer. The first hidden layer has 4 neurons and the second hidden layer has 3 neurons. The output layer has only one neuron. Assume that no bias parameters are used.
The number of learnable parameters in the multi-layer perceptron is __________ . (Answer in integer)
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 57
Open questionDANAT2 marksNeeds review
A clinic specializes in testing for a disease D. The result of the test can be either positive or negative.
A study revealed that if a person suffers from the disease D, the test result in that clinic comes out positive 80% of the time, and negative 20% of the time. If a person is not suffering from the disease D, the test comes out positive 10% of the time and negative 90% of the time. It is also known that among the general population, the disease D occurs in 30% of the individuals.
If a person tests positive for D in that clinic, the probability that he/she actually suffers from the disease D is ________ . (Rounded off to two decimal places)
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer