CS2004 - Algorithms

Nav

Home University Year 2

Where the notes went

The concepts from this module now live under Computer Science with the rest of the knowledge. The lecture order below is kept as a record of the syllabus — the links still work.

Lecturer: Mahir Arzoky

60% Coursework -> Due on Friday, Week 21.

40% Exam -> Available on Week 23.

Lectures

• Introduction
• Foundation Analysis - (Lecture 2)
• time-complexity - (Lecture 4)
• Asymptotic Notation - (Lecture 4)
• Data Structures and Applications - (Lecture 5)
• sorting - (Lecture 6)
• Graph Traversal - (Lecture 7)
  • Depth-First Search
  • exhaustive-search
  • Breath-First Search
  • Best-First Search - A* Search
  • Minimum Spanning Tree (MST) - Prim’s
  • Dijkstra’s Algorithm - (Lecture 8)
• search-and-fitness - (Lecture 9)
• Heuristic Search and Simulated Annealing - (Lecture 10)
• Introduction to Genetic Algorithms - (Lecture 11)
• Evolutionary Computation - (Lecture 12)
• Ant Colony Optimisation and Particle Swarm Optimisation - (Lecture 13)

References

• Classes, Types, and Objects
• big-o-notation
• sets-and-maps
• trees