Lectures

Week Sun Mon Tue Wed Thu Fri Sat
1

03/27

03/28

Introduction; ADTs; Stacks

READ: Weiss 3.1;
1.4 - 1.5 (generics review);
3.2 - 3.5 (lists review)

icon slides (icon PDF) Java review
icon slides (icon PDF) lecture
icon syllabus

"Homework":
Skim review reading/slides.
Set up Eclipse.
Take background survey.

03/29

03/30
Stacks and Queues

READ: Weiss 3.6 - 3.7

icon slides (icon PDF)

Assigned: Homework #1

03/31

04/01
Asymptotic Analysis (intro)

READ: Weiss 1.2; 2.1 - 2.4

icon slides (icon PDF)

04/02

2

04/03

04/04

Asymptotic Analysis (notation);
Math Review (exponents, logarithms)

READ: Weiss 1.2; 2.1 - 2.4

icon slides (icon PDF)

04/05

04/06
Asymptotic Analysis (cases);
Math review (series);
Recursion

READ: Weiss 1.4; 2.1 - 2.4

icon slides (icon PDF)

04/07

04/08
Searching

READ: Weiss 2.4

icon slides (icon PDF)

Assigned: Homework #2

04/09

3

04/10

04/11
Sorting

READ: Weiss 7.1 - 7.4

icon slides (icon PDF)

04/12

04/13
Sorting

READ: Weiss 7.6 - 7.10

icon slides (icon PDF)

Assigned: Homework #3

04/14

04/15
Trees (Set ADT, Binary Trees, BST Trees)

READ: Weiss 4.1 - 4.3

icon slides (icon PDF)

04/16

4

04/17

04/18
Trees (Set Implementation; AVL Trees)

READ: Weiss 4.4

icon slides (icon PDF)

04/19

04/20
Trees (AVL Trees)

READ: Weiss 4.4

icon slides (icon PDF)

04/21

04/22
Trees (AVL Trees)

READ: Weiss 4.4

Assigned: Homework #4

icon slides (icon PDF)

04/23

5

04/24

04/25
Priority Queues (Heaps)

READ: Weiss 6.1 - 6.3

icon slides (icon PDF)

04/26

04/27
Priority Queues (Heaps)

READ: Weiss 6.1 - 6.3, 1.5

icon slides (icon PDF)

04/28

04/29
Priority Queues (Heaps)

READ: Weiss 6.1 - 6.3, 7.5

icon slides (icon PDF)

Assigned: Homework #5

04/30

6

05/01

05/02
Hashing
(hash functions; chaining; Hash Set)

READ: Weiss 5.1 - 5.3

icon slides (icon PDF)

05/03

05/04
Midterm Review
(Lecture Section)

05/05

05/06
Midterm

05/07

7

05/08

05/09
Hashing
(Probing Hash Tables)

READ: Weiss 5.4

icon slides (icon PDF)

05/10

05/11
Hashing
(Analysis; Rehashing; hashCode; Map ADT)

READ: Weise 5.4 - 5.5,
Bloch Effective Java Ch. 3 pgs. 36 - 41

icon slides (icon PDF)

Assigned: Homework #6

05/12

05/13
Graphs

READ: Weiss 9.1, 9.3 - 9.3.1, 9.6 (intro only)

icon slides (icon PDF)

05/14

8

05/15

05/16
Graphs

READ: Weiss 9.1.1

icon slides (icon PDF)

05/17

05/18
Graphs

READ: Weiss 9.3.1 - 9.3.2

icon slides (icon PDF)

Assigned: Homework #7

05/19

05/20
Graphs
Lecture will take place in SAV 264 today

READ: Weiss 9.2

icon slides (icon PDF)

05/21

9

05/22

05/23
Graphs

READ: Weiss 9.5

icon slides (icon PDF)

05/24

05/25
Disjoint Sets

READ: Weiss 8.1 - 8.5

icon slides on graphs (icon PDF)
icon slides on disjoint sets (icon PDF)

05/26

05/27
Memory Hierachy

READ: Weiss 4.7

icon slides (icon PDF)

05/28

10

05/29

05/30
Holiday: Memorial Day

05/31

06/01
B-Trees

READ: Weiss 4.7

icon slides (icon PDF)

06/02

06/03
TBA

06/04

Acknowledgements

The slides and resources found on this page where crafted for this offering of CSE 373. However, many of the ideas were inspired by (and, in the case of slides, "directly borrowed" from) those who have come taught data structures and algorithms before us, including Marty Stepp, Stuart Reges, Ruth Anderson, Dan Grossman, Tyler Robison, Gary Yngve, Steve Tanimoto, and Batya Friedman.