306720 (v.1) Design and Analysis of Algorithms 551

Area:

Department of Computing

Credits:

25.0

Contact Hours:

3.0

Lecture:

1 x 2 Hours Weekly

Practical:

1 x 1 Hours Weekly

Prerequisite(s):

5396 (v.7) Software Technology 502 or any previous version

Syllabus:

A solid foundation for further study in computing through the application and knowledge of basic science and engineering fundamentals. Problem identification, formulation and solution. Identification of efficient algorithms and ability to solve problems. Construction and analysis of algorithms to determine resource requirements.

Unit Outcomes:

The ability to apply knowledge of basic science and engineering fundamentals. The ability to undertake problem identification, formulation, and solution. Expectation of the need to undertake lifelong learning and the capacity to do so. In-depth technicalknowledge in Computer Science.

Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information.

Unit References:

S. Sahni, Data Structures, Algorithms, and Applications in Java, McGraw-Hill.

Unit Texts:

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, 2nd edition, MIT-Press.

Unit Assessment Breakdown:

Final examination 55%, Tests (3) 45%. This is by grade/mark assessment.

Year	Location	Period	Internal	Area External	Central External
2004	Bentley Campus	Semester 1	Y