Scribd
Upload
54 views2 pages

CS 312 Schedule Fall 2008

This document provides the tentative schedule for a CS 312 class in the fall of 2008. It lists the topics to be covered each class day from September to December, along with assigned readings, homework and lab assignments, and exam dates. The course will cover topics such as algorithm analysis, difference equations, the fast Fourier transform, cryptography, randomized algorithms, shortest paths, and dynamic programming. There will be two midterm exams and a final exam.

Uploaded by

Jeff Pratt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
54 views2 pages

CS 312 Schedule Fall 2008

This document provides the tentative schedule for a CS 312 class in the fall of 2008. It lists the topics to be covered each class day from September to December, along with assigned readings, homework and lab assignments, and exam dates. The course will cover topics such as algorithm analysis, difference equations, the fast Fourier transform, cryptography, randomized algorithms, shortest paths, and dynamic programming. There will be two midterm exams and a final exam.

Uploaded by

Jeff Pratt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 312 Tentative Schedule, Fall 2008

Day Topic Reading Assigned Due


T 9/2 Problems and Solutions The Turing Omnibus,
Chapter 30
Dynamic Systems,
Chapter 1, 2.1-2.3
TH 9/4 Algorithm Analysis Algorithms, HW1, LAB1
Chapter 0
Dynamic Systems,
Chapter 2.4-2.7
F 9/5 Honors Lunch
F 9/5 Recitation: C# and Visual Studio
T 9/9 Difference Equations
TH 9/11 Solving Difference Eqns Algorithms, HW2 HW1
Chapter 2.1-2.5
F 9/12 Recitation: Difference Equation Practice
T 9/16 Master Theorem
TH 9/18 Average Case Analysis Algorithms, HW3, LAB2 HW2
Chapter 2.6
F 9/19 Recitation: More Difference Equation Practice
T 9/23 Signal Processing
TH 9/25 FFT Algorithms, HW4 HW3, LAB1
Chapter 1.1-1.4
F 9/26 Recitation: Elementary Probability Theory Practice
T 9/30 Cryptography
TH 10/2 Randomized Algorithms Algorithms, HW5, LAB3 HW4
Chapter 1.5
F 10/3 Honors Lunch
T 10/7 Randomized Algorithms
TH 10/9 Page Rank Algorithms, HW6 HW5, LAB2
Chapters 3,4
F 10/10 Recitation: Midterm Review
T 10/14 Shortest Paths
TH 10/16 Minimum Spanning Trees Algorithms, HW7 HW6
Chapter 5

TH-S 10/16- Midterm 1 Covers material through 10/7 Testing Center


10/18

T 10/21 Knapsack
TH 10/23 Huffman Codes Algorithms, HW8, LAB4 HW7, LAB3
Chapter 6
F 10/24 Recitation: Data Structures and Complexity
T 10/28 Dynamic Programming
TH 10/30 Computational Biology Dyn Prog, HW9 HW8
F 10/31 Recitation: Data Structures and Dynamic Programming
Chapter 1
T 11/4 Sequential Decision Making
TH 11/6 Inventory Management Dyn Prog, HW10 HW9
Chapter 2
F 11/7 Honors Lunch
T 11/11 TSP
TH 11/13 Linear Programming Algorithms, HW11, LAB5 HW10, LAB4
Chapter 7
F 11/14 Recitation: Midterm Review
T 11/18 Simplex
TH 11/20 Linear Regression Algorithms, HW12 HW11
Chapter 8

TH-S 11/20- Midterm 2 Covers material through 11/11 Testing Center


11/22

T 12/2 NP-Complete Problems


TH 12/4 Backtracking Algorithms, HW13 HW12
Chapter 9
F 12/5 Honors Lunch
T 12/9 Branch-and-Bound
TH 12/11 Examples HW13, LAB5
F 12/12 Recitation: Final Exam Review

M 12/15 Final Exam (Section 2) Comprehensive 11:00am-2:00pm In Class


W 12/17 Final Exam (Section 1) Comprehensive 7:00am-10:00am In Class
F 12/19 Final Presentations (Honors) 9:00am-12:00pm CS Conference Room

You might also like