
Deep Learning for Computer Vision Quiz 2: 3 August 2025 (May 2025 term)
The IIT Madras BS Deep Learning for Computer Vision (Deep Learning for Computer Vision) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term: 52 questions for 62 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
- 52
- 62
- 120 min
- 13
- 36
- 2
- 1
Show answer
Correct answer
Question 2
Which of the following architectures introduced the ROI pooling layer for extracting fixed-size feature maps from variable-size region proposals?
R-CNN
Fast R-CNN
Faster R-CNN
YOLO
Show answer
Correct answer
Fast R-CNN
Question 3
Which object detection method first integrated a Region Proposal Network (RPN) to generate region proposals within the detection model?
R-CNN
Fast R-CNN
Faster R-CNN
YOLO
Show answer
Correct answer
Faster R-CNN
Question 4
Which architecture performs object detection as a single regression problem from image pixels to bounding boxes and class probabilities?
R-CNN
Fast R-CNN
Faster R-CNN
YOLO
Show answer
Correct answer
YOLO
Question 5
Show answer
Correct answer
Question 6
Consider the following statements P and Q regarding AlexNet and choose the correct option: (P) In AlexNet, a trainable Local Response Normalization Layers were introduced to emulate the competitive nature of real neurons, where highly active neurons suppress the activity of neighboring neurons, creating competition among different kernel outputs.
(Q) In AlexNet, a total of 8 Convolutional layers contain only about 6-7% of the total parameters hence account for the least computation.
Only statement P is true
Only statement Q is true
Both statements are true
None of these statements is true
Show answer
Correct answer
None of these statements is true
Question 7
Consider two bounding boxes in an image:
- Box A: top-left at (0, 0), bottom-right at (12, 12) - Box B: top-left at (4, 4), bottom-right at (16, 16) What is the Intersection over Union (IoU) between these two boxes ____________(in %)
Show answer
Correct answer: 28
Question 8
Which one of the following statements is True?
Attention mechanisms can be applied to the bidirectional RNN model
An image captioning network cannot be trained end-to-end even though we are using 2 different modalities to train the network
One of the key components in the vanilla transformer are the recurrent connections that help them to deal with variable input length.
All of these.
Show answer
Correct answer
Attention mechanisms can be applied to the bidirectional RNN model
Question 9
Show answer
Correct answer
Question 10
Match the following:
| 1) One-to-many RNN architecture | i) Sentiment analysis of Netflix reviews |
|---|---|
| 2) Many-to-one RNN architecture | ii) Convert English sentence to Hindi |
| 3) Many-to-many RNN architecture with equal number of inputs and outputs | iii) Named entity recognition |
| 4) Many-to-many RNN architecture with unequal number of inputs and outputs (Encoder and Decoder model) | iv) Music generation |
Show answer
Correct answer
Question 11
Show answer
Correct answer
Question 12
Which of the following techniques help mitigate the vanishing gradient problem in recurrent neural networks?
1. Gradient clipping
2. Use of ReLU activation to preserve gradient flow
3. Use of LSTM units
4. Data augmentation (e.g., reversing input sequence)
1 and 2 only
2 and 3 only
3 and 4 only
1, 2, and 3 only
Show answer
Correct answer
2 and 3 only
Question 13
Which of the following techniques help mitigate the exploding gradient problem in recurrent neural networks?
1. Gradient clipping
2. Use of Sigmoid activation to prevent gradient growth
3. Use of LSTM units
4. Data augmentation (e.g., reversing input sequence)
1 and 2 only
1 and 3 only
1, 2, and 3
All of these
Show answer
Correct answer
1 and 3 only
Question 14
Which one of the following statements is false? (Pick the most appropriate one.)
Attention mechanisms cannot be applied to the bidirectional RNN model
An image captioning network cannot be trained end-to-end even though we are using 2 different modalities to train the network
One of the key components in the vanilla transformer is the recurrent connection that help them to deal with variable input length.
All of these
Show answer
Correct answer
All of these
Question 15
Which of the following is true regarding Hard Attention and Soft Attention?
Soft Attention is smooth and differentiable
Variance reduction techniques are used to train Soft Attention models
Soft Attention is computationally cheaper than Hard Attention when the source input is large
The inference (test time) overhead is low in Hard Attention when compared to Soft Attention models
Show answer
Correct answers
Soft Attention is smooth and differentiable
Soft Attention is computationally cheaper than Hard Attention when the source input is large
The inference (test time) overhead is low in Hard Attention when compared to Soft Attention models
Question 16
Which of the following are true:
Show answer
Correct answers
Question 17
Consider a Faster R-CNN object detection framework, which is being trained with a mini-batch size of 2. The RPN produces 512 proposals, out of which 256 and 128 of them are foreground proposals, corresponding to each image in the mini-batch. For a single mini-batch update, the bounding box regression loss will be computed_____________ times.
Show answer
Correct answer: 384
Question 18
Suppose you want to build an encoder-decoder recurrent model with attention. The context vector at time step t is given by:
where αtj refers to the alignment score between the decoder state at time t _____________and the encoder state at time _____________. Note: Please write your answer using variables
Based on the above data, answer the given subquestions.
Decoder state at time t : _______________
Show answer
Correct answer: -1
Question 19
Suppose you want to build an encoder-decoder recurrent model with attention. The context vector at time step t is given by:
where αtj refers to the alignment score between the decoder state at time t _____________and the encoder state at time _____________. Note: Please write your answer using variables
Based on the above data, answer the given subquestions.
Encoder state at time: _______________
Show answer
Correct answer: j
Question 20
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
Hidden state ht−1______________
Show answer
Correct answer: 4
Question 21
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
Hidden state ht_____________
Show answer
Correct answer: 6
Question 22
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
Current Input xt________________
Show answer
Correct answer: 3
Question 23
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
Update gate zt_______________
Show answer
Correct answer: 1
Question 24
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
Reset gate rt ______________
Show answer
Correct answer: 2
Question 25
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure that corresponds to it:
Based on the above data, answer the given subquestions.
New hidden state content eh____________
Show answer
Correct answer: 5
Question 26
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation). Calculate the number of parameters and computational cost for this convolution layer. Based on the above data, answer the given subquestions.
Number of Parameters:_____________
Show answer
Correct answer: 6422528
Question 27
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation). Calculate the number of parameters and computational cost for this convolution layer. Based on the above data, answer the given subquestions.
Computational Cost:___________________
Show answer
Correct answer: 642252800
Question 28
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation), calculate the number of parameters and computational cost, but make use of Depthwise Seperable convolution and pointwise convolution instead of standard convolution. Based on the above data, answer the given subquestions.
Number of parameters for depthwise seperable convolution:_______________
Show answer
Correct answer: 12544
Question 29
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation), calculate the number of parameters and computational cost, but make use of Depthwise Seperable convolution and pointwise convolution instead of standard convolution. Based on the above data, answer the given subquestions.
Computational Cost for depthwise seperable convolution:____________________
Show answer
Correct answer: 1254400
Question 30
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation), calculate the number of parameters and computational cost, but make use of Depthwise Seperable convolution and pointwise convolution instead of standard convolution. Based on the above data, answer the given subquestions.
Number of parameters for pointwise convolution:___________________
Show answer
Correct answer: 131072
Question 31
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation), calculate the number of parameters and computational cost, but make use of Depthwise Seperable convolution and pointwise convolution instead of standard convolution. Based on the above data, answer the given subquestions.
Computational cost for pointwise convolution:__________________
Show answer
Correct answer: 13107200
Question 32
Based on the above data, answer the given subquestions.
Number of weights in Weight Matrix U1 is:______________
Show answer
Correct answer: 50
Question 33
Based on the above data, answer the given subquestions.
Number of weights in Weight Matrix V1 is:______________
Show answer
Correct answer: 25
Question 34
Based on the above data, answer the given subquestions.
Number of weights in Weight Matrix U2 is:__________________
Show answer
Correct answer: 100
Question 35
Based on the above data, answer the given subquestions.
Number of weights in Weight Matrix V2 is:___________________
Show answer
Correct answer: 400
Question 36
Based on the above data, answer the given subquestions.
Number of weights in Weight Matrix W is:_______________
Show answer
Correct answer: 800
Question 37
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
e21: _________________
Show answer
Correct answer: 1
Question 38
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
e22: _________________
Show answer
Correct answer: 0
Question 39
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
e23: _________________
Show answer
Correct answer: 2
Question 40
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
α21: _________________
Show answer
Correct answer: 0.245 (accepted within ±0.005)
Question 41
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
α22: _________________
Show answer
Correct answer: 0.095 (accepted within ±0.005)
Question 42
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
α23: _________________
Show answer
Correct answer: 0.67 (accepted within ±0.01)
Question 43
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
c21: _________________
Show answer
Correct answer: 1.55 (accepted within ±0.05)
Question 44
You are given the encoder hidden states and the decoder hidden state at time step .
Use **dot-product attention**, where the attention score is computed as:
The context vector is then computed as:
Use the following values:
Note: Use approximate values of exponential , , etc.
Answer the given subquestions:
c22: _________________
Show answer
Correct answer: 2.55 (accepted within ±0.05)
Question 45
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
e21:_________________
Show answer
Correct answer: 0 (accepted within ±0.01)
Question 46
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
e22:_________________
Show answer
Correct answer: -0.462
Question 47
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
e23:_________________
Show answer
Correct answer: 0.462
Question 48
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
α21:_________________
Show answer
Correct answer: 0.33 (accepted within ±0.01)
Question 49
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
α22:_________________
Show answer
Correct answer: 0.23 (accepted within ±0.01)
Question 50
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
α23:_________________
Show answer
Correct answer: 0.44 (accepted within ±0.01)
Question 51
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
c21:_________________
Show answer
Correct answer: 1.5 (accepted within ±0.1)
Question 52
You are given the encoder hidden states and the decoder hidden state at time step .
Use **additive attention**, where the alignment score is computed as:
The context vector is then computed as:
Use the following values:
Hint: Approximate values of : , , , , , ,
Answer the given subquestions:
c22:_________________
Show answer
Correct answer: 2.5 (accepted within ±0.1)