Algorithms, CITS3210

Semester 1, 2006

Summary:

This unit is concerned with the design and analysis of algorithms. These concepts are introduced through the study of graph algorithms, searching algorithms, string processing algorithms, greedy and dynamic programming algorithms. Elementary analysis of the algorithms is performed and complexity classes of problems and approximation algorithms are described briefly.

Prerequisites:

Data Structures and Algorithms (CITS2200 or 230.223 before 2006)

Textbook:

"Introduction to Algorithms" Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, The MIT Press, 2nd edition (September 1, 2001), ISBN: 0-262-03293-7

Unit Coordinator:

Dr Tim French.

Links:

• Timetable

• Lectures

• Assessment (labs, tutes, project and exam)

• Unit outline

• Contact

• Discussion Forum