ATARMAxxing
WACE Computer SciencePractice Examination 17
| Reading time | 15 minutes |
| Writing time | 2 hours |
| Total marks | 194 |
| Questions | 24 |
| Structure | Section 1 — 20 Q, 83 marks · Section 2 — 4 Q, 111 marks |
This paper covers
- 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)
Students are permitted to bring into the examination the materials normally allowed for this subject. Answer all questions in the spaces provided.
This is an ATARMAxxing practice paper. It is not an official examination and is not affiliated with, endorsed by, or produced by the VCAA, NESA or the QCAA.
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 →