433-253 Algorithms and Data Structures

Credit Points

Coordinator

Prerequisites

433-141 Computing Fundamentals A and either 433-142 Computing Fundamentals B or 433-162 Introduction to Programming B. (From 2000, 433-142.) Two semesters of standard or advanced Science or Engineering first year mathematics.

Pre/corequisites

Prior or concurrent enrolment in 433-252 is strongly recommended

Semester

Contact

Subject Description

The objective of this subject is for students: to be familiar with a range of programming languages and their application to the efficient solution of problems by computer; to know a variety of techniques for solving sorting and searching problems and develop a basic understanding of graph algorithms; to develop experience with using complex algorithms and data structures in a variety of programming languages; to be able to perform basic complexity analyses of algorithms; and to acquire some knowledge of the concepts of computability, tractability and problem complexity.

Topics covered include: Complexity of algorithms and complexity classes. Abstract data types. Algorithms for sorting arrays, lists and files. Algorithms and data structures for searching: tree structures and hashing. Graph representations and algorithms.

Assessment

Project work (expected to take about 36 hours) during semester; and one written examination (not exceeding three hours) at the end of the semester. The project work must be completed satisfactorily to pass the subject. Weighting of assessment components will be advised at the commencement of the subject.