CS3230 - Design analysis of algorithms

Lectures

Lecture 1 - Intro

Lecture 2 - Recursion

Lecture 3/4 - Dynamic programming and backtracking

Lecture 5 - Greedy algo

Lecture 6 - linear sort

Lecture 7 - APSP, Matrix multiplication

Lecture 8 - Randomised ALgorthims

Lecture 9 - NP hardness

Lecture 10 - More NP hardness

Lecture 11 - Amortized algo

Tutorials

Tutorial 1 - recurrance

Tutorial 2 - Assignment 1/ DP

Tutorial 3 - Assignment 2

Tutorial 6 - Greedy Algorithm

Tutorial 7 - Assignment 3 and Graph Theory

Tutorial 8 - Assignment 4 and introduction to randomised algo

Tutorial 9 - Randomise algo

Tutorial 10 - NP hardness

Tutorial 11 - More on NP hardness

Tutorial 12 - Amortised Algo (Not tested)

Assignments

Assignment 1 - Week 1/2

Assignement 2 - Week 3/4

Assignement 3 - Week 5/6

{Assingment 4 is in tutorial}

Assignemnt 5 - Week 8