### CS320 Progress Page

Green background is for past weeks, yellow background is this week, red background is for future weeks.

Week 1 : August 20 - August 26
Week 2 : August 27 - September 2
Week 3 : September 3 - September 9
Week 4 : September 10 - September 16
Week 5 : September 17 - September 23
Week 6 : September 24 - September 30
Week 7 : October 1 - October 7
• Mon
Worksheet: In class group worksheet on Greedy algorithms, and Solution KEY
Wed
Test 1 review
Fri
TEST 1
Topics up through greedy algorithms
You may bring one 8.5" x 11" paper with any notes you want to the exam. The paper must have your name on it, and you must turn it in along with your exam.
Week 8 : October 8 - October 14
Week 9 : October 15 - October 21
• Mon
Strongly-connected components
Wed
Worksheet: In class group worksheet on Searching and Sorting, due at the beginning of class Friday.
Slides: Micro-survey slides from questions on Monday.
Fri
Start Minimum Spanning Trees
Slides: Minimum Spanning Trees
Canvas Quiz: Graph algorithms Reading Quiz due Sunday Oct 22 at 11:59pm
Week 10 : October 22 - October 28
Week 11 : October 29 - November 4
• Mon
Worksheet: In class group worksheet on MST, due at the beginning of class Wed.
Wed
MST programming assignment, Single source shortest paths: Bellman-Ford, Dijkstra, difference constraints
Slides: Single Source Shortest Paths
Study Guide: Single shortest path notes
Fri
Single source shortest paths
Week 12 : November 5 - November 11
Week 13 : November 12 - November 18
• Mon
Test 2 review
Wed
TEST 2
Topics after Test 1 through all the graph algorithms we've done.
You may bring one 8.5" x 11" paper with any notes you want to the exam. The paper must have your name on it, and you must turn it in along with your exam.
Fri
Review Test 2
Shortest Path Programming Assignment discussion
Week 14 : November 19 - November 25
• Mon
Fall recess - no classes
Wed
Fall recess - no classes
Fri
Fall recess - no classes
Week 15 : November 26 - December 2
• Mon
NP-completeness, reductions
Reading: Cormen, chapter 34, section 5
Slides: P, NP, and NPC
Study Guide: Cole's NP Completeness notes
Wed
Closest pair of points
Reading: Cormen, chapter 33, section 4
Slides: Closest Pair of Points -- Contains Assignment 9 details
Fri
Closest Pair of Points
Assignment 9: Program 7 - Closest Pair of Points due date TUES 11:59 pm
Helper Info: Zip file containing sample input and output file, and Python3 functions to create input files and write output files.
Week 16 : December 3 - December 9
• Mon
Closest pair of points
Class Evaluation
UTA Evaluation: Please use this link to evaluate Jim Xu and Shannon McPherson
UTA Evaluation
Wed
Slides: Arbitrage
Helper Info: Zip file containing starter Python3 functions, Digraph object file, and functions to create input files.
If you are interested in Convex Hull:
Reading: Cormen, chapter 33, section 3
Slides: Convex Hull
Fri
Arbitrage
20 points Extra Credit: Assignment 10: Arbitrage due Saturday at 11:59pm