Home / Study library / Large Language Models / End Term · May 2025 Large Language Models · End Term · May 2025 · FN
Large Language Models · End Term · May 2025 FN
← 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 / 17 published solutions
Q138 Q139 Q140 Q141 Q142 Q143 Q144 Q145 Q146 Q147 Q148 Q149 Q150 Q151 Q152 Q153 Q154
Question 138 MCQ · 2.0 marks 6406534756305. 6406534756306. 6406534756307. 6406534756308. A published solution is not available for this question yet.
Report a correction for Q138
Question 139 MCQ · 2.0 marks 6406534756309. 6406534756310. 6406534756311. 6406534756312. A published solution is not available for this question yet.
Report a correction for Q139
Question 140 MSQ · 3.0 marks Which of the following statements about subword tokenizers (e.g., Byte Pair Encoding,
SentencePiece) is **true**?
6406534756313. They always split words into individual characters.
6406534756314. They help handle rare words by breaking them into smaller units.
6406534756315. They require the vocabulary to contain every possible word in the language.
6406534756316. They can reduce the overall vocabulary size compared to word-level
tokenizers.
A published solution is not available for this question yet.
Report a correction for Q140
Question 141 MSQ · 3.0 marks A GPT-based model is fine-tuned for story generation. During evaluation, you test different
decoding strategies on the same prompt:
1. **Method A:** Every run produces the exact same story, even when executed multiple times.
2. **Method B:** The story changes slightly in each run, but overall structure and key events remain
similar.
3. **Method C:** The story is wildly different each time, sometimes even changing the genre.
Based on the observations, select the most likely decoding strategies for each method:
6406534756317. Method A: Greedy decoding
6406534756318. Method A: Top-K sampling with K = 50
6406534756319. Method B: Top-P sampling with p = 0.9
6406534756320. Method C: Top-P sampling with p = 0.5 and high temperature T = 1.5
6406534756321. Method C: Beam search with K = 5
A published solution is not available for this question yet.
Report a correction for Q141
Question 142 MSQ · 3.0 marks Which of the following are valid design choices when building a transformer-based language
model?
6406534756322. Number of transformer layers
6406534756323. Learning rate schedule
6406534756324. Font style of the source code
6406534756325. Vocabulary size
6406534756326. Type of normalization (e.g., LayerNorm)
A published solution is not available for this question yet.
Report a correction for Q142
Question 143 MSQ · 3.0 marks Which of the following statements about Top-k and Nucleus (Top-p) sampling are correct?
6406534756327. Top-k keeps only the k most probable tokens before sampling.
6406534756328. Top-p dynamically chooses the smallest set of tokens whose cumulative
probability exceeds p.
6406534756329. Top-k is always a subset of Top-p.
6406534756330. Top-p always has a fixed number of candidate tokens.
A published solution is not available for this question yet.
Report a correction for Q143
Question 144 MSQ · 3.0 marks Which of the following preprocessing steps are commonly required when preparing data for
transformer models like BERT?
6406534756331. Lowercasing text (for uncased models)
6406534756332. Splitting into subword units using BPE or WordPiece
6406534756333. Removing all punctuation marks
6406534756334. Adding position indices for each token
A published solution is not available for this question yet.
Report a correction for Q144
Question 145 NAT · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q145
Question 146 NAT · 3.0 marks For the input “you enjoy tea often”, compute the final representation of the word “tea” after the
attention layer (i.e., after applying WQ, WK, WV , attention weights, and WO). Enter the sum of the
elements in the resulting vector.
A published solution is not available for this question yet.
Report a correction for Q146
Question 147 NAT · 2.0 marks Suppose the input sentence is “tea you enjoy often”. Using the same matrices and processing
method, what is the attention score (i.e., softmax entry from A) for the query word “tea” attending
to key word “often”?
A published solution is not available for this question yet.
Report a correction for Q147
Question 148 MCQ · 2.0 marks 6406534756348. 6406534756349. 6406534756350. 6406534756351. A published solution is not available for this question yet.
Report a correction for Q148
Question 149 NAT · 1.0 marks A published solution is not available for this question yet.
Report a correction for Q149
Question 150 NAT · 2.0 marks What percentage of entries in the attention matrix are zero (i.e., the sparsity)?
A published solution is not available for this question yet.
Report a correction for Q150
Question 151 MCQ · 1.0 marks
Based on the above data, answer the given subquestions.
6406534756338. (0, 1, 2, 3, 4)
6406534756339. (-1, 0, 1, 2, 3)
6406534756340. (-2, -1, 0, 1, 2)
6406534756341. (-3, -2, -1, 0, 1)
A published solution is not available for this question yet.
Report a correction for Q151
Question 152 MCQ · 1.0 marks
Based on the above data, answer the given subquestions.
6406534756342. 6406534756343. 6406534756344. 6406534756345. A published solution is not available for this question yet.
Report a correction for Q152
Question 153 NAT · 3.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Report a correction for Q153
Question 154 NAT · 3.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Report a correction for Q154