This is an easy module in which you can produce 100% if accurate. Know your bubble and shuttle sorts; your first-fit methods; show understandings of nodes, trees, cycles, etc; planar graphs (whether directed or undirected); use short-cuts where possible to improve upon an upper bound. Make sure you're familiar with the Simplex method and that dude Dijkstra's algorithm.
Bonne chance!