Notes For Lecture 2

Day	Problems	Code	Input Output	Written Notes
1/8/2018		Farmer Problem (Clean)	Farmer's Output	Useful links 4 Queens picture
1/10/2018 (lab)		Cold Computer Cold Computer 2	Cold Computer Sample Input 2 Cold Computer Sample Output 2
1/10/2018		Binairo	Binairo Input Binairo Output	Sudoku Description Binairo Description
1/17/2018		Add All (PriorityQueue) Problem Count (HashSets) Problem Count (HashMaps) Rank List (Custom Comparator) Testing ArrayDeques	Add All Input Add All Output Problem Count Small Input Problem Count Big Input Rank List Input	Java API notes
1/22/2018				Big Oh Notes Big Omega and Theta Notes Binary Search Analysis Disjoint Sets P1 Notes
1/24/2018		Disjoint Set Test		Minimum Spanning Tree Red-Black Tree
1/29/2018				Prim's Proof and Graph Terms Red-Black Tree Insertion 2-4 Trees Intro
1/31/2018		R-B tree (Insertion Deletion Graphic) (WARNING: lots of file generation)		Red-Black Tree Deletion 2-4 Tree Insertion Skip Lists Intro
2/05/2018				Skip List Deletion Quick Sort Comparison Sort Bound
02/07/2018		Skips Lists (w/o deletion) (WARNING: lots of file generation)		Radix Sort Bucket Sort Counting Sort
02/12/2018				RB review Big O review Example Code Analysis
02/19/2018	Robot (SEERC 2017)	Robot Solution	Robot Cases Robot Batch File	Exam Recap Algorithm Techniques and Greedy Intro
02/21/2018		Room Sched Program	Room Sched Input 1 Room Sched Output 1	Greedy examples Graph Intro
02/26/2018				Directed Graph Terms Graph Searching Methods Uses for Graph Searching (Topo Sort 1)
02/28/2018		Graph things and Topo Sort	CS Courses Graph	Topological Sorting 2 Dijkstra's Introduction
03/05/2018		Dijkstra's Algorithm	Distances for Dijkstra's Example	BFS applications Dijkstra explanation
03/07/2018				Max Flow FFA and Proof Max Flow Application sample
03/19/2018	Practice Exam Questions			Written Part of Answers Typed Part of Answers
03/26/2018		Subset Sum Code (DnC)	Bad BF Input for Subset Sum	Notes for Divide and Conquer
03/28/2018		Subset Sum Code (DP) Longest Common Subsequence (DP)	Bad DNC Input for Subset Sum Bad DP Input for Subset Sum	Notes for Dynamic Programming
04/02/20218		LCS (Bottom Up DP) Fibonacci Floyd's Example		Dynamic Programming Bottom Up
04/04/20218		0-1 Knapsack (Not Memory Efficient)		Dynamic Programming Change 2 0-1 Knapsack
04/09/20218		Matrix Chain DP 0-1 Knapsack With Space Saving Unbounded Knapsack Problem	MCM input 1 MCM input 2	MCM Notes Space Saving
04/11/20218				More Flow Uses
04/16/20218				Tracing DP Problems Bounded Knapsack Solution
04/18/20218				Leftover Topics
04/23/20218	Practice Final Exam Problems			Solution 17 Practice Final Exam Solutions Things to Study!