Algorithms and Data Structures
- Algorithms and Data Structures
- Credits: 2 Points
- Taught: Second semester 2004, three lectures a week.
Timetable: Tuesday, Thursday, Friday: 5.00-6.00 pm, LLT (Lower Lecture Theatre).
- Short Description:
This course extends the algorithm and data structure material taught at stage 1,
and examines practical and theoretical aspects of program performance.
- Techniques for measuring program performance, tradeoffs between time and space,
introduction to complexity analysis (the "Big-Oh" notation).
- A study of searching and sorting algorithms.
- Graph data structures and algorithms.
- Automata theory and pattern matching. Context-free grammars and parsing. Turing machines and computability.
- Textbook: M.J. Dinneen, G. Gimel'farb, M.C. Wilson.
Introduction to Algorithms, Data Structures and Formal Languages,
Pearson, Albany, NZ 2004.
current list of errors for the textbook is maintained by Mark Wilson.
New reportings will earn you a small bonus for your course grade.
- Handouts: Cris' slightly edited version of Georgy
- Other relevant sites: