video1.0<iframe src="https://www.loom.com/embed/3c44434415374e0082c2b6a26df22ce1" frameborder="0" width="1898" height="1423" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>14231898Loomhttps://www.loom.com14231898https://cdn.loom.com/sessions/thumbnails/3c44434415374e0082c2b6a26df22ce1-265a8b78f47bdf39.gif8198.581This Loom reviews worked solutions across several exam-style discrete mathematics and optimization questions, focusing most on completing a Hamiltonian cycle and testing planarity. It shows how to complete the Hamiltonian cycle, then applies a planarity algorithm by arranging the cycle on a regular polygon, listing remaining edges, and using the inside and outside crossing argument to conclude the graph is non-planar. It then demonstrates two iterations of Floyd’s algorithm using given time and route matrices, explains early and late times and critical activities in a scheduling network with a minimum project completion time of 26, and walks through constructing resource histograms. Finally, it covers Prim’s algorithm for a minimum spanning tree starting at A, uses nearest neighbour for a traveling salesperson route starting at B, and outlines a Chinese postman style approach for a route from E to I.