uiz Space

September 2025 term · Large Language Models · BSDA5004

Large Language Models End Term: 21 December 2025, Set 1-2 (September 2025 term)

The IIT Madras BS Large Language Models (LLM) End Term paper sat on 21 Dec 2025, in the September 2025 term, set 1-2: 25 questions for 50 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
25
Marks
50
Duration
180 min
MCQ
17
MSQ
4
Numerical
4

Updated

Official paper: Large Language Models 21 Dec 25 · No negative marking.

Question 1

+2 marksOne correct option
  1. A

    Only ''apple''

  2. B

    "apple'' or ''banana''

  3. C

    "apple'', ''banana'' or ''grape''

  4. D

    "apple''or ''grape''

Show answer

Correct answer

  • B

    "apple'' or ''banana''

Question 2

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
  5. E

    Both add 0 trainable parameters

Show answer

Correct answer

  • B

Question 3

+2 marksOne correct option
  1. A
  2. B
  3. C

    Insufficient information to determine

Show answer

Correct answer

  • C

    Insufficient information to determine

Question 4

+2 marksOne correct option

For a 4-category classification task, how would you use BERT's output?

  1. A

    Use all token embeddings and average them.

  2. B

    Use the [CLS] token embedding as input to a classification layer.

  3. C

    Use only the [SEP] token

  4. D

    Use the [MASK] token predictions.

Show answer

Correct answer

  • B

    Use the [CLS] token embedding as input to a classification layer.

Question 5

+2 marksOne correct option

A hospital wants to extract disease mentions and treatment plans from unstructured clinical notes. Notes use heavy abbreviations like ``pt dx w/ CAD, rx aspirin'' For extracting specific disease names from text, which task should you fine-tune BERT for?

  1. A

    Masked Language Modeling

  2. B

    Next Sentence Prediction

  3. C

    Named Entity Recognition

  4. D

    Text generation

Show answer

Correct answer

  • C

    Named Entity Recognition

Question 6

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 7

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 8

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 9

+2 marksOne correct option

If a model uses RoPE, increasing the sequence length from 100 to 1000 requires:

  1. A

    900 more positional vectors

  2. B
  3. C

    No new parameters

  4. D

    A new embedding matrix

Show answer

Correct answer

  • C

    No new parameters

Question 10

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • C

Question 11

+2 marksOne correct option
  1. A

    APE = 6, RPE = 11

  2. B

    APE = 6, RPE = 6

  3. C

    APE = 12, RPE = 11

  4. D

    APE = 5, RPE = 12

Show answer

Correct answer

  • A

    APE = 6, RPE = 11

Question 12

+2 marksOne correct option

A model with positional encoding crashes when the input length exceeds the training max length. Which encoding is it most likely using?

  1. A

    ALiBi

  2. B

    APE

  3. C

    RoPE

  4. D

    RPE

Show answer

Correct answer

  • B

    APE

Question 13

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 14

+3 marksOne or more correct options

Which of the following decoding method(s) can generate a different output every time you run the model with the same prompt?

Select all that apply.

  1. A

    Greedy decoding

  2. B

    Beam search with beam width = 1

  3. C

    Top-p sampling with temperature T = 1

  4. D
  5. E
Show answer

Correct answers

  • C

    Top-p sampling with temperature T = 1

  • D

Question 15

+2 marksOne or more correct options

Select all that apply.

  1. A

    RoPE

  2. B

    APE

  3. C

    ALiBi

  4. D

    None of these

Show answer

Correct answer

  • C

    ALiBi

Question 16

+3 marksOne or more correct options

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • B
  • C

Question 17

+2 marksNumerical answer
Show answer

Correct answer: 32

Question 18

+2 marksOne or more correct options

Which of the following statements accurately describes the properties and computational complexities of the various sparse and block attention mechanisms?

Select all that apply.

  1. A
  2. B

    Dilated Attention increases the computational complexity significantly compared to standard Strided Local Attention because it covers a wider receptive field.

  3. C

    Global, Random, and Local Window attention patterns handle long sequences well.

  4. D

    Empirical observations suggest that random permutations of blocks are significantly more important for performance than the identity permutation.

Show answer

Correct answers

  • A
  • C

    Global, Random, and Local Window attention patterns handle long sequences well.

Question 19

+2 marksNumerical answer
Show answer

Correct answer: 144

Question 20

+2 marksNumerical answer

Suppose you are working on prefix language modeling. The sequence length is 10 and the first two tokens represent the task-specific prefix. How many non-infinity elements are there in the mask for computing attention scores?

Show answer

Correct answer: 56

Question 21

+2 marksNumerical answer
Show answer

Correct answer: 262144

Question 22

+1 markOne correct option

During training, they strictly enforce teacher forcing, meaning the ground-truth previous tokens are always provided as input to predict the current token. Based on the above setup, answer the given subquestions.

Which of the following describes the fundamental training mechanism of this model?

  1. A
  2. B
  3. C
Show answer

Correct answer

  • B

Question 23

+1 markOne correct option

During training, they strictly enforce teacher forcing, meaning the ground-truth previous tokens are always provided as input to predict the current token. Based on the above setup, answer the given subquestions.

  1. A
  2. B

    It dictates that the loss is only calculated for tokens that were incorrectly predicted.

  3. C
  4. D
Show answer

Correct answer

  • C

Question 24

+1 markOne correct option

During training, they strictly enforce teacher forcing, meaning the ground-truth previous tokens are always provided as input to predict the current token. Based on the above setup, answer the given subquestions.

In the inference phase (when the model is used for generation), why is the teacher forcing technique not used, and what is the primary challenge this introduces?

  1. A

    Teacher forcing is used, but only with a small probability.

  2. B

    It's not used because the ground-truth sequence is unknown; this introduces the exposure bias problem, where the model is unfamiliar with its own prediction errors.

  3. C

    It's not used because it drastically slows down the inference speed.

  4. D

    It's not used; the challenge is the need for a separate encoder-decoder architecture.

Show answer

Correct answer

  • B

    It's not used because the ground-truth sequence is unknown; this introduces the exposure bias problem, where the model is unfamiliar with its own prediction errors.

Question 25

+1 markOne correct option

During training, they strictly enforce teacher forcing, meaning the ground-truth previous tokens are always provided as input to predict the current token. Based on the above setup, answer the given subquestions.

Which component of the Transformer decoder is essential for enforcing the Causal Language Modeling constraint?

  1. A

    The Feed-Forward Network layer.

  2. B

    The Positional Encoding layer.

  3. C

    The masked Self-Attention layer.

  4. D

    The Cross-Attention layer.

Show answer

Correct answer

  • C

    The masked Self-Attention layer.