Week of Monday |
Monday |
Tuesday |
Wednesday |
Thursday - Section |
Friday |
Jan 3 |
Introduction;
Stacks & Queues |
|
Intro |
||
Jan 10 |
Priority Queues |
|
Project 1: Sound
Blaster Phase A due Wed Jan 12, 11PM |
Big-O |
Homework 1 due
Jan 14, beginning of class Dictionaries;
Binary Search Trees |
Jan 17 |
Jan 17 - HOLIDAY |
Project 1: Sound
Blaster Phase B due Tues Jan 18, 11PM |
|
Homework 2 due Jan
21, beginning of class Memory Hierarchy, B Trees [memory slides, memory ink, orig BTree slides] |
|
Jan 24 |
More B Trees |
|
|
Homework 3 due
Jan 28, beginning of class |
|
Jan 31 |
Comparison
Sorting |
|
Project 2: Phase A due Wed Feb 2, 11PM Beyond Comparison
Sorting |
Midterm Review |
|
Feb 7 |
MIDTERM |
|
Topological Sort; Graph Traversals |
Midterms Returned & Discussed |
Homework 4 due
Feb 11, beginning of class |
Feb 14 |
Finish shortest
paths & Introduction to Multithreading and Fork-Join Parallelism |
Project 2: Phase B due Tues
Feb 15, 11PM |
Introduction to Multithreading and Fork-Join Parallelism (cont) |
|
Homework 5 due
Feb 18, beginning of class Analysis of Fork-Join
Parallel Programs |
Feb 21 |
Feb 21 - |
|
Parallel Prefix and
Parallel Sorting |
|
Homework 6 due
Feb 25, beginning of class Shared-Memory
Concurrency and Mutual Exclusion |
Feb 28 |
Programming with
Locks and Critical Sections |
Project 3: Code for version 1 & 2
due Tues March 1, 11PM |
Data Races &
Deadlock Grossman 7.2, 9 |
|
Homework 7 due
March 4, beginning of class Reader/Writer Locks
& Condition Variables |
Mar 7 |
Minimum Spanning Trees Course Wrap Up [slides] |
Project 3: ALL Code due Tues March 8,
11PM |
Parallelism/Concurrency
Practice “Quiz”
|
Project 3: Write-up due Thurs March
10, 11PM Final Review |
Homework 8 due
March 11, beginning of class Amortized Analysis
|
Mar 14 |
|
Final Exam: 2:30-4:20pm
Tuesday, March 15, 2011 |
|
|
|
|
Lecture slides borrow heavily from those used in previous offerings on cse 332 and cse 326, who in turn borrowed from previous offerings, etc. etc..