MauryaHub PYQ Practice

Deep Learning · Quiz 2 · Jan 2023

Deep Learning · Quiz 2 · Jan 2023

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 19 published solutions

Question 105 MCQ · 1.0 marks

If the subgoals in the goal description are swapped places then does the Goal Stack Planning algorithm find an optimal plan?
6406531739251.
Yes
6406531739252.
No
6406531739253.
Cannot be determined       **Deep learning** **Section Id :** 64065333975 **Section Number :** 5 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 12 **Number of Questions to be attempted :** 12 **Section Marks :** 50 **Display Number Panel :** Yes **Group All Questions :** No **Enable Mark as Answered Mark for Review and** Yes **Clear Response :** **Maximum Instruction Time :** 0

A published solution is not available for this question yet.

Report a correction for Q105

Question 107 MSQ · 5.0 marks

Source diagram or notation
6406531739256.Source diagram or notation
6406531739257.Source diagram or notation
6406531739258.Source diagram or notation
6406531739259.Source diagram or notation
6406531739260.Source diagram or notation
6406531739261.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q107

Question 108 MCQ · 3.0 marks

Source diagram or notation
6406531739262.
AdaGrad takes lesser number of iterations than vanilla Gradient Descent to converge
6406531739263.
AdaGrad takes more number of iterations than vanilla Gradient Descent to converge
6406531739264.
Both the algorithms will converge in equal number of iterations
6406531739265.
Both the algorithms will keep oscillating around the minimum

A published solution is not available for this question yet.

Report a correction for Q108

Question 109 MCQ · 3.0 marks

Source diagram or notation
6406531739279.
True, due to the presence of noise in the target
6406531739280.
True, due to the high variance of the prediction model
6406531739281.
False, due to the high variance of the prediction model
6406531739282.
False, due to zero mean of the noise added to the target

A published solution is not available for this question yet.

Report a correction for Q109

Question 110 MSQ · 2.0 marks

Which of the following statement(s) is (are) true about adaptive gradient descent algorithms?
6406531739266.
They are more suitable for sparse data
6406531739267.
They are more suitable for dense data
6406531739268.
They add additional computational complexity to the vanilla gradient descent algorithm
6406531739269.
They are guranteed to converge to global minimum

A published solution is not available for this question yet.

Report a correction for Q110

Question 111 MCQ · 2.0 marks

Consider the assertion and the corresponding reason, Assertion (A): The effective learning rate in RMSprop may increase or decrease Reason (R): This is due to exponential averaging of squared gradients
6406531739270.
A is true but R is not the correct reason
6406531739271.
A is True and R is the correct reason
6406531739272.
A is False and therefore R

A published solution is not available for this question yet.

Report a correction for Q111

Question 112 MCQ · 2.0 marks

Suppose that we modify the update equation of ADAM optimizer as follows
Source diagram or notation
6406531739273.
TRUE
6406531739274.
FALSE

A published solution is not available for this question yet.

Report a correction for Q112

Question 113 MSQ · 3.0 marks

Source diagram or notation
6406531739275.
High bias
6406531739276.
High variance
6406531739277.
Low bias
6406531739278.
Low variance

A published solution is not available for this question yet.

Report a correction for Q113

Question 114 MSQ · 3.0 marks

Suppose that we have a deep neural network with sigmoid neurons at all layers. Which of the following approaches, in general, help the network to overcome the vanishing gradient problem?
6406531739296.
Replace sigmoid neuron by tanh
6406531739297.
Replace sigmoid neuron by GELU
6406531739298.
Use unsupervised layerwise pretraining and finally train the entire network with supervised objective
6406531739299.
Use supervised training one-layer at a time with sigmoid functions and gradually add layers
6406531739300.
Use Residual connections
6406531739301.
Constrain the weight values with an appropriate regularization technique

A published solution is not available for this question yet.

Report a correction for Q114

Question 115 NAT · 2.0 marks

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.
Suppose that we pad zeros of size 1 (p = 1) around the sides of the image (in all channels). Assume stride 2 for all 10 convolution filters on the input image. All the 10 filters have bias associated with it. What is the dimension of the output volume? Enter the number of elements in the output volume.

A published solution is not available for this question yet.

Report a correction for Q115

Question 116 NAT · 2.0 marks

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.
How many number of parameters are there in the convolution layer?

A published solution is not available for this question yet.

Report a correction for Q116

Question 117 NAT · 3.0 marks

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.
Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q117

Question 118 MCQ · 3.0 marks

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.
Suppose we applied 1D convolution operation with 10 kernels on the output of the first convolution layer and then applied the rest of the operations as in the previous question (flattening followed by fully connected layer), then the number of parameters in the network would have
6406531739286.
Increased
6406531739287.
Decreased
6406531739288.
Remained same
6406531739289.
Insufficient information

A published solution is not available for this question yet.

Report a correction for Q118

Question 119 NAT · 2.0 marks

Source diagram or notationSource diagram or notation

A published solution is not available for this question yet.

Report a correction for Q119

Question 120 NAT · 2.0 marks

Source diagram or notationSource diagram or notation

A published solution is not available for this question yet.

Report a correction for Q120

Question 121 NAT · 2.0 marks

Source diagram or notationSource diagram or notation

A published solution is not available for this question yet.

Report a correction for Q121

Question 122 NAT · 4.0 marks

Source diagram or notationSource diagram or notation

A published solution is not available for this question yet.

Report a correction for Q122

Question 123 NAT · 3.0 marks

Source diagram or notation
Enter the sum of updated bias (exclude weights).

A published solution is not available for this question yet.

Report a correction for Q123

Question 124 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q124