. |

- understanding the simple mathematics that underlies the theory of complexity
- the time and space complexity of algorithms
- order notation
- the
*best*,*worst*and*average*behaviour of algorithms - derivation of the performance algorithms
- implementation of algorithms
- comparison of theoretical and actual run times
- correctness of programs

In almost every practical the student is expected to implement some algorithms and run timing experiments to gain an understanding of their performance as measured on the size of the input data.

The time and space complexity of the algorithms are emphasized so that the student attains a proper grasp of the efficiency of algorithms.

The student should on successful completion of the course

- calculate the asymptotic bounds for algorithms;
- implement algorithms for manipulating data structures to execute efficiently on computing machinery;
- run timing experiments to compare the performance of algorithms in practice with their theoretical complexity and
- reproduce algorithms and answer theoretical questions about them under examination conditions.

Since all the documentation is available in PostScript and PDF
you might want to adapt your net reader for reading PostScript, or
PDF otherwise
you can download the notes and then read the PostScript with *gv*(GhostView)
or KGostview, or read the PDF files with *Acroread*.

If you are inside the SunLab then the most up to date version of the
notes is always available on `zaber` and `boulder` at
`/home/export/notes/ds/ds-slides.ps` or
`/home/export/notes/ds/ds-slides.pdf`. Since your home directory is
at `/home/export/` these files can be reached from your `home`
directory as `../../ds-slides.ps` or `../../ds-slides.pdf`.

Robert Sedgewick and Kevin Wayne

(2011) Addison-Wesley

An excellent book.
Since this book is newly prescribed in 2017
second-hand copies are unlikely to be available.

4th Edition

Michael T. Goodrich

(2004) John Wiley and Sons. Inc.

A very good book.
Since this book was prescribed in 2003, 2004, 2005, 2006, 2008 there should
be second-hand copies available.

Second Edition

Adam Drozdek

(2005) Thomson Learning

Roger Garside and John Marian

(2003) Thomson Brooks/Cole.

Leen Ammeraal

(2000) Wiley.

PostScript overheads for lectures

If you are inside the SunLab then use
the notes at `zaber`, `boulder` or `breakpoint`

at
`/home/export/notes/ds/ds-slides.ps` or at
`/home/export/notes/ds/4up-ds-slides.ps` or

ds-slides.ps (A4 format) and

4up-ds-slides.ps (4 per page)

PDF overheads for lectures

If you are inside the SunLab then use
the notes at `zaber`, `boulder` or `breakpoint`

at
`/home/export/notes/ds/ds-slides.pdf`. or at
`/home/export/notes/ds/4up-ds-slides.pdf`.

ds-slides.pdf (A4 format) and

4up-ds-slides.pdf (4 per page)

Practical 1 Term 1—5 February 2008 (A4 format PDF).

Practical 2 Term 1—12 February 2008 (A4 format PDF).

The latest version of all the material here is always available on zaber
in `~/../../notes/toc/.`

. |

*4 May 2017*