Data Structures and Algorithms
Course Management
Workshops
Before starting on the assignment exercises, it's worthwhile to consider the
design of experiments
first.
1999 Workshops
Lab Schedule 1999
There is
no
assignment 2.
Assignments 3 & 4 - 1999
Submission instructions
1998 Workshops
You might find that browsing through previous years' workshops and the feedback notes helps you to determine what is expected!
Workshop/Assignment 1 - 1998
Workshop/Assignment 2 - 1998
Assignments 3 & 4 - 1998
1997 Workshops
Workshop 1 - Collections
Workshop 2 - Searching
Workshop 3 - QuickSort vs RadixSort
Workshop 4 - Red-Black Trees
1996 Workshops
Workshop 1 - Collections
Workshop 1 - Feedback
Workshop 2 - Searching
Workshop 2 - Feedback
Workshop 3 - Minimum Spanning Trees
Workshop 3 - Feedback
Workshop 4 - Minimum Spanning Trees
Workshop 4 - Feedback
Past Exams
1997
Tutorial Exercises
Arrays or Linked Lists? Overheads, Complexity
Asymptotic behaviour, ADT Design
Sheet 3
B+ trees
stable sorting,
a puzzle,
AVL trees,
dynamic memory allocation,
equivalence classes
Sheet 4
Heap Sort,
Quick Sort,
Radix Sort,
Hash Tables,
Search Trees
Sheet 5
MST,
Sheet 6
Hard problems
Back to the
Table of Contents
©
John Morris
, 1998