| Quick Links | |
| What's
New
Home Contacts Course Book Java Book JDK & JDSL Slides Notes Demos Exercises Marks |
|
Here are some of my notes, in support of the course.
- Introduction. What are algorithms and data structures?
- Java for the course. 1st year and beyond.
- On Complexity. My notes to support chapter 2. and demo code to allow you to feel it.
- Dancing Links A paper by Donald Knuth on fun with doubly linked lists
- Implementing the Sequence class in java
- Using the Heap from Exercise 4, doing something usefull
- Using the SILGraph class, to build a simple graph.
- The 0-1 Knapsack problem
- The Travelling salesman Problem
- Notes on Single Source Shortest Path
- Notes on All Pairs Shortest Paths
- Notes on Minimum Spanning Tree (MST)
- Ian Gent's paper on One Dimensional Bin Packing
- Bryan Hayes page of CS articles