MA2C03 - Discrete Mathematics Further Resources for MA2C03 in Hilary Term 2016 Dr. David R. Wilkins

Videos on the Internet

Videos concerning Graph Algorithms

Kruskal's Algorithm in 2 minutes - Review and Example (Michael Sambol)

A short video on YouTube containing a simple example of the application of Kruskal's algorithm.

Prim's Algorithm in 2 minutes - Review and Example (Michael Sambol)

A short video on YouTube containing a simple example of the application of Prim's algorithm.

Lecture Slides on the Internet

Lecture Slides on Computational Intractability

Lecture #3: Parallel and Distributed Real-Time Systems, Chalmers/GU,2011/2012

An introduction to the concept of NP completeness that begins by following closely the discussion of the Bandersnatch Problem in the first chapter of Computers and Intractability by Garey and Johnson.

Lecture Slides concerning Graph Algorithms

CS2012 Programming Techniques II, Lecture 24 (Vasileios Koutavas, TCD, Hilary Term 2014)

This lecture, from TCD module CS2012, as taught in 2014 by Prof. Vasileios Koutavas, discusses graph algorithms, and includes Kruskal's Algorithm and Prim's Algorithm.

Lecture 7: Minimum Spanning Trees and Prim's Algorithm (Dekai Wu, Department of Computer Science, The Hong Kong University of Science and Technology)

This lecture is from the lecture course COMP 271 Design and Analysis of Algorithms, taught by Professor Dekai Wu at Hong Kong Institute of Science and Technology in Spring Term 2005.

Lecture 8: Kruskal's MST Algorithm (Dekai Wu, Department of Computer Science, The Hong Kong University of Science and Technology)

This lecture is from the lecture course COMP 271 Design and Analysis of Algorithms, taught by Professor Dekai Wu at Hong Kong Institute of Science and Technology in Spring Term 2005.

MA2C03 Lectures, Hilary Term 2016
Module webpage: MA2C03
Lecture notes for undergraduate courses