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 05 Jan 2018 12:00:00 AM AST

Unit 1: Divide and Conquer
Sun 07 Jan 2018 12:00:00 AM AST

Unit 2: Greedy Algorithms
Wed 31 Jan 2018 12:00:00 AM AST

Unit 3: Dynamic Programming
Fri 23 Feb 2018 12:00:00 AM AST

Unit 4: Multithreaded algorithms
Fri 16 Mar 2018 12:00:00 AM ADT

Unit 5: Backtracking and SAT
Wed 04 Apr 2018 12:00:00 AM ADT