UNB/ CS/ David Bremner/ teaching/ cs3383/ CS3383 Lectures

There will be short pre-recorded videos for some of the lecture material. For best results these are best watched before the lecture, so check here before the lectures. Slides will also be posted here.

DAG SAT asymptotics backtracking cs3383 lecture divide and conquer dynamic multithreaded dynamic programming fork-join greedy horn-clause huffman longest common subsequence memoization mst opencourseware shortest path topological sort

Unit 0: Asymptotics

Unit 1: Divide and Conquer

Unit 2: Greedy Algorithms

Unit 3: Dynamic Programming

Unit 4: Multithreaded algorithms

Unit 5: Combinatorial Search