Course Home | Assignments | Peer Assessment Procedures | Schedule & Lecture Notes

Saint Louis University

Computer Science 314

Michael Goldwasser

Fall 2014

Dept. of Math & 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.1-1 is at the end of Section 3.1 on page 52, whereas Problem 3-1 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, Monday, September 8, 2014 instructor's
hw2 Asymptotics, Dynamic Programming 10:00am, Monday, September 22, 2014 instructor's
hw3 Dynamic Programming, Greedy Algorithms 10:00am, Monday, October 6, 2014 instructor's
midterm Various 10:00am, Wednesday, 22 October, 2014 instructor's
hw4 Amortization, Graph Algorithms 10:00am, Monday, 3 November, 2014 instructor's
hw5 MST, Shortest Paths 10:00am, Monday, 17 November, 2014 instructor's
hw6 Network Flow 10:00am, Monday, 1 December, 2014 instructor's

Procedures for Submitting Homework

Please carefully read the following:

When submitting a homework, it is important that the following procedures be strictly followed.

Michael Goldwasser ©2014
CSCI 314, Fall 2014
Last modified: Thursday, 04 December 2014
Course Home | Assignments | Peer Assessment Procedures | Schedule & Lecture Notes