MATH20902 Online Course Materials
Coursework Marks
You can download a list of results from this year's coursework arranged in order of student ID. These results, which contribute 20% to your final mark for the module, were marked on a 20 point scale.Lecture Notes & Slides
In addition to the notes below, which will not cover all the lectures, I urge you to have a look at the online versions of Dieter Jungnickel's excellent book, Graphs, Networks and Algorithms. I wrote the course while studying a copy of the 2nd edition, but you might also like to look at the 3rd edition, which appeared in 2008. The links above will only work if you are within the University's network. If you are off campus, you can install software that will allow you to access the book through the University's excellent Virtual Private Network (VPN).
There are two sorts of links in the list below. The blue ones lead to essentially complete lecture notes (some of which are set out as chapters in a book and others of which are like a set of PowerPoint slides), while the ones link to slide shows that summarise the main results and diagrams from a lecture, but skip details and some proofs.
- Notes: Two simple algorithms (Weds. 30 & Thurs. 31 Jan.)
- Notes: Simple continued fractions & Euclid's algorithm(Thurs. 31 Jan & Weds. 6 Feb.)
- Slides: Euclid's algorithm and SCF1 (Thurs. 7 Feb.)
- Notes: Simple continued fractions & rationals (Thurs. 7 Feb.)
- Slides: Summary of results for a bound on Euclid's algorithm (Weds. 13 Feb. & Thurs. 14 Feb.)
- Notes: Infinite simple continued fractions (Weds. 13 Feb. & Thurs. 14 Feb.)
- Slides: Summary of results about infinite SCFs (Thurs. 14 Feb.)
- Notes: First steps in Graph Theory (Thurs. 21 & Weds. 27 Feb.)
- Slides: Walks, Trails and Paths (Thurs. 28 Feb.)
- Slides: Results About Trees (Weds. 6 & Thurs. 7 March)
- Slides: Eulerian multigraphs (Weds. 13 & Thurs. 14 March)
- Slides: Graph closure and the Bondy-Chvátal Theorem (Thurs. 14 & Weds. 20 March)
- Slides: Distances in Graphs (Thurs. 21 March)
- Slides: Breadth First Search (BFS) (Thurs. 21 March)
- Slides: Weak connectedness, DAGs and topological ordering (Weds. 17 April)
- Slides: Scheduling & Critical Paths (Weds. 17 April)
- Notes (as a slide show): Planar Graphs (Weds. 24 and Thurs. 25 April)
- Notes: Graph colouring & chromatic number (Weds. 1 May)
- Slides: Summary of graph colouring (Weds. 1 May)
- Slides: Ingredients for the 5 colour theorem (Thurs. 2 May)
Problem Sets & Solutions
| There will be problem sets every week or so: I'll post the solutions at the same time as the problems. | ||
| Problems | Solutions | |
Coursework & Exams
Coursework
|
Exams |