Skip to main content

Unit information: Data Structures and Algorithms in 2017/18

Please note: you are viewing unit and programme information for a past academic year. Please see the current academic year for up to date information.

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. Clifford
Open unit status Not open
Pre-requisites

COMS11700, COMS10006, COMS10008

Co-requisites

None

School/department Department of Computer Science
Faculty Faculty of Engineering

Description

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.

Intended learning outcomes

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

  • Understand the foundations of the theory of computation, asymptotic analysis and correctness of algorithms
  • Analyse the efficiency and correctness of standard data structures and algorithms.
  • Design and implement efficient algorithms to solve a variety of standard problems.

Teaching details

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

Assessment Details

3 hour examination = 100%

Reading and References

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

Feedback