Unit information: Data Structures and Algorithms in 2009/10

Unit name	Data Structures and Algorithms
Unit code	COMS21103
Credit points	20
Level of study	I/5
Teaching block(s)	Teaching Block 1 (weeks 1 - 12)
Unit director	Dr. Page
Open unit status	Not open
Pre-requisites	COMS11700, COMS12400
Co-requisites	None
School/department	Department of Computer Science
Faculty	Faculty of Engineering

Description including Unit Aims

This unit aims to provide a solid foundation in the theory of computation, algorithms and data structures. Students will also build on these ideas by investigating practical implementation techniques that solve real-world problems. Assignments offer a practical way to explore theoretical aspects of the unit while solidifying basic programming skills in a variety of languages (including Java, C and Haskell).

Aims:

The unit aims to provide a solid foundation in the theory of computation, algorithms and data structures. Students will also build on these ideas by investigating practical implementation techniques that solve real-world problems. Assignments offer a practical way to explore theoretical aspects of the unit while solidifying basic programming skills in a variety of languages (including Java, C and Haskell).

Intended Learning Outcomes

On successful completion of this unit, students will be able to:

• Understand the foundations of the theory of computation.

• Analyse the efficiency and correctness of standard data structures and algorithms.

• Design and implement large and efficient software systems.

Teaching Information

36 hours of lectures. A further 164 hours are nominally set aside for coursework, private study and so on.

Assessment Information

Coursework 40% and a two hour examination 60%

Reading and References

• Cormen, Leiserson, Press/McGraw-HilI. 2001.

• J. Kleinberg and E. Tardos Algorithm Design Addison Wesley, 2005.

• S. Dasgupta, C.H. Papadimitriou and U.V. Vazirani. Algorithms McGraw-Hili, 2006.