David Rydeheard and Graham Gough
Last updated: 14 November 2000
This web version of the lab description may contain material not in the original paper version. Any such differences will be highlighted.There will be 5 laboratory sessions of 2 hours each for this course.
The exercises will involve the invention of algorithms for given computational tasks. Your algorithms should, of course, be correct - do what they are designed for - but, in addition, you should consider efficiency of algorithms - how well they perform on various inputs. You will be asked to represent data structures in programming languages and use data abstraction as a program design and structuring tool.
The exercises involve the implementation of algorithms and data structures either in C or in SML. You should have your first year material on these languages to hand so that you are prepared to use them in the exercises.
For all the exercises you should prepare the material (algorithms, data structures and outline code) before the laboratory session. If not, you will be wasting your own time and your laboratory session, and you are likely to miss deadlines.
Labs exercises 1-3 are each worth 10 marks, exercise 4 is worth 20 marks.