WACE Computer Science study plan

WACE Computer Science · Give each week a clear focus.

8 weeks · About 6 hours per week

Week 1

Computer Science

Map the full WACE Computer Science syllabus into a personal checklist of every dot point, tagging each as known, shaky, or unknown
Define core terminology for data representation (bits, bytes, binary, hexadecimal, ASCII, Unicode) and write a one-line definition for each in your own words
Practise converting between binary, decimal and hexadecimal by hand for at least 20 numbers, then verify each with a calculator
Build a one-page reference sheet for number bases and character encoding that you will reuse all course

A completed syllabus checklist with all dot points tagged, plus a verified one-page data representation reference sheet

Week 2

Explain how integers, floating point numbers, characters, images and sound are represented digitally, writing 150 words on each
Perform binary addition and subtraction and describe overflow and underflow with a worked example for each
Compare lossy and lossless compression and identify which file types use each
Solve 10 practice problems on data representation and record your error patterns

A 10-question self-made quiz on data representation with full worked solutions and a log of mistakes made

Week 3

Describe the fetch-decode-execute cycle and trace a simple instruction through each stage
Compare the roles of CPU, memory, storage and input/output devices and explain how they interact
Distinguish system software from application software and give two examples of each with their purpose
Draw a labelled diagram of the von Neumann architecture from memory and check it against your notes

A hand-drawn von Neumann architecture diagram with a written walkthrough of one fetch-decode-execute cycle

Week 4

Explain the purpose of operating systems, including memory management, process scheduling and file systems
Compare at least three types of networks (LAN, WAN, WLAN) by scale, hardware and typical use
Describe the TCP/IP model layers and match common protocols (HTTP, FTP, SMTP, DNS) to their layer and purpose
Identify common network security threats and the controls used against each

A network fundamentals summary sheet covering topologies, protocols and security threats, checked against the syllabus

Week 5

Define algorithm and pseudocode conventions, then write pseudocode for searching and sorting tasks
Trace linear search, binary search, bubble sort and insertion sort over given data sets, recording each comparison
Compare algorithm efficiency in terms of best, average and worst case for the algorithms studied
Convert pseudocode into working code in one language of your choice and test it

Four working programs (two searches, two sorts) with trace tables showing comparison counts

Week 6

Explain the difference between a problem statement, an algorithm and a program, with an example of each
Design a solution to a small problem using structure charts or flowcharts and justify your design choices
Apply top-down design and modularisation by breaking a larger task into at least four modules
Write test data covering normal, boundary and invalid cases for your designed solution

A complete design document for one small program: problem statement, structure chart, pseudocode and a test data table

Week 7

Describe the stages of the software development life cycle and the role of each stage
Compare waterfall and iterative development approaches and state when each is appropriate
Explain the purpose of documentation, version control and maintenance in a project
Review your week 6 design and identify three improvements you would make with justification

A written comparison of two development methodologies applied to your own week 6 project, with three justified improvements

Week 8

Consolidate all earlier notes into a single revision pack organised by syllabus dot point
Complete a full-length timed practice paper under exam conditions and mark it against the syllabus
Revisit every dot point tagged unknown in week 1 and confirm you can now explain it
Write a one-page exam strategy covering question order, time allocation and how to show working

A marked full-length practice paper with a score breakdown by topic and a completed one-page exam strategy sheet

Week 2: Can convert between binary, decimal and hexadecimal without a calculator and explain how text, images and sound are stored

Week 4: Can draw the von Neumann architecture and describe the fetch-decode-execute cycle and network layers from memory

Week 6: Can trace searching and sorting algorithms on paper and produce a complete design document for a small program

Week 8: Scores at least 70 percent on a timed full-length practice paper and every week 1 unknown dot point is resolved