Calendar and Lecture Slides

CSE 332 - Winter 2011

Links to slides used in lecture.  (All future topics and dates subject to change.)

Week of Monday

Monday

Tuesday

Wednesday

Thursday - Section

Friday

Jan 3

Introduction; Stacks & Queues
[slides]
Weiss 3.1-3.7

 

Math Review; Algorithm Analysis
[slides, xls]
Weiss 1.1-1.6

Intro

Asymptotic Analysis
[slides, ink, xls]
Weiss 2.1-2.4

Jan 10

Priority Queues

[slides, ink]
Weiss 6.1-6.3

 

Project 1: Sound Blaster   Phase A due Wed Jan 12, 11PM

More Binary Heaps
[slides, ink]

Big-O

Homework 1   due Jan 14, beginning of class

Dictionaries; Binary Search Trees
[slides, ink]
Weiss 4.1-4.3

Jan 17

Jan 17 - HOLIDAY
Martin Luther King Day

Project 1: Sound Blaster   Phase B due Tues Jan 18, 11PM

 

AVL Trees
[
slides, ink, Ex1, Ex2, Ex3]
Weiss 4.4

 

Homework 2   due Jan 21, beginning of class

Memory Hierarchy, B Trees 

[memory slides, memory ink, orig BTree slides]
Weiss 4.7

Jan 24

More B Trees

[slides, ink, Examples]

 

Hashing
[slides, ink]
Weiss 5.1-5.5

 

Homework 3   due Jan 28, beginning of class

Hashing II
[slides, ink]

Jan 31

Comparison Sorting 
[slides, ink]
Weiss 7.1-7.3, 7.5, 7.6-7.8

 

 

Project 2:  Phase A due Wed Feb 2, 11PM

Beyond Comparison Sorting
[slides, ink, Radix Example
Weiss 7.9-7.10

Midterm Review

Introduction to Graphs
[slides, ink]
Weiss 9.1 

Feb 7

MIDTERM

 

Topological Sort; Graph Traversals

[slides, ink]
Weiss 9.2 

Midterms Returned & Discussed

Homework 4   due Feb 11, beginning of class

Shortest Paths
[slides, ink]
Weiss 9.3 

Feb 14

Finish shortest paths & Introduction to Multithreading and Fork-Join Parallelism
[slides, ink]  
Grossman 2.1-3.4

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
[slides, ink]  
Grossman 3.5-4.3

Feb 21

Feb 21 - HOLIDAY
Presidents Day

 

Parallel Prefix and Parallel Sorting
[slides, ink]
Grossman 5.1-5.4

 

Homework 6   due Feb 25, beginning of class

Shared-Memory Concurrency and Mutual Exclusion
[slides, ink]
Grossman 6

Feb 28

Programming with Locks and Critical Sections
[slides, ink]
Grossman 7.1, 8

Project 3: 

Code for version 1 & 2 due Tues March 1, 11PM

 

Data Races & Deadlock
[slides, ink]

Grossman 7.2, 9

 

Homework 7   due March 4, beginning of class

Reader/Writer Locks & Condition Variables
Grossman 10
Minimum Spanning Trees
[slides, ink]
Weiss 9.5

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
[Slides]

Mar 14

 

Final Exam: 2:30-4:20pm Tuesday, March 15, 2011

 

 

 

 

 

CREDITS

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..