Review of VCE Algorithmics (HESS)
Summary of proposed changes to the study
design
General changes
The review of VCE Algorithmics focused on:




Improving the clarity of some key knowledge
Increasing the coherence between areas of study
Redressing some inequities in students’ workload between areas of study in a unit
Redressing some inequities in the contribution of some areas of study to the study score, based
on student workload.
The review of VCE Algorithmics has resulted in the following key assessment changes:

All outcomes in each unit will be assessed through a School-assessed Task (SAT) – there will
be no School-assessed Coursework component. Each SAT will contribute 20 percent to the
study score. The value of the examination remains at 60 percent.

Modifications to the descriptions of the assessment tasks to reflect changes in the areas of
study and to improve clarity.
Note: there has been no change in the total workload for students; just some minor
adjustments to some task details.
The review of VCE Algorithmics has resulted in the following proposed key content changes:
 Introduction of some new key knowledge and key skills
 Increased specificity of some key knowledge to improve clarity
 Transfer of some outcome statement requirements between areas of study, and the
corresponding content shifts
 Removal of some key knowledge and key skills to reduce inequities between areas of study.
Specific changes
Unit 3
Unit 3: Algorithmic problem solving
i.
Area of Study 1: Data modelling with abstract data types



Re-ordering of key knowledge
Restructuring of some key knowledge for coherence, such as grouping the characteristics
and uses of ADTs and the graph ADT in two key knowledge points – specifications and
uses of standard ADTs and specifications and uses of standard graph ADTs
Addition of some specifications for standard graph ADTs
© VCAA June 2016
Review of VCE Algorithmics (HESS)

ii.
The removal of the Key skill relating to modelling processes with state diagrams.
Area of Study 2: Algorithm design





iii.
Unit testing has been removed as a key knowledge
New key knowledge relating to conditional expressions using logical operations
Removal of Key knowledge (informal measures of algorithm complexity)
Some key skills rewritten to sharpen their focus
Removal of Key skill linked to informal measures of complexity.
Area of Study 3: Applied algorithms




Testing has been removed from the outcome statement and from the key knowledge
New key knowledge focusing on suitability of ADTs for different contexts and how ADTs
can be combined to meet requirements
New key knowledge focusing on specifications and documentation of data model and
algorithm design
New skill focusing on selecting and justifying ADTs and algorithm design patterns.
Unit 4
Unit 4: Principles of algorithmics
i.
Area of Study 1: Formal algorithm analysis



ii.
Clause removed from the outcome statement ‘… and how they might be overcome by
heuristic methods and non-digital models of computation.’ and corresponding key
knowledge (aspects moved to Area of Study 2)
Increased key knowledge and specificity on Big-O notation
Increased specificity in key knowledge for P and NP-complete complexity and the Master
Theorem.
Area of Study 2: Advanced algorithm design



iii.
New clause added to outcome statement (aspects from Outcome 1) and the corresponding
key knowledge
Minor modifications to some key knowledge
Inclusion of 1-D knapsack problems.
Area of Study 3: Universality of computation and algorithms





Refining of some key knowledge to improve scope
Reordering of key knowledge to support cohesion
Inclusion of new key knowledge on Cobham’s thesis for computational complexity theory
Inclusion of new key knowledge on Turing machines
Removal of existing, and inclusion of new key skills to better reflect the outcome statement.
© VCAA June 2016
Page 2
Review of VCE Algorithmics (HESS)
Assessment
Outcome statements in some areas of study across Units 3 to 4 have been altered to reflect the
focus of the unit.
Unit 3 Outcome Statements
Current Study Outcome
Statements
Consultation Draft Outcome
Statements
Outcome 1
Outcome 1
Devise formal representations for
modelling various kinds of
information problems, using
appropriate abstract data types, and
apply these to a real-world problem
School-assessed Task
A folio of small tasks, including:
 two to four tasks using a range of
abstract data types to model salient
aspects of problems
 two to four small tasks using a range of
algorithm design patterns to specify
algorithms to solve problems.
Unchanged
AND
A written explanations of each of

the specification and application of
ADTs

the specification and application of
algorithms for graphs.
(each of approximately 45-60 minutes)
Outcome 2
Design an efficient algorithm to
solve an information problem using
basic algorithm design patterns, and
implement and test the algorithm
Outcome 2
Design an efficient algorithm to
solve an information problem using
basic algorithm design patterns, and
implement the algorithm
AND
An extended project consisting of three
connected components consisting of:
The data model of a real-world

problem includes:
specification of the data model
a concrete instance of the data
model (worked example), and
documentation of the data model
development approach.
(approximately 300–500 words).

Outcome 3
Outcome 3
Evaluate and document algorithms
and data representations, and solve
real-world problems whose solution
requires the integration of multiple
Unchanged
An algorithm to solve a real-world
problem that builds on an existing data
model (solution to Outcome 1 or
provided model), includes:
pseudocode to solve the problem
implementation of the algorithms
in a high-level programming
language making appropriate use
of the standard ADTs, and
documentation of the algorithm
development approach.
(approximately 300–500 words)

An evaluation of an existing data
model and algorithm in the form of a
written report.
(approximately 300–500 words)
algorithms and data types.
*School-assessed Task for Unit 3 contributes 20 per cent.
© VCAA June 2016
Page 3
Review of VCE Algorithmics (HESS)
Unit 4 Outcome Statements
Current Study Outcome
Statements
Consultation Draft Outcome
Statements
Outcome 1
Outcome 1
Establish the correctness and
efficiency of simple algorithms, and
explain soft limits of computability
Establish the efficiency of simple
algorithms, and explain soft limits of
computability
and how they might be overcome by
heuristic methods and non-digital
models of computation
Assessment tasks
A written explanation of

formal analysis techniques and the
practical limits of computability

advanced algorithm design.
(approximately 45–60 minutes)
AND
Outcome 2
Outcome 2
Solve a variety of information
problems using advanced algorithm
design patterns
Solve a variety of information
problems using advanced algorithm
design patterns and explain how
they might be overcome by heuristic
methods
The design of an algorithm, consisting of
two components:

Formal analysis of a given naïve
algorithm
(approximately 500 words)

A response to a naïve algorithm
consisting of:
an improved sophisticated
algorithm design
an analysis of the improved
design.
(approximately 500 words)
AND
Outcome 3
Explain the scope of algorithmics as
an approach to computational
problem solving, and demonstrate
the universality of computation and
its limits using core concepts from
theoretical computer science
Outcome 3
An explanation of the universality of
computation and algorithms in one or more
of the following forms:
A written report (approximately 700–

800 words)
A visual report

An oral report.

Unchanged
*School-assessed Task for Unit 4 contributes 20 per cent.
© VCAA June 2016
Page 4