Skip to main content
WalesComputer Science

WJEC A-Level Computer Science Unit 3 Programming and System Development: a complete overview of advanced data structures, paradigms, systems analysis, testing and networks

A deep-dive WJEC A-Level Computer Science guide to Unit 3 Programming and System Development. Covers advanced data structures and algorithms, Karnaugh maps and program construction, programming paradigms, the systems development life cycle, system design, testing and maintenance, data transmission and networks, and data security and integrity, with the definitions and exam patterns WJEC repeats.

Generated by Claude Opus 4.823 min readWJEC

Reviewed by: AI editorial process; not yet individually human-reviewed

Jump to a section
  1. What Unit 3 actually demands
  2. Advanced data structures and algorithms
  3. Programs and logical operations
  4. Programming paradigms
  5. Systems analysis and the development life cycle
  6. System design, testing and maintenance
  7. Data transmission and networks
  8. Data security, integrity and validation
  9. How Unit 3 is examined
  10. The seven topics, dot point by dot point
  11. For the official specification

What Unit 3 actually demands

Unit 3 Programming and System Development is one of the two A2 written units. It deepens the programming side of the course and adds the software-engineering discipline of building real systems. The content spans advanced data structures and algorithms, Boolean simplification with Karnaugh maps, the programming paradigms, the full systems development life cycle with its methodologies, system design, testing and maintenance, networks in depth, and data security and integrity. It rewards precise definitions, confident tracing of structures and algorithms, and clear, contrasted answers on methodologies and testing.

This guide walks through the seven topics of the unit, then sets out the exam patterns WJEC repeats. Each topic has a matching dot-point page with worked exam questions; this overview ties them together.

Advanced data structures and algorithms

Linked lists store nodes with pointers, allowing dynamic insertion and deletion. Binary trees are traversed in pre-order, in-order (which sorts a binary search tree) and post-order. Recursion processes these structures naturally, and advanced algorithms (binary search, merge and quicksort) are judged by efficiency in Big-O terms.

Programs and logical operations

Boolean expressions are written in sum-of-products form and simplified, most reliably with Karnaugh maps: group adjacent 1s in powers of two and eliminate the variables that change. Programs are constructed from the three control structures and decomposed into subroutines.

Programming paradigms

A paradigm is a style of programming. Procedural code is a sequence of subroutines acting on data; object-oriented programming bundles data and methods into objects from classes, with encapsulation, inheritance and polymorphism; declarative programming (logic and functional) describes what is wanted rather than how. Each suits different problems.

Systems analysis and the development life cycle

The life cycle runs from analysis (feasibility and requirements) through design, implementation, testing, installation and maintenance. Methodologies organise these stages: the waterfall runs them in strict sequence, agile in short adaptive iterations, and prototyping clarifies requirements with an early model.

System design, testing and maintenance

Design specifies data structures, algorithms, interfaces, inputs, outputs and validation. Testing uses black-box and white-box methods at unit, integration and system levels, with alpha then beta testing before release. Changeover is direct, parallel, phased or pilot. Documentation and evaluation support use, and maintenance is corrective, adaptive or perfective.

Data transmission and networks

Data is transmitted in serial (preferred over distance) or parallel, moved by packet switching, and governed by layered protocols where each layer serves the one above. Network hardware includes switches, routers and network interface cards, and network security uses firewalls, encryption, authentication and access control.

Data security, integrity and validation

Integrity means accurate, consistent, recoverable data. Backups (full or incremental) enable recovery; validation checks reasonableness and verification checks correct entry; error detection uses parity, checksums and check digits; and encryption protects confidentiality so intercepted data is unreadable.

How Unit 3 is examined

Unit 3 is an A2 written paper contributing 20 per cent of the full A level. Questions come straight from the specification statements and mix tracing and calculation (traversals, linked lists, Karnaugh maps) with extended explanation (paradigms, methodologies, testing, security). Practise the traces until automatic, and learn the definitions and contrasts precisely because mark schemes reward exact wording.

The seven topics, dot point by dot point

Each topic has a dot-point answer page with worked exam questions and cross-links. Browse them from this unit overview and the subject hub.

For the official specification

WJEC publishes the full specification, past papers and mark schemes at wjec.co.uk. Always revise from the current specification and WJEC's own past papers, because question style is board-specific.

Sources & how we know this

  • computer-science
  • wjec-a-level
  • wjec-computer-science
  • unit-3-programming-and-system-development
  • a-level
  • data-structures
  • paradigms
  • systems-analysis
  • networks