Skip to main content

Unit information: Algorithms in 2019/20

Please note: It is possible that the information shown for future academic years may change due to developments in the relevant academic field. Optional unit availability varies depending on both staffing and student choice.

Unit name Algorithms
Unit code COMS10007
Credit points 10
Level of study C/4
Teaching block(s) Teaching Block 2 (weeks 13 - 24)
Unit director Dr. Houghton
Open unit status Not open
Pre-requisites

Imperative Programming, Functional Programming.

Co-requisites

None

School/department Department of Computer Science
Faculty Faculty of Engineering

Description

This unit provides an introduction to the design and analysis of algorithms. The aim is to introduce students to some basic algorithms and data structures, asymptotic notation, and solving recurrence equations.

Intended learning outcomes

Students should be able to understand asymptotic notation and give complexity bounds for simple algorithms.

Teaching details

Lectures, supported by tutorial sheets.

Up to 4 hours weekly: 2 hours of lectures, 2 hours labs

Assessment Details

100%exam

Reading and References

Introduction to Algorithms by Cormen, Leirerson, Rivest, Stein

Feedback