Algorithms are precisely defined procedures designed to solve computational tasks: they are the life-blood of computing. This module is designed to highlight the importance of algorithms in Computer Science, providing you with an understanding of what algorithms are, how they can be specified and evaluated, and what they can be used for. These general ideas will be illustrated throughout by means of an in-depth study of a range of example algorithms which have played an important part in the development of Computer Science and underpin current computing practice. The prerequisite knowledge may be obtained from two first-year computer science and mathematics modules.



PRE-REQUISITE MODULES: ECM1400, ECM1414, ECM1416

In this module, you will build on the knowledge acquired in ECM1414 (Data Structures and Algorithms) with a more systematic exploration of a range of different types of algorithms and the principles of their design and analysis. A range of specific computational problems will be covered (e.g., operations on strings, graphs, and other data structures, numerical problems), and different algorithms for these problems analysed.

On successful completion of this module you should be able to:



Module Specific Skills and Knowledge

:

1. Appreciate the principles of algorithm design and implementation;



2. Analyse the time complexity of some important classes of algorithm;



3. Implement and analyse some fundamental algorithms.



Discipline Specific Skills and Knowledge

:

4. Apply programming skills to convert abstract specifications into practical realisations;



5. Demonstrate an analytical approach to computational problems;


6. Appreciate the importance of complexity considerations in the practical deployment of programs at different scales.

Personal and Key Transferable / Employment Skills and Knowledge:



7. Approach problem-solving tasks in a systematic and disciplined way.

- Introduction: What is an algorithm?;

- Specification and pseudo-code;

- Recapitulation of: correctness; algorithms versus heuristics; space and time complexity; iteration and recursion; NP-completeness;

- A study of specific algorithms, problems, and techniques selected from:

Google: PageRank, Internet routing algorithm, Linear programming, Simplex algorithm for optimization, Data compression, Kalman filter, Algorithms on graphs,

 

Fast Fourier transform,

 Public-key encryption, Monte Carlo integration.




Other examples as appropriate.


Reassessment will be by coursework and/or written exam in the failed or deferred element only. For referred candidates, the module mark will be capped at 40%. For deferred candidates, the module mark will be uncapped.

Basic reading:

ELE: http://vle.exeter.ac.uk/

Web based and Electronic Resources:

Other Resources:

Donald Knuth, Fundamental Algorithms (vols 1-3), Addison-Wesley

Reading list for this module: