ATARMAxxing · Computer Science
WACE Computer Science Practice Exams with Worked Solutions
20 full-length papers · worked solutions for every question
The 20 practice exams inside the WACE Computer Science Mastery Pack, each set out like the real paper with a separate worked-solution guide. Open any paper to see what it covers.
- Python 2D array processing
- OOP inheritance
- subnetting a /24 into four subnets
- ER diagram for a booking system
- phishing and APP11
- Python insertion sort
- SQL GROUP BY
- Notifiable Data Breaches scheme
- dictionaries in Python
- binary search and Big O
- TCP vs UDP for streaming
- normalisation to 3NF
- ransomware and backups
- dictionary of dictionaries
- traceroute interpretation
- APP5 notification
- trace tables and post-test loops
- exception handling
- Cisco network diagram with three subnets
- SQL joins across three tables
- CIA triad analysis
- VLSM-style subnet allocation
- ACID and ODBC
- digital signatures
- class design in pseudocode
- insertion vs selection sort
- IPv4 vs IPv6
- data dictionary and data types
- man-in-the-middle and VPN
- IPv6 address notation
- domain integrity CHECK constraints
- algorithm stability
- 2D grid search in Python
- modular design and stubs
- ping and traceroute analysis
- M:N resolution
- SQL injection and input validation
- parameterised queries
- variable scope
- carrier traceroute interpretation
- parameter passing value vs reference
- Gantt chart and iterative development
- default gateway and DNS
- insert/update/delete anomalies
- asymmetric encryption and certificates
- Constructed case: Lakeview College canteen pre-order system
- Normalisation to 3NF and SQL GROUP BY on order lines
- Four equal /26 subnets with Cisco-style device table
- Boolean logic and precedence
- bubble sort trace
- packet architecture by layer
- referential and domain integrity
- zero day vulnerability response
- Constructed case: RidePerth bike-share and city IoT network
- VLSM allocation of 10.60.0.0/24 and encapsulation by layer
- Brute-force log analysis and firewall precedence bug
- OOP polymorphism
- unit and acceptance testing
- CIDR /26 and /27 allocation
- GROUP BY with aggregates
- DDoS and firewall filtering
- Constructed case: Fremantle Clash esports tournament and LAN venue
- Largest-first /26 and /27 allocation with an ordered ACL
- Load-test acceptance data and request-flood detection in Python
- dictionary of lists in Python
- runtime errors (division by zero, index out of range)
- router vs switch roles
- ER diagram (six entities)
- AAA framework audit
- Constructed case: ToolBarn Hire branches and head-office network
- Docket normalisation to 3NF with a five-table SQL join
- Least-privilege and log audit of staff accounts
- linear search vs binary search
- functions returning one data structure
- wireless access points and segmentation
- 3NF with composite keys
- NDB scheme obligations
- Constructed case: Coastline Imaging clinic bookings and referrals
- VLSM with a /29 and guest Wi-Fi segmentation
- Stolen-laptop NDB assessment and signed radiology reports
- selection sort and Big O
- class with methods and validation
- public vs private IP and NAT-free design
- SQL UPDATE and DELETE with cascade
- insider threats and access control lists
- nested loops over 2D arrays
- version control and backup
- OSI vs DoD comparison
- ACID in concurrent transactions
- cross-site scripting
- algorithm design in pseudocode
- desk check and logic errors
- traceroute to a remote server
- calculated and concatenated fields with aliases
- trojan horses and anti-malware
- inheritance hierarchy
- live test data and load testing
- subnetting for departments by host count
- data quality and cleaning outliers
- phishing simulation and user training
- dictionary frequency counting
- good programming practice choices
- ports and well-known services
- ER diagram from a narrative (seven entities)
- red team vs blue team
- 2D array row/column totals
- encapsulation and abstraction
- bandwidth and broadcast domains
- SQL CREATE TABLE with constraints
- symmetric vs asymmetric for bulk data
- constructed case: Saltbush Flats Growers' Co-operative (paddocks, crops, deliveries, buyers; shed and office network)
- recursion-free iterative algorithm in Python
- stubs and modular decomposition
- IPv6 addressing features
- normalising a repeating group
- spyware, adware and back doors
- constructed case: Pirouette Lane Dance Studio (classes, instructors, enrolments, payments)
- sorting records by a key
- exception handling for input validation
- firewall placement and DMZ-free small office design
- inner join across four tables
- APP5 collection notices and APP12 access
- constructed case: Gleam Mobile Detailing (bookings, vehicles, staff, packages; small office plus mobile staff VPN)
- OOP game objects
- Big O of nested loops
- network diagram with VoIP and PoS devices
- data dictionary for five tables
- IP spoofing and log analysis
- constructed case: Lantern Hall Community Cinema (screenings, films, memberships, kiosk; PoS and VoIP subnets)
- grid path-finding in pseudocode
- developer retrospective and UAT
- DNS resolution steps
- ER diagram with a composite key
- early ciphers vs current best practice
- constructed case: Ridgeback Bushwalking Club (trails, trips, members, gear loans; club-house network)
Included in the WACE Computer Science Mastery Pack
20 full-length practice exams with worked solutions, 20 revision notes, 64 practice questions and 200 flashcards.
Preview a sample note and question free on the WACE Computer Science hub →