Unit 3: Programming

3 dot points across 3 inquiry questions, in syllabus order. Each dot point has a focused answer, with exam-style questions and worked answers where available.

How do data structures and standard algorithms organise and process data efficiently?

Use arrays and dictionaries, apply linear and binary search and standard sorting algorithms (such as bubble, selection and insertion sort), and compare algorithm efficiency using Big O notation

How arrays and dictionaries store data, how linear and binary search work, how bubble, selection and insertion sorts work, and how Big O notation (O(1), O(log n), O(n), O(n squared)) compares algorithm efficiency, with traces and exam-style questions.

8 min read →

How do developers build, test and maintain reliable software responsibly?

Apply a software development framework and good programming practice, test and debug programs (types of errors, test data, debugging techniques), use object-oriented programming concepts, and explain developers' legal and ethical obligations

The software development process and good practice (naming, comments, modularity, version control), syntax, runtime and logic errors, normal, boundary and invalid test data, debugging techniques, object-oriented concepts (classes, objects, encapsulation, inheritance, polymorphism) and developers' legal and ethical obligations.

8 min read →

How are programs built from data types, operators, control structures and functions?

Use data types, operators, control structures (sequence, selection, iteration) and functions with parameters, return values and scope to design, trace and write algorithms in pseudocode and a programming language

The building blocks of programs for WACE Computer Science: primitive data types, arithmetic, relational and logical operators, sequence, selection and iteration, functions with parameters and return values, local and global scope, and how to trace an algorithm with a trace table.

7 min read →