| 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, COMS11600 |
| Co-requisites |
None |
| School/department | Department of Computer Science |
| Faculty | Faculty of Engineering |
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.
On successful completion of this unit, students will be able to:
36 hours of lectures. A further 164 hours are nominally set aside for coursework, private study and so on.
Coursework 40% and a two hour examination 60%
The library holds roughly 12 copies of the recommended textbook CLRS and 2 copies of the background textbooks; other material can be found online. J. Kleinberg and E. Tardos Algorithm Design Addison Wesley, 2005. ISBN: 0-321-29535-8 Background S. Dasgupta, C.H. Papadimitriou and U.V. Vazirani. Algorithms McGraw-Hill, 2006. ISBN: 0-073-52340-2 Background
