433-253 Algorithms and Data Structures

433-141 Computing Fundamentals A and 433-142 Computing Fundamentals B. Two subjects (25 points) of first year mathematics

Prior or concurrent enrolment in 433-252 Software Engineering Principles and Tools is strongly recommended

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; and graph representations and algorithms.

Project work (expected to take about 36 hours) during semester and one written examination (not exceeding 3 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.