433-152 Algorithmic Problem Solving (Advanced)

Students who have obtained a high level of achievement in 433-171 Introduction to Programming and who have reached a minimum required standard in an exemption test will be permitted to enrol in this subject.

Students may not gain credit for both 433-152 Algorithmic Problem Solving (Advanced) and either 433-141 Computing Fundamentals A or 433-172 Algorithmic Problem Solving.

433-151 Introduction to Programming (Advanced) or 433-142 Computing Fundamentals B

The objectives for this subject are for students to build upon their understanding of approaches to solving problems with computers, and to be able to demonstrate proficiency in designing and writing programs for symbolic computation using a functional programming language.

Topics covered include algorithmic problem solving; elements of functional programming, including lists and tuples, polymorphism, algebraic data types, higher order functions, monadic programming and symbolic computation; searching and sorting mechanisms for secondary memory devices; and systems software including compilers, interpreters, debuggers and profilers. Programming work will be undertaken in the languages C and Haskell (or an equivalent substitute).

• ability to apply knowledge of basic science and engineering fundamentals

• in-depth technical competence in at least one engineering discipline

• ability to undertake problem identification, formulation and solution

Laboratory work (expected to take about 30 hours) during semester, worth 10% of the final grade; a mid-semester test worth 15% of the final grade; and a written examination (not exceeding three hours) at the end of the semester, worth 75% of the final grade. Details of assessment components will be advised at the commencement of the subject; all components must be completed satisfactorily to pass the subject.