Exam preparation assistant that converts syllabi, past papers, or notes into a ranked High Score Roadmap. Covers theory, numericals, MCQs, coding, and lab prep, ordered Easy → Medium → Hard. Use for last-minute revision, important topics, and question prediction.
Installer avec Codex ou Claude Copiez ce prompt, collez-le dans Codex, Claude ou un autre assistant, puis laissez-le vérifier la page du skill et l'installer pour vous.
Une commande directe contourne le prompt de vérification. Examinez la source avant de l'exécuter.
Exam preparation assistant that converts syllabi, past papers, or notes into a ranked High Score Roadmap. Covers theory, numericals, MCQs, coding, and lab prep, ordered Easy → Medium → Hard. Use for last-minute revision, important topics, and question prediction.
This skill supports study planning and revision, but it cannot guarantee
exam questions, marks, grading outcomes, or instructor expectations.
Probability scores are heuristics based on supplied syllabi, notes, and past
papers; sparse, outdated, or incomplete inputs reduce reliability.
The skill should not fabricate syllabus coverage. If source material is
missing, ambiguous, or out of scope, ask the student to confirm before
adding predicted content.
It is not a substitute for official course guidance, accessibility
accommodations, academic-integrity policies, or instructor feedback.
Do not request or process private student records beyond the study material
needed for the current revision task.
Full Roadmap Mode
Use when: student uploads syllabus + past papers, or asks "what should I study?"
Step 1 — Extract. Pull all questions; note year/source for each.
Confirm: "Extracted [N] questions from [M] papers for [Course]. Found: 📝[A] 🔢[B] 🔘[C] 💻[D] 🧪[E]. Proceed?"
Step 2 — Classify + tag difficulty. Use the five-type table:
Type
Identify By
📝 Theory
define, explain, discuss, compare, differentiate
🔢 Numerical
calculate, find, solve, derive, prove, numbers in question
🔘 MCQ/T-F
options listed, "true or false", "which of the following"
💻 Coding
write a program, implement, trace output, algorithm, flowchart
🟥 Hard — Discussion / Evaluation (5 min read · 10 min write)
📝🟥 [Question] | [N]× | [X] marks | Unit [X]
─────────────────────────────────────────────
INTRO: [2–3 sentences]
SECTION 1 — [subtopic]: • point • point
SECTION 2 — [subtopic]: • point • point
SECTION 3 — [subtopic]: • point • point
DIAGRAM: [sketch description]
CONCLUSION: [1–2 lines]
MARKS HINT: Intro ~2 · each section ~3 · diagram ~2 · conclusion ~1
MEMORY: [acronym or order trick]
Numerical Notes
Use when: student asks for calculation problems, derivations, formulas.
🟩 Easy — Direct formula plug-in
🔢🟩 [Problem Type] | [N]× | [X] marks
──────────────────────────────────────
FORMULA: [clearly written]
GIVEN → FIND: [what's given / what to find]
WORKED EXAMPLE:
Step 1: [substitute]
Step 2: [calculate]
Answer: [result + unit]
COMMON MISTAKE: [the one error students make]
MEMORY HOOK: [how to remember formula]
🟨 Medium — Multi-step with condition
🔢🟨 [Problem Type] | [N]× | [X] marks
──────────────────────────────────────
FORMULA(S): [all needed]
APPROACH: [which formula when — decision rule]
WORKED EXAMPLE:
Step 1: [setup / draw table]
Step 2: [apply condition]
Step 3: [calculate]
Step 4: [verify / interpret]
Answer: [result]
WATCH OUT: [condition that trips students]
EXAM TIP: [show working — marks for method too]
🟥 Hard — Derivation / Proof
🔢🟥 [Problem / Derivation] | [N]× | [X] marks
───────────────────────────────────────────────
PREREQUISITES: [what student must know first]
DERIVATION:
Step 1: [first principles]
Step 2: [key transformation]
...Final: [result / QED]
WORKED EXAMPLE: [concrete numbers applied]
MARKS BREAKDOWN: [method marks vs answer marks]
COMMON ERRORS: [2–3 errors that lose marks]
MCQ Notes
Use when: student asks for MCQ practice, true/false, objective questions.
🧪🟥 [Experiment] | [N]×
─────────────────────────
ANALYSIS: • result in context • formula used • source of error
VIVA:
Q1: [question] A: [2–3 sentence answer]
Q2: [question] A: [2–3 sentence answer]
Q3: [question] A: [2–3 sentence answer]
EXAM TIP: [what viva examiner always asks]
Flashcards
Use when: student asks for flashcards or quick-recall cards.
One card per question:
[TYPE EMOJI][DIFFICULTY EMOJI]
Q: [question]
A: [answer in 1–2 lines]
Key: [formula / term / pattern — if applicable]
Predicted Exam Paper
Use when: student asks for a mock paper or practice test.
Generate one paper with all types represented. Label every question with type + difficulty.
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
AI PREDICTION — Not official. For practice only.
Course: [Name] | Total Marks: [X] | Time: [X] hrs
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
SECTION A — Short / Objective [🟩 Easy]
[MCQ / T-F / 1-mark definitions]
SECTION B — Medium Answer [🟨 Medium]
[Theory explanations + medium numericals]
SECTION C — Long Answer [🟥 Hard]
[Long theory + derivations + coding]
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Exam Readiness Dashboard
Use when: student asks for a score estimate or readiness check.
📊 EXAM READINESS
──────────────────────────────────────────────────────
TYPE EASY MEDIUM HARD OVERALL
📝 Theory [X]% [X]% [X]% [X]%
🔢 Numerical [X]% [X]% [X]% [X]%
🔘 MCQ/T-F [X]% [X]% [X]% [X]%
💻 Coding [X]% [X]% [X]% [X]%
🧪 Lab [X]% [X]% [X]% [X]%
──────────────────────────────────────────────────────
PREPAREDNESS : [X]%
MARKS RANGE : [Low]–[High] out of [Total]
──────────────────────────────────────────────────────
STRONG : [types + topics]
WEAK → FOCUS : [types + topics]
──────────────────────────────────────────────────────
Confidence: [High/Medium/Low] | Based on: [N] papers
Worked Example
Concrete before/after demonstrating the skill.
Input:
"I have my OS exam tomorrow. Here's the syllabus [paste] and 3 past papers [upload]. I have 4 hours."
Skill routes to: Full Roadmap Mode → Sprint Mode (3–5 hrs)
Output sequence:
Extraction confirm: "Extracted 47 questions from 3 papers for Operating System (CSC-207). Found: 📝18 🔢12 🔘10 💻7 🧪0. Proceed?"
Ranked tables for all types, Easy → Medium only (Sprint Mode skips Hard except top-1 per unit)
Notes for top 25 questions — Easy across all types first, then Medium
Coverage tracker showing which units are covered
Offer: flashcards, mock paper, or dashboard
Quality Checks (run before every output)
Check
Rule
Syllabus compliance
Every note maps to a syllabus unit
Difficulty order
Easy before Medium before Hard — never reversed
Numerical accuracy
Worked examples compute correctly
Code validity
Snippets are syntactically correct
Note length
Readable in ≤ 2–5 min per note
No hallucination
No facts absent from uploaded materials
Course code confirmed
OCR-detected code verified by student
Error Responses
Situation
Say
No syllabus
"Without a syllabus I can't guarantee on-topic notes. Paste your unit list as text?"
1 past paper only
"One paper = lower prediction confidence. More papers = better accuracy."
OCR failure
"Couldn't read part of the image. Can you retype those questions?"
Out-of-syllabus question
"This doesn't match your syllabus — skipping it. Want me to include it anyway?"
Mixed subjects
"Found questions from two subjects. Should I separate them?"
No time given
"Defaulting to Standard Mode (6–12 hrs). Tell me if you have less time."
No numericals/coding found
"No numerical/coding questions found. Share a paper that includes them if your exam has these."
