Back to the Home page
Advanced Data Structures
G64ADS: Advanced Data Structures
This module is part of the Foundations of Computer Science theme in the School of Computer Science. It will present efficiency of algorithms, Worst-case, best-case and average-case analyses, Big-Oh notation,
Recurrence relations and other supporting mathematics, Standard sorting algorithms, analyse their complexity, Review of standard data structures (lists, ordered binary trees, etc.) Advanced data structures (selection from red-black trees, 2-3 trees etc.)
Pointer manipulation, Amortized computations, Use of software libraries.
Lectures
Assessment
Exam (50%), 2 hr written examination
Coursework 1 (25%) Practical Assessment
Coursework 2 (25%) Report
Textbook
Data Structures and Algorithm Analysis in Java, Mark Allen Weiss, Pearson, 3rd edition 2012 (previous editions are also useful).
Further Reading
Robert Sedgewick, Algorithms in C, 3rd Edition, Addison Wesley, 1998
Robert Sedgewick, Algorithms in C++, 3rd Edition, Addison Wesley, 1998
Robert Sedgewick, Algorithms in Java, 3rd Edition, Addison Wesley, 2003
Lecture slides:
This file is maintained by Abdur Rakib
Last modified: 10-Sept-2012