433-253 Algorithms and Data Structures

Note

When taken from School of Electrical Engineering and Computer Science, Faculty of Engineering: 14.2. When taken from Computer Science, Faculty of Science: 12.5

Credit Points

Coordinator

Prerequisites

433-141 and either 433-142 or 433-162. 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: Imperative, functional and logic programming languages. Complexity of algorithms and complexity classes. Abstract data types. Algorithms for sorting arrays, lists and files. Algorithms and data structures for searching: balanced trees, hashing, strings. Graph representations and algorithms. Numerical algorithms.

Assessment

One three-hour written examination at the end of the subject. Project work, which is expected to take about 40 hours must be completed satisfactorily to pass the subject. Weighting of assessment components will be made known at the commencement of the subject