Grade 12 VCE - Algorithmics

Weekly 1 hour sessions

This study investigates algorithmics, which provides a structured framework for solving real-world, practical problems with computational methods. Algorithmics is fundamental to computer science and software engineering and is essential for understanding the technical underpinnings of the information society. Beyond its use in computing, algorithmics provides a general discipline of rational thought by virtue of the methodical way it approaches problem-solving.

VCE Algorithmics (HESS) examines how information about the world can be systematically represented and how the processes can be made sufficiently explicit and precise so they can be implemented in a computer program. The focus is not on coding but on ‘algorithmic thinking’. Algorithmics covers systematic methods for analysing real-world problems and identifying the salient aspects that need to be modelled as the basis for finding a solution. It explores the design of algorithms to solve these problems, resulting in a powerful approach to manipulating, and reasoning about, structured information.

Mathematical techniques are used to establish crucial properties of algorithms, such as how their performance can be scaled to the size of the problem to be solved. This leads to an understanding of what types of algorithms are able to work efficiently at very large scales. Algorithmics also covers deeper topics in computer science such as the possibility of artificial intelligence, statistical methods of computation, and ethical issues related to both these topics. This investigation of theoretical topics is complemented by the development of skills in a high-level programming language.

This study enables students to:

·           understand the mathematical foundations of computer science

·           use symbolic representations and abstraction to formalise real-world information problems

·           design algorithms to solve practical information problems, using suitable abstract data types and algorithm design patterns

·           investigate the efficiency and correctness of algorithms through formal analysis and empirically through implementation as computer programs

·           reason about the mathematical limits of computability

·           understand ethical issues relating to data-driven algorithms.

Structure

The study is made up of two units.

·           Unit 3: Algorithmic problem-solving

·           Unit 4: Principles of algorithmics