Checklist NOAI Singapore 2026 Preliminary Round · Task 1
SOTA-AI Editorial
Preliminary Round Assessment (300 MCQs)
Answer 300 multiple-choice questions on mathematics, computing, AI/ML/DL, generative AI and problem-solving in three hours.
Hints
Hint 1
Identify the tested concept before choosing an option: dimension, derivative, estimator, metric, or failure mode.
Hint 2
For numeric questions, calculate the value rather than recognizing a familiar-looking choice.
Hint 3
For scenario questions, distinguish the observed symptom from one possible cause; missing evidence can make more than one diagnosis plausible.
Hint 4
Treat claims about library behavior as version- or implementation-dependent unless the question states the relevant implementation.
The solution in one line
Use definitions and direct calculations for the released questions; the public PDF contains no official answer key, so ambiguous items remain flagged.
The editorial
NOAI Singapore 2026 Preliminary — 300 MCQs
Problem domain: Mathematics, computing, classical ML, deep learning, generative AI, and ML operations
Official metric: 1 mark per correct answer, 300 total; no deduction for wrong answers
Abridged statement
Answer the 300 released questions spanning linear algebra, calculus, probability, Python, NumPy, PyTorch, classical ML, neural networks, CNNs, transformers, generative models, deployment, and MLOps. The post-event assessment PDF exposes question text and choices but not the official response key.
This is a retrospective solution based on the public release. The organizer's instructions prohibit AI assistance during the live assessment.
Data analysis
There is no model-training dataset. The assessment is broad and mostly tests definitions, calculations, and diagnosis of short scenarios. The official PDF numbers these after ten personal-information fields: the key therefore indexes the 300 assessment questions in order (question 1 corresponds to form field 12; question 300 to field 311).
Experiments
I derived the answer sequence from the released question text and choices, checking the mathematical items directly and using standard definitions for the programming and ML items. There is no official key or scorer with which to measure accuracy. A small number of items are underdetermined or use overbroad claims; they are marked rather than silently guessed.
Chosen method
The derived answer key groups choices by question range. ? means no unique answer is supported by the released prompt; * marks the likely intended choice where the released wording is too broad or technically imperfect. The file is not an official key.
Measured score and evidence
Score not measured. No organizer answer key, returned form data, or public grading harness was released with the PDF. The preliminary answer key is an auditable derivation, not an official score. In particular, no percentage or 300/300 claim is made.
Alternatives considered
- Omitting all answers on uncertain items would be unhelpful where one option remains the best supported choice; the key flags those choices with an asterisk instead.
- Copying the organizer's online form as if its responses were official would be misleading; the public PDF shows the questions, not responses.
Compute and footprint
Not applicable: this is a multiple-choice assessment, with no model training or data processing.
Code
Solution code
"""Derived answer key for NOAI Singapore 2026 Preliminary (300 MCQs).
This is not an official key and has no measured score; see editorial.md.
"""
ANSWER_KEY_MARKDOWN = r"""
# NOAI Singapore 2026 Preliminary — derived answer key
This key follows the order of the 300 assessment questions in the [released PDF](https://aisingapore.org/wp-content/uploads/2026/04/NOAI-2026-Preliminary-Round-Assessment-300-MCQs-Google-Forms.pdf). Form fields 1–11 collect participant information; assessment question 1 is form field 12. Letters refer to choices in their displayed order (A–D). This is a derived key, not an official answer key. `?` means the released information does not support a unique choice. `*` means the likely intended option has a technical caveat.
| Questions | Choices, in question order |
|---:|:---|
| 1–20 | A A C B B C B B B A B A A A B B A A B A |
| 21–40 | B A B A A B A B A A A B B B B A B A A A |
| 41–60 | A B A A A B B A B B D C D B B D C B D C |
| 61–80 | D C* B D B A C D B D C C A A A C C B A D |
| 81–100 | C B C B D A C A D C C D D C A B A C D B |
| 101–120 | D C A A B C D B C C A B D B A C C B C C |
| 121–140 | C D B C A D A A A B C C D B D D A C D D |
| 141–160 | C D B D C C C D A C D D C D D B D D C C |
| 161–180 | D D A C C D D D D D D D D C C C D D D D |
| 181–200 | D C C C C C C C D C C C D B B B C C C D |
| 201–220 | D A A C C D C C C B C C C C D C B C C D |
| 221–238 | B C C D B C C A A C B C D C B B C C |
| 239–260 | C A B C C C C C C B C A B D A C D B D A A* C* |
| 261–280 | C A C A D A D D C D B A* A B A C A* A* D* C |
| 281–300 | A* A A D* D A C D A A A C C D C B B C B B |
## Uncertain and technically imperfect items
- **Q62:** C is the likely choice for a p-value, but the option describes it loosely. A p-value is the probability, under the null, of results at least as extreme as those observed.
- **Q259:** A is likely intended for the missing-value scenario, but native handling is implementation-dependent; ordinary decision trees do not universally support missing values without preprocessing.
- **Q260:** C is the best offered clustering option, but DBSCAN is not robust to clusters with substantially different densities. The question's wording overstates its fit.
- **Q272:** A is the best diagnostic sequence among the choices, but anomaly detection and numeric-domain checks are both defensible without a stated NaN source.
- **Q277:** A is the closest listed explanation (softmax saturation), but zero final-layer gradients with nonzero earlier gradients do not uniquely identify it; some other choices would also affect earlier gradients or raise an error.
- **Q278:** A is likely intended (final-layer biases suppress classes 3–49), but the observed class collapse does not establish that initialization caused it after 100 epochs.
- **Q279:** D is the likely intended “sharp minimum” explanation, but the stated observations do not rule out other causes, and the learning-rate change in that option is not specified.
- **Q281:** A is the closest route to a 10× speedup, but 8-GPU scaling and convergence quality are hardware- and workload-dependent; the choices do not establish 10×.
- **Q284:** D is the likely intended adaptive-batch strategy, but the compute-budget wording conflicts with listed wall-clock times and no result is supplied for that strategy.
The key has **no measured score**: the public release contains no official key or scorer. These answers are not represented as organizer-verified.
"""Editorials are written by members of the SOTA community, not by the olympiad. The official statement and scoring win wherever an editorial differs.