CS 360: CS360 Course Schedule - Spring 2019

This page provides a tentative schedule for the course.

All reading materials are from the course textbook:

Introduction to Algorithms - 3rd ed. (CLRS)

Date	Lecture Topics	Reading
Jan 23	Lecture 1: Intro to Algorithms Card Sorting App	Ch. 1
Jan 25,28	Lecture 2: Insertion Sort	Ch. 2.1-2.2
Jan 30	Lecture 3: Asymptotic Notation	Ch. 3
Feb 1	Lecture 4: Merge Sort	Ch. 2.3
Feb 4	Lecture 5: Master Theorem Assignment 1 Due 2/4	Ch. 4.5
Feb 6	Lecture 6: Recurrence	Ch. 4.3-4.4
Feb 8,11	Lecture 7: Heapsort Assignment 2 Due 2/11	Ch. 6
Feb 13	EXAM I - Due Feb 18
Feb 15	Lecture 8: Quicksort	Ch. 7
Feb 18,20	Lecture 9: Linear Sorting	Ch. 8
Feb 22,25	Lecture 10: Probabilistic Analysis Assignment 3 Due 2/25	Ch. 5
Feb 27	Lecture 11: Hash Tables	Ch. 11
Mar 1	Assignment 4 Due 3/1
Mar 4,6,8	NO CLASS - WINTER BREAK
Mar 11	Lecture 12: Dynamic Programming - Rod Cutting	Ch. 15
Mar 13	Exam II Review
Mar 15	EXAM II - Due Mar 20
Mar 18	Lecture 12: Dynamic Programming - Rod Cutting	Ch. 15
Mar 20	Lecture 13: Dynamic Programming - LCS	Ch. 15
Mar 22	Lecture 13: Dynamic Programming - LCS cont. LCS Practice Activity LCS Solution Updated Empirical Comparison Report Due 3/22	Ch. 15
Mar 25	Lecture 14: Greedy Algorithms - Activity Selection	Ch. 16
Mar 27	Lecture 15: Graph Theory Assignment 5 Due 3/27	Appendix B.4
Mar 29	Lecture 16: Breadth-First Search BFS Practice Activity BFS Solution	Ch. 22.2
Apr 1	Lecture 17: Depth-First Search DFS Practice Activity DFS Solution	Ch. 22.3
Apr 3	Lecture 18: DFS Applications Topological Sort Practice Activity Top Sort Solution SCCD Practice Activity SCCD Solution Assignment 6 Due 4/3	Ch. 22.4-22.5
Apr 5	Lecture 19: Minimum Spanning Trees - Kruskal Kruskal Practice Activity Kruskal Solution	Ch. 23.1
Apr 8	Lecture 20: Minimum Spanning Trees - Prim Prim Practice Activity Prim Solution Assignment 7 Due 4/8	Ch. 23.2
Apr 10	Exam III - Due Apr 17
Apr 12	Lecture 21: Shortest Path - Bellman-Ford	Ch. 24.1-24.2
Apr 15	Lecture 22: Shortest Path - Dijkstra SSSP Practice Activity SSSP Solution	Ch. 24.3
Apr 15	Lecture 23: Shortest Path - Floyd-Warshall	Ch. 25
Apr 17	Lecture 24: Maximal Flow	Ch. 26.1
Apr 19,22	NO CLASS - SPRING BREAK
Apr 24	Lecture 25: Maximal Flow- Ford-Fulkerson Max Flow Practice Activity Max Flow Solution Assignment 8 Due 4/24	Ch. 26.2
Apr 26	Lecture 26: NP Completeness	Ch. 34.1-34.3
Apr 29	Lecture 27: NP Complete Problems Lecture 28: More NP Complete Problems	Ch. 34.4
May 1	Exam IV Review Assignment 9 Due 5/1
May 3	Exam IV - Due May 8
May 6	Lecture 29: Approximation Algorithms	Ch. 35.1-35.2
May 13,15	Final Project Presentations