Calendar and Lecture Slides
CSE 373 - Spring 2009

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

Week of

Monday

Wednesday

Thursday

Friday

Reading

March 30

Introduction

Stacks and Queues & Math Review

 

Math Review
(no new slides)

Chapters
1, 2 & 3

April 6

Asymptotic Analysis I

Asymptotic Analysis II
(no new slides)

 

Dictionaries & Trees

HW 1 due
(11:45pm)

Chapter 4
(4.1, 4.2, 4.3)

April 13

Trees
(no new slides)

Hashing I

 

HW 2 due at the beginning of lecture

Hashing II
(no new slides)

Chapter 4 & Chapter 5 (5.1-5.6)

April 20

AVL Trees

Review
(Double Hashing Example)

 

MIDTERM I
(April 24)

Section 4.4

April 27

AVL Tree Review
(AVL Proof & Code, Ex1, Ex2, Ex3) [
INK]

Priority Queues Intro:
Binary min heaps

[INK]

 

Binary min heaps, D-heaps & Leftist heaps
[INK]

Chapter 6

May 4

D-heaps & Leftist heaps (no new slides)

Leftist heaps & Skew Heaps (no new slides)

HW 3 due
(11:45pm)

Disjoint Sets
[INK]

Chapter 6 & 8

May 11

Disjoint Sets II
(no new slides)

Graphs: Representations & Topological Sort
[
INK]

 

HW 4 due
at the beginning of lecture
Graphs: Representations & Topological Sort (no new slides)

Note: We will meet in
EXEC 110 instead of our regular room in MGH.

Chapter 8 & 9

May 18

Graphs: Dijkstra’s Algorithm [INK]

MIDTERM II
(May 20)

 

Graphs: Dijkstra’s Algorithm
(no new slides)

Chapter 9

May 25

Memorial Day -
NO CLASS

Graphs: MSTs - Kruskal's & Prim's algorithms
[INK]

 

(HW 5 – Part I recommended due date – nothing to turn in)
Memory Hierarchy [INK]&
B-trees [INK]

Section 4.7

June 1

B-trees (Sample B-tree problem & solution) (no new slides)

Sorting I (Proof Details)

HW 5 due
(11:45pm)

Sorting II [INK]
(Last Day of Class)

Chapter 7

June 8

 

Final Exam: Wednesday,
June 10, 2009
2:30-4:20 p.m.

 

 

 

 

                       

 

CREDITS

Lecture slides borrow heavily from those used in previous offerings on cse373, who in turn borrowed from previous offerings, etc.