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

On this page, you will find slides and other materials presented in class

You can browse the examples directly or by tags.

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
Fri 09 Sep 2016 12:00:00 AM ADT

Unit 1: Divide and Conquer
Fri 16 Sep 2016 12:00:00 AM ADT

Unit 2: Greedy Algorithms
Sun 16 Oct 2016 12:00:00 AM ADT

Unit 3: Dynamic Programming
Sun 06 Nov 2016 12:00:00 AM ADT

Unit 4: Multithreaded algorithms
Fri 25 Nov 2016 12:00:00 AM AST

Unit 5: Backtracking and SAT
Thu 01 Dec 2016 12:00:00 AM AST