CA313 module

Algorithms and Complexity

Overview

WeekTopic
1Introduction
2Heaps and Big Oh
3Complexity Classes
4Heuristics: Genetic Algorithms
5Heuristics: Hill Climbing and Simulated Annealing
Dynamic Programming
6Dynamic Programming: Longest Common Subsequence Problem
7Assignment discussion, Brute Force, Pruning/ Branch and Bound
8Satisfiability, reductions. Huffman encoding.
9Graphs, Minimum Spanning Tree, Kruskal's Algorithm, Union Find
10Snow
11Halting Problem
12Revision

Resources