Deep Learning · TEE · section

All recovered TEE papers: unit, topic and marks map

TEE preparation and examination plan

How to use this question map

Start with the newest final and re-exam, then use older papers to practise variations. The table links each original lettered part to its complete worked answer. Repeated questions are history, not a prediction. A syllabus topic stays required even when no recovered paper asks it.

Marks: 100 marks are attempted: compulsory Q1 (20), then any four other 20-mark questions. Most recovered papers offer140 marks; NLP December2023 offers120 because the complete original ends at Q6. A mixed question retains one mark allocation; its units are not counted as separate questions. Blank individual allocations remain unknown.

2026-02-10 · re-exam · R26

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [5]Unit 1 · ML versus DL task choicescaseRead question + answer
Q1b [5]Unit 2 · Activation functionstheoryRead question + answer
Q1c [5]Unit 3 · L1/L2 and specified-rate dropoutmixedRead question + answer
Q1d [5]Unit 5 · RNN sentiment classificationcaseRead question + answer
Q2a [10]Unit 2 · Two-output sigmoid backpropagationnumericalRead question + answer · Loss omitted in original; answer states assumed half summed squared loss.
Q2b [10]Unit 4 · AlexNet, Inception and architecture recommendationcaseRead question + answer
Q3a [10]Unit 2 · Bipolar perceptron epochnumericalRead question + answer
Q3b [10]Unit 4 · Five effects of CNN filter counttheoryRead question + answer
Q4a [10]Unit 3 · Batch/SGD, learning rate and cubic-objective updatesmixedRead question + answer
Q4b [10]Unit 5 · LSTM and GRU; legacy bidirectional-RNN subparttheoryRead question + answer · Current-syllabus extract; original part also contains Bidirectional-RNN advantages (iv)
Q5a [10]Unit 5 · RNN hidden-state matrix calculationnumericalRead question + answer
Q5b [10]Unit 3 · RMSProp mechanism and SGD comparisontheoryRead question + answer
Q6a [10]Unit 4 · CNN sizes and counts with binary-output ambiguitynumericalRead question + answer · Binary head unspecified: one sigmoid or two softmax units give different parameter totals; both are stated.
Q6b [10]Unit 2 · Sigmoid value/derivative and softmaxnumericalRead question + answer
Q7a [10]Unit 2 · Feedforward roles and sigmoid forward passmixedRead question + answer
Q7b [10]Unit 4 · Transfer learning and its applicationcaseRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 1: 1 parts, 5 known marks; Unit 2: 5 parts, 45 known marks; Unit 3: 3 parts, 25 known marks; Unit 5: 3 parts, 25 known marks; Unit 4: 4 parts, 40 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

Current-syllabus qualification: Q4b: mixed current and legacy tasks; the retained-only marks cannot be determined from the printed allocation. The original whole-part marks remain visible so the paper is faithfully represented.

2025-12-03 · final · F25

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [5]Unit 1 · ML versus DL and three task choicescaseRead question + answer
Q1b [5]Unit 2 · Loss choice and categorical cross-entropymixedRead question + answer
Q1c [5]Unit 3 · L1 sparsity, overfitting and dropoutcaseRead question + answer
Q1d [5]Unit 5 · RNN context and variable-length translationcaseRead question + answer
Q2a [10]Unit 2 · Sigmoid network: forward pass and backpropagationnumericalRead question + answer · Original omits inputs and loss. Answer explicitly assumes x=[1,1] and half squared loss; the result is conditional on those assumptions.
Q2b [10]Unit 4 · ResNet; Inception versus AlexNettheoryRead question + answer
Q3a [10]Unit 2 · Biological neuron and perceptron epochmixedRead question + answer
Q3b [10]Unit 4 · Transfer learning for face attendancecaseRead question + answer
Q4a [10]Unit 3 · Batch counts, momentum iterations and hyperparametersmixedRead question + answer
Q4b [10]Unit 5 · Vanishing gradients and LSTM forget contributionmixedRead question + answer
Q5a [10]Unit 5 · LSTM gates, cell state and hidden statemixedRead question + answer
Q5b [10]Unit 3 · AdaGrad mechanism and comparison with SGDtheoryRead question + answer
Q6a [10]Unit 4 · CNN sizes and parameters; stride-2 convolutionnumericalRead question + answer
Q6b [10]Unit 2 · Activation functions and their rolestheoryRead question + answer
Q7a [10]Unit 2 · Feedforward network roles and ReLU forward passmixedRead question + answer · Receiving-neuron rows give 0.55; the supplied key uses a transposed convention (0.61). Both interpretations are explained.
Q7b [10]Unit 4 · CNN feature hierarchy and applicationstheoryRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 1: 1 parts, 5 known marks; Unit 2: 5 parts, 45 known marks; Unit 3: 3 parts, 25 known marks; Unit 5: 3 parts, 25 known marks; Unit 4: 4 parts, 40 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

2025-02-22 · re-exam · R25

140 marks offered; 100 attempted. Combined-year archive filename contains one six-page exam, not two independent papers.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [5]Unit 1, 4, 5 · ML versus DL and architecture choicecaseRead question + answer
Q1b [5]Unit 3 · Training and validation errorscaseRead question + answer
Q1c [5]Unit 4 · CNN hierarchy and stride-two convolutionmixedRead question + answer · Padding is not specified; valid/no-padding is declared. CNN cross-correlation convention is used without kernel reversal.
Q1d [5]Unit 5 · BPTT and recurrent strengthstheoryRead question + answer
Q2a [10]Unit 2 · Activation, ReLU and numeric outputsmixedRead question + answer
Q2b [10]Unit 5 · Vanishing/exploding gradients and GRUtheoryRead question + answer
Q3a [10]Unit 2, 3 · 4–3–2 forward pass and dropoutnumericalRead question + answer · Activation/loss/dropout scaling missing from original; result is conditional on explicit standard classroom assumptions.
Q3b [10]Unit 4 · Four CNN design explanationstheoryRead question + answer
Q4a [10]Unit 4 · 64×64 CNN shape and parameter tablenumericalRead question + answer
Q4b [10]Unit 2 · Bipolar AND perceptronnumericalRead question + answer · Initialization, order and threshold convention explicitly supplied as assumptions; multiple equivalent separating weights exist.
Q5a [10]Unit 4 · ResNet shortcut and Inception1×1theoryRead question + answer
Q5b [10]Unit 5 · ReLU RNN state with declared orientationnumericalRead question + answer · Square matrices and printed horizontal vectors leave orientation ambiguous; both possible readings are explained, main answer follows row-vector form.
Q6a [10]Unit 2 · 3–2–1 forward pass and update w7,w8numericalRead question + answer · Original does not specify loss scaling; half-SSE is declared and alternatives distinguished.
Q6b [10]Unit 3 · AdaGrad stagnation versus RMSPropcaseRead question + answer
Q7a [10]Unit 5 · Long-text sentiment architecturecaseRead question + answer
Q7b [5]Unit 4 · Transfer learningtheoryRead question + answer
Q7c [5]Unit 2, 3 · Learning rate and two lossestheoryRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 1, 4, 5: 1 parts, 5 known marks; Unit 3: 2 parts, 15 known marks; Unit 4: 5 parts, 40 known marks; Unit 5: 4 parts, 35 known marks; Unit 2: 3 parts, 30 known marks; Unit 2, 3: 2 parts, 15 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

2024-02-13 · re-exam · R24

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [5]Unit 1 · Drivers of deep learning adoptiontheoryRead question + answer
Q1b [5]Unit 2 · 10-5-5-5-4 dense network parameter countnumericalRead question + answer
Q1c [5]Unit 3 · Overfitting diagnosis and remediescaseRead question + answer
Q1d [5]Unit 4 · Max and average poolingnumericalRead question + answer
Q2a [10]Unit 2 · Four-hidden-neuron sigmoid MSE and updatenumericalRead question + answer
Q2b [10]Unit 3 · Momentum/Nesterov; high momentum; excluded convex ratestheoryRead question + answer · Current-syllabus extract; original part also contains Asymptotic convergence-rate comparison on convex problems (part of i)
Q3a [10]Unit 2 · Activation comparisons and softmaxmixedRead question + answer
Q3b [10]Unit 3 · Regularization importance and techniquestheoryRead question + answer
Q4a [10]Unit 2 · Perceptron training for two epochsnumericalRead question + answer
Q4b [10]Unit 4 · CNN sizes, weights and biasesnumericalRead question + answer
Q5a [10]Unit 4 · Replacing architecture to improve gradient flowcaseRead question + answer
Q5b [10]Unit 1, 5 · X-ray DL justification; RNN pros and conscaseRead question + answer
Q6a [10]Unit 5 · GRU update and reset gatestheoryRead question + answer
Q6b [10]Unit 4 · Pretrained vegetable classifiercaseRead question + answer
Q7a [10]Unit 5 · LSTM architecturetheoryRead question + answer
Q7b [10]Unit 5 · RNN input/output sequence architecturestheoryRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 1: 1 parts, 5 known marks; Unit 2: 4 parts, 35 known marks; Unit 3: 3 parts, 25 known marks; Unit 4: 4 parts, 35 known marks; Unit 1, 5: 1 parts, 10 known marks; Unit 5: 3 parts, 30 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

Current-syllabus qualification: Q2b: mixed current and legacy tasks; the retained-only marks cannot be determined from the printed allocation. The original whole-part marks remain visible so the paper is faithfully represented.

2023-12-02 · final · F23

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [5]Unit 1 · Deep learning features and limitationstheoryRead question + answer
Q1b [5]Unit 2, 3 · ANN hyperparameters and significancetheoryRead question + answer
Q1c [5]Unit 5 · Unrolled RNN and BPTTtheoryRead question + answer
Q1d [5]Unit 4 · Convolution mapnumericalRead question + answer
Q2a [10]Unit 2 · Binary-input step-activation networknumericalRead question + answer
Q2b [10]Unit 2, 1 · Activation necessity; ML/DL facial-recognition choicemixedRead question + answer
Q3a [10]Unit 2 · Sigmoid output-weight backpropagationnumericalRead question + answer
Q3b [10]Unit 3 · Adam advantages versus SGDtheoryRead question + answer
Q4a [10]Unit 4 · AlexNet-style layer dimensions and parametersnumericalRead question + answer
Q4b [10]Unit 5 · LSTM autocomplete architecture and token probabilitiescaseRead question + answer
Q5a [10]Unit 4 · Inception branches and 1x1 convolutiontheoryRead question + answer
Q5b [10]Unit 2 · Linear separability; XOR and XNOR constructionmixedRead question + answer
Q6a [10]Unit 5 · LSTM gates; source mixes reset/update terminologytheoryRead question + answer · Printed LSTM diagram uses update-gate wording and asks reset equations. Answer separates LSTM and GRU rather than inventing an LSTM reset gate.
Q6b [10]Unit 4 · ResNet gradient flow and block outputstheoryRead question + answer
Q7a [10]Unit 5 · Paragraph sentiment modelcaseRead question + answer
Q7b [10]Unit 3 · Bias-variance tradeoff and intervention tabletheoryRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 1: 1 parts, 5 known marks; Unit 2, 3: 1 parts, 5 known marks; Unit 5: 4 parts, 35 known marks; Unit 4: 4 parts, 35 known marks; Unit 2: 3 parts, 30 known marks; Unit 2, 1: 1 parts, 10 known marks; Unit 3: 2 parts, 20 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

2023-01-28 · re-exam · R23

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [4]Unit 5 · Music-generation RNN architecturecaseRead question + answer
Q1b [4]Unit 4 · Stride-2 average pooling and purposenumericalRead question + answer
Q1c [4]Unit 1 · DL advantages and limitationstheoryRead question + answer
Q1d [4]Unit 3 · Mini-batch size and parallelismtheoryRead question + answer
Q1e [4]Unit 2 · AND perceptron designnumericalRead question + answer
Q2a [10]Unit 2, 3, 4 · CNN parameters, hyperparameters and AdamtheoryRead question + answer
Q2b [10]Unit 2, 3 · ReLU, rating regression and overfittingcaseRead question + answer
Q3a [10]Unit 5 · RNN language model and per-token probabilitiescaseRead question + answer
Q3b [10]Unit 2 · ReLU/sigmoid forward pass and four output-weight updatesnumericalRead question + answer
Q4a [10]Unit 4 · Small-data face-attendance transfer learningcaseRead question + answer
Q4b [10]Unit 4 · AlexNet parameter countnumericalRead question + answer
Q5a [10]Unit 5 · Vanishing-gradient RNN remediescaseRead question + answer
Q5b [10]Unit 2 · Fraud classifier design and parameter countmixedRead question + answer
Q6a [10]Unit 3 · Three optimization-failure scenarioscaseRead question + answer
Q6b [10]Unit 4 · Convolution cost and unspecified bottleneck widthnumericalRead question + answer · The 1x1 reduction width is not specified. Answer gives a symbolic count and an explicitly assumed numerical example.
Q7a [10]Unit 5 · LSTM sentence memory and gatescaseRead question + answer
Q7b [10]Unit 3 · Overfitting diagnosis and remediescaseRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 5: 4 parts, 34 known marks; Unit 4: 4 parts, 34 known marks; Unit 1: 1 parts, 4 known marks; Unit 3: 3 parts, 24 known marks; Unit 2: 3 parts, 24 known marks; Unit 2, 3, 4: 1 parts, 10 known marks; Unit 2, 3: 1 parts, 10 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

2022-11-19 · final · F22

140 marks offered; 100 attempted.

Question [marks]Current unit and topicQuestion formAnswer / scope
Q1a [4]Unit 4 · Stride-2 convolution and detected featurenumericalRead question + answer
Q1b [4]Unit 2 · Signed gradient-descent updatenumericalRead question + answer
Q1c [4]Unit 1 · ML and DL comparisontheoryRead question + answer
Q1d [4]Unit 2 · Sigmoid versus tanhtheoryRead question + answer
Q1e [4]Unit 5 · Image-captioning RNN architecturecaseRead question + answer
Q2a [10]Unit 5 · GRU advantages and subject memory in a sentencecaseRead question + answer
Q2b [10]Unit 2 · Two-sample sigmoid forward pass and mean-MSE backpropnumericalRead question + answer
Q3a [10]Unit 2, 3 · Bias/variance, four-class activation/loss and diagnosiscaseRead question + answer
Q3b [10]Unit 4 · LeNet-style parameter countnumericalRead question + answer
Q4a [10]Unit 4 · Inception bottleneck computation countnumericalRead question + answer
Q4b [10]Unit 2, 3 · 6-5-5-4 network; AdaGrad parameters and hyperparameterstheoryRead question + answer
Q5a [10]Unit 5 · RNN model and BPTT updatestheoryRead question + answer
Q5b [10]Unit 3 · Optimization challenges and momentumtheoryRead question + answer
Q6a [10]Unit 4 · CNN vanishing-gradient remediescaseRead question + answer
Q6b [10]Unit 2, 3 · Clothing classifier design and six diagnostic taskscaseRead question + answer
Q7a [10]Unit 5 · LSTM long-sequence language modelcaseRead question + answer
Q7b [10]Unit 2 · Perceptron non-linear separability and solutiontheoryRead question + answer

Original offered marks by mapped topic, grouped without double counting: Unit 4: 4 parts, 34 known marks; Unit 2: 4 parts, 28 known marks; Unit 1: 1 parts, 4 known marks; Unit 5: 4 parts, 34 known marks; Unit 2, 3: 3 parts, 30 known marks; Unit 3: 1 parts, 10 known marks. Joint-unit buckets remain joint; no invented split is assigned. These original-paper totals include any legacy tasks explicitly marked above; they are not a current-syllabus marks blueprint.

Priority without skipping the syllabus

The latest papers show the form and depth of questions, while the official current syllabus sets the learning scope. Authored drills, explanatory numbers and optional extensions are not counted as past questions. Source assumptions and ambiguous data are stated in their answers.