Saint Louis University 
Computer Science 3100

Dept. of Computer Science 
Please make sure you understand the policy towards Academic Integrity.
No late assignments will be accepted.
The table below gives the assignments, and associated dates. All future dates/topics are tentative until such assignments are made available. Please note that there is a somewhat unusual numbering system for problems from the textbook. The book has what it terms "Exercises" that are at the end of each section, and "Problems" that are at the very end of each chapter. For example, Exercise 3.11 is at the end of Section 3.1 on page 52, whereas Problem 31 is at the end of Chapter 3, on page 61.
Assignment  Topic  Due in Class  Solutions 

hw1  Introduction, Fundamental Data Structures, Divide and Conquer  10:00am, Wednesday, September 7, 2016  soln 
hw2  Closest Pair  10:00am, Monday, September 26, 2016  soln 
hw3  Dynamic Programming and Greedy Algorithms  10:00am, Monday, October 10, 2016  soln 
hw4  Minimum Spanning Trees and Shortests Paths  Tuesday, November 8, 2016 (by appointment)  soln 
hw5  Network Flow Applications  10:00am, Friday, December 2, 2016 