MATSEC IM Computing study plan
MATSEC IM Computing · Give each week a clear focus.
8 weeks · About 7 hours per week
Computer Systems
Map the internal architecture of a CPU (ALU, control unit, registers, buses) and explain in writing how the fetch-decode-execute cycle moves data between them
Convert between binary, denary, octal and hexadecimal by hand, and perform two's complement representation of negative integers without a calculator
Distinguish primary from secondary storage and compare RAM, ROM, cache and SSD/HDD on speed, volatility, cost per GB and typical use
Describe how an operating system manages processes, memory, files and peripherals, giving one concrete example of each function
Your checkpoint
A one-page labelled CPU diagram plus 20 self-marked conversion and two's complement exercises with all working shown
Computer Systems & Computing in Context
Explain the layered model of networks (hardware, protocols, addressing) and trace a single HTTP request from browser to server across each layer
Compare LAN, WAN, client-server and peer-to-peer topologies, and justify a topology choice for a named small-business scenario
Distinguish viruses, worms, trojans, phishing and ransomware, and match each to a proportionate countermeasure (firewall, patching, MFA, backups, user training)
Evaluate legal and ethical obligations around personal data in a computing system, referencing confidentiality, consent and data minimisation
Your checkpoint
A 400-word case study on a small office network covering topology, security threats, controls and legal duties, with a diagram
Programming and Algorithms
Write pseudocode and flowchart solutions for sequence, selection and iteration problems, including nested loops and multi-branch conditionals
Trace the execution of a given algorithm by hand, maintaining a variable table and predicting the exact output
Declare and manipulate one-dimensional and two-dimensional arrays, and implement linear search and bubble sort from scratch
Decompose a problem statement into inputs, processing steps and outputs before writing any code
Your checkpoint
A portfolio of 10 solved algorithm problems, each with pseudocode, a hand-trace table and verified output
Programming and Algorithms & Data and Information Management
Implement a working program in a language of choice that reads data, processes it with at least one function and one loop, and writes formatted output
Define the relational model terms (relation, tuple, attribute, primary key, foreign key, candidate key) and apply them to a normalised schema you design
Write SELECT queries using WHERE, ORDER BY, GROUP BY, HAVING and aggregate functions, and predict each result set before running it
Explain the purpose of normalisation to third normal form and remove insertion, update and deletion anomalies from a flawed schema
Your checkpoint
A working program plus a normalised (3NF) database schema with five tested SQL queries and their expected result tables
Data and Information Management
Distinguish data, information and knowledge, and evaluate the characteristics of good information (accuracy, timeliness, relevance, completeness) against a real dataset
Compare file-based and database approaches, and describe the roles of DBMS, data dictionary and transaction logging
Model a scenario as an entity-relationship diagram, resolving one-to-many and many-to-many relationships into tables
Describe validation and verification techniques (range, format, presence, check digit, double entry) and select the right one for a given field
Your checkpoint
A complete ER diagram, its relational schema and a validation plan for a booking system, with each design decision justified in one sentence
Computing in Context
Explain how emerging technologies (cloud computing, IoT, AI, blockchain) work at a conceptual level and state one credible benefit and one credible risk for each
Analyse the digital divide and the environmental cost of computing, citing specific mechanisms such as e-waste, energy use and unequal access
Apply a recognised ethical framework to a computing dilemma and reach a defensible recommendation
Describe the main provisions of data protection and computer misuse legislation and identify when each applies
Your checkpoint
A 500-word structured essay answering one past-paper-style discussion question, with a technology, a social impact and a legal point integrated
Computer Systems & Programming and Algorithms & Data and Information Management & Computing in Context
Complete a full timed mock paper under exam conditions and record raw marks per domain
Diagnose the two weakest domains from the mock and re-teach each weak topic from first principles
Redo every question answered incorrectly, writing the correct reasoning rather than just the answer
Practise explaining a technical concept in precise written English within a word limit
Your checkpoint
A completed mock paper with a mark breakdown per domain and a written error log of at least 15 corrected mistakes
Computer Systems & Programming and Algorithms & Data and Information Management & Computing in Context
Re-attempt all previously logged errors until every one is answered correctly without notes
Build a one-page summary sheet per domain covering definitions, formulas and comparisons only
Sit a second timed mock and compare domain scores against week 7 to confirm improvement
Rehearse exam technique: allocating time per mark, reading command words (state, describe, explain, evaluate) and structuring extended answers
Your checkpoint
Four revision summary sheets plus a second mock result showing measurable improvement in the weakest domain
Milestones
Week 2: You can draw a CPU diagram, convert and negate numbers in binary without help, and explain a network request end to end in under five minutes of speech
Week 4: A program runs correctly and a normalised schema exists with tested queries; if either is missing, hold week 5 content until both are complete
Week 6: You can answer one full extended-response question per domain within the time limit, scoring at least half marks on each
Week 7: The first timed mock is complete and every domain has a recorded score; any domain below 50% is scheduled for re-teaching before week 8
Week 8: The second mock shows improvement in the previously weakest domain and no domain remains below the pass threshold