Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Large Language Models
Tokenization: BPE, WordPiece & more
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- MSQ: One or more options correct. Select all to score.
- NAT: Numerical response. No negative marking.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
End Term · 31 Aug 2025 (FN)End Term
- Q1MCQ2 Marks·Choose one option

- A

- B

- C

- D

- A
- Q2MSQ3 Marks·Choose all correct options
Which of the following statements about subword tokenizers (e.g., Byte Pair Encoding, SentencePiece) is true?
- AThey always split words into individual characters.
- BThey help handle rare words by breaking them into smaller units.
- CThey require the vocabulary to contain every possible word in the language.
- DThey can reduce the overall vocabulary size compared to word-level tokenizers.
End Term · 31 Aug 2025 (AN)End Term
- Q3MCQ3 Marks·Choose one option

- A

- B

- C

- D

- A
Quiz 2 · 3 Aug 2025 (AN)Quiz 2
- Q4MCQ2 Marks·Choose one option
What is a primary motivation for using subword tokenization (like BPE or WordPiece) instead of word-level tokenization in transformers?
- AIt increases vocabulary size exponentially
- BIt completely eliminates the need for a tokenizer
- CIt helps handle out-of-vocabulary words more effectively
- DIt prevents the model from needing positional encoding
- Q5MCQ2 Marks·Choose one option
Consider the Following Assertion and Reason pair : Assertion : In Byte Pair Encoding (BPE), each merge operation adds exactly one new token to the vocabulary. Reason : BPE helps reduce the size of the initial vocabulary by merging the most frequent tokens.
- ABoth Assertion and Reason are true, and Reason is the correct explanation of Assertion.
- BBoth Assertion and Reason are true, but Reason is not the correct explanation of Assertion.
- CAssertion is true, but Reason is false.
- DAssertion is false, but Reason is true.
- Q6MCQ3 Marks·Choose one option

- A

- B

- C

- D

- A
- Q7MSQ3 Marks·Choose all correct options
What are the key challenges encountered when building a vocabulary for NLP models?
- AA larger vocabulary leads to a bigger embedding matrix and increased softmax computation
- BDifficulty in handling out-of-vocabulary (OOV) words
- CThe size of each embedding vector increases with the number of out-of- vocabulary (OOV) words
- DMore vocabulary entries always guarantee better model generalization
Read the passage below, then answer Q8–Q12

Based on the above data, answer the given subquestions.
Q8NAT2 Marks·Write the numberUsing Byte Pair Encoding (BPE), how many distinct tokens are there in the initial vocabulary before any merges are performed?
Your answer:- Q9MCQ2 Marks·Choose one option
Which token pair has the lowest frequency before any merges in Byte Pair Encoding?
- A(‘b’, ‘r’)
- B(‘t’, ‘l’)
- C(‘p’, ‘e’)
- D(‘e’, ‘r’)
- ENone of these
- Q10NAT2 Marks·Write the number
What is the frequency of the most frequent byte-pair before the first merge in Byte Pair Encoding?
Your answer: - Q11NAT2 Marks·Write the number
Your answer: - Q12MCQ2 Marks·Choose one option

- A

- B

- C

- D

- A