Year 12 · WACE / Computer Science
Assessment and exam practice.
Plan a practice session around the assessment you are preparing for.
Try this with Computer Science
- Check the task format, time limit and permitted materials with your school.
- Start with one timed section or task and record where you spent the most time.
- Review errors before attempting another section. Separate missing knowledge from timing problems.
Practice paper focus areas
- Exam 1 — Python 2D array processing; OOP inheritance; subnetting a /24 into four subnets
- Exam 2 — dictionaries in Python; binary search and Big O; TCP vs UDP for streaming
- Exam 3 — trace tables and post-test loops; exception handling; Cisco network diagram with three subnets
- Exam 4 — class design in pseudocode; insertion vs selection sort; IPv4 vs IPv6
- Exam 5 — 2D grid search in Python; modular design and stubs; ping and traceroute analysis
- Exam 6 — parameter passing value vs reference; Gantt chart and iterative development; default gateway and DNS
- Exam 7 — Boolean logic and precedence; bubble sort trace; packet architecture by layer
- Exam 8 — OOP polymorphism; unit and acceptance testing; CIDR /26 and /27 allocation
- Exam 9 — dictionary of lists in Python; runtime errors (division by zero, index out of range); router vs switch roles
- Exam 10 — linear search vs binary search; functions returning one data structure; wireless access points and segmentation
- Exam 11 — selection sort and Big O; class with methods and validation; public vs private IP and NAT-free design
- Exam 12 — nested loops over 2D arrays; version control and backup; OSI vs DoD comparison
- Exam 13 — algorithm design in pseudocode; desk check and logic errors; traceroute to a remote server
- Exam 14 — inheritance hierarchy; live test data and load testing; subnetting for departments by host count
- Exam 15 — dictionary frequency counting; good programming practice choices; ports and well-known services
- Exam 16 — 2D array row/column totals; encapsulation and abstraction; bandwidth and broadcast domains
- Exam 17 — recursion-free iterative algorithm in Python; stubs and modular decomposition; IPv6 addressing features
- Exam 18 — sorting records by a key; exception handling for input validation; firewall placement and DMZ-free small office design
- Exam 19 — OOP game objects; Big O of nested loops; network diagram with VoIP and PoS devices
- Exam 20 — grid path-finding in pseudocode; developer retrospective and UAT; DNS resolution steps
Resource inventory inspected 4 November 2026. The main ATARMAXXING study platform is separate from tutoring. Topic labels show what was found, not a guarantee of complete curriculum coverage or tutor availability.
Want help with this subject?
Register interest in Year 12 Computer Science tutoring.