Exam Mode · Computer Science

Your guided session, built like a tutor

Learn the essentials, test yourself immediately, then lock it in with a mini exam hit. Every topic card below is a full micro-lesson.

Focus block25 min
Recall sprint6 min
Exam hit8 min
Session progress0%

Full session map

Every topic covered in this subject, with time estimates.

Total ~252 mins

Algorithms and Computational Thinking

Paper 1 · Both

28 min
Next upIn today’s focus
Open lesson

Programming Basics

Paper 1 · Both

Locked
28 min

Finish the previous lesson to unlock.

Data Representation

Paper 1 · Both

Locked
28 min

Finish the previous lesson to unlock.

Data Structures

Paper 1 · Both

Locked
22 min

Finish the previous lesson to unlock.

CPU, Memory, and Storage

Paper 2 · Both

Locked
28 min
In today’s focus

Finish the previous lesson to unlock.

Networks and Protocols

Paper 2 · Both

Locked
28 min

Finish the previous lesson to unlock.

Cybersecurity and Threats

Paper 2 · Both

Locked
24 min
In today’s focus

Finish the previous lesson to unlock.

Databases and SQL

Paper 2 · Both

Locked
22 min

Finish the previous lesson to unlock.

Software Testing and Development

Paper 2 · Both

Locked
22 min

Finish the previous lesson to unlock.

Ethics, Legal, and Environmental Issues

Paper 2 · Both

Locked
22 min

Finish the previous lesson to unlock.

Focus topics (start here)

Each card is a full micro-lesson: learn → check → apply.

Focus 1

Algorithms and Computational Thinking

Paper 1 · Both

Full notes

Teach it

  • Algorithm Design

    Define the problem inputs, processes, and outputs.

  • Trace Tables

    Step through the algorithm line by line.

Key facts

  • Selection uses IF/ELSE logic; iteration uses loops.
  • Binary search requires sorted data.
  • Merge sort is faster on large data sets.
  • Flowcharts and pseudocode should follow standard conventions.

Key terms

iteration: Repeating steps using a loop.
selection: Choosing a path using a condition.
trace table: A table showing variable values step by step.

Quick check

Explain why binary search is faster than linear search on large lists.

3 marks · Paper 1

Focus 2

CPU, Memory, and Storage

Paper 2 · Both

Full notes

Teach it

  • CPU Architecture

    CPU includes ALU, control unit, and registers.

  • Memory

    RAM is volatile; ROM is non-volatile.

Key facts

  • Clock speed and number of cores affect CPU performance.
  • RAM is cleared when power is off.
  • Virtual memory uses secondary storage to extend RAM.
  • SSDs are faster and more durable than HDDs.

Key terms

ALU: Arithmetic logic unit that performs calculations.
register: Small, fast storage inside the CPU.
cache: Small memory that stores frequently used data.

Quick check

Explain two reasons why cache memory improves performance.

4 marks · Paper 2

Focus 3

Cybersecurity and Threats

Paper 2 · Both

Full notes

Teach it

  • Threats

    Know malware types: virus, worm, trojan, spyware, ransomware.

  • Prevention

    Use anti-malware, firewalls, and secure passwords.

Key facts

  • Phishing uses fake messages to steal data.
  • Strong passwords combine length, symbols, and unpredictability.
  • Brute force attacks try every possible password.
  • Two-factor authentication adds a second layer of security.

Key terms

malware: Malicious software designed to harm systems.
phishing: Tricking users into revealing sensitive information.
encryption: Scrambling data so only authorised users can read it.

Quick check

Explain two methods to reduce the risk of phishing.

4 marks · Paper 2

Recap prompts

6 min

Say each prompt out loud. If you can’t, revisit the focus card.

  • Explain Data Representation in three bullet points without notes.
  • Explain Data Structures in three bullet points without notes.

Session checklist

1. Read the focus cards and answer the quick checks.
2. Complete the recap prompts without looking.
3. Finish one flashcard sprint or paper question.

Progress: 0/10 topics completed.

Examiner cue

Use the words LIFO and FIFO in answers.

Full exam technique

Flashcard sprint

40 cards across 8 decks.

Start flashcards

Stretch topics

If you still have time, hit one of these next.

  • Data RepresentationOpen
  • Data StructuresOpen