Algorithms
T
Data Structures & Complexity (GCSE)
GCSE-style stretch. Expect multi-step reasoning and exam vocabulary.
Computer Science · Hard
5
questions · ~4 min · 3 hints each (−5 pts)
Confidence tracking, 3-tier hints and instant feedback.
What you'll learn
- 1Arrays store items by index.
- 2Stacks: LIFO. Queues: FIFO.
- 3Trees & graphs represent relationships.
- 4Efficiency matters.
Question mix
- Multiple choice×4
- Fill the gap×1
How it works
Score ≥ 80% to unlock- 1
Rate your confidence
Tell us how sure you feel before answering. It powers your weak-topic map.
- 2
Use hints if stuck
Reveal up to 3 progressive hints per question. Each hint costs 5 Treasure Points.
- 3
See what went wrong
Instant feedback solves the exact question you just answered, so nothing stays fuzzy.
Ready when you are. This takes about 4 minutes.