MATSEC AM Computing study plan

Describe the fetch-decode-execute cycle and trace the role of PC, MAR, MDR and accumulator through one instruction

Convert between binary, denary and hexadecimal and perform two's complement subtraction without a calculator

Explain how cache, RAM and virtual memory differ in speed, cost and purpose, and why locality matters

Draw a truth table for a two-input logic gate circuit and simplify the expression using Boolean algebra

Compare von Neumann and Harvard architectures and justify a choice for a named embedded application

Explain pipelining, interrupts and DMA and describe one effect each has on throughput

Classify input, output and storage devices by their role and interface, giving one trade-off for each

Describe the purpose of an operating system in process, memory and file management with one concrete example per function

Write, compile and run a program in a compiled language that uses selection, iteration, functions and parameter passing

Trace a recursive function by hand and state its base case, recursive case and stack depth

Use an array and a record or struct to store and retrieve related data, then explain the difference between the two

Identify and fix three deliberately planted bugs in a supplied short program by reading the code, not by running it

Implement linear search and bubble sort from scratch and count comparisons for a sample array

Explain the stages of the software development lifecycle and map each stage to an artefact you produced this month

Distinguish syntax, logic and runtime errors and describe one debugging technique for each

Write test cases covering normal, boundary and invalid input for one of your own functions

Design a normalised relational schema from a written scenario, taking it to third normal form and stating each functional dependency removed

Write SELECT queries using WHERE, ORDER BY, GROUP BY and aggregate functions against your own schema

Draw an entity-relationship diagram with cardinality and participation constraints that matches your schema

Explain primary, candidate, composite and foreign keys using examples from your own tables

Trace binary search and merge sort on a given list, recording the state after each pass

Compare the time complexity of linear search, binary search, bubble sort and merge sort and justify when each is acceptable

Convert between a stack, a queue and a linked list by describing the operations each supports and one realistic use for each

Represent the same data as a flat file, a relational table and a tree, and state one advantage of each representation

Describe the TCP/IP layered model and place a router, switch, hub and firewall at the correct layer with a reason

Explain IP addressing, subnet masks and the difference between IPv4 and IPv6 in terms a non-specialist would follow

Distinguish symmetric and asymmetric encryption and explain how each supports a digital certificate

Identify three categories of malware and one mitigation for each, plus the difference between phishing and pharming

Complete a full timed mock paper under exam conditions and mark it against the mark scheme

List your five weakest syllabus points from the mock and close each with a targeted 20-minute revision burst

State the legal and ethical obligations of a developer under data protection and computer misuse legislation, with one scenario each

Rehearse concise written answers to compare-and-justify questions, using a claim, evidence and conclusion structure