Evan McCarty
(ejmcc@cs)

Welcome to CSE 332! We have put the most important links at the top, categorized by what they're for. Please check them out!

## Getting Help

It is very important to us that you succeed in CSE 332. We provide many extra resources to help you. We have a message board called , and we provide you with many practice handouts.

## Office Hours

### Monday

• 11:00am 12:00pm
(CSE 214; Evan)
• 1:00pm 2:00pm
(CSE 021; Alon)

### Wednesday

• 11:00am 12:00pm
(CSE 214; Evan)

### Thursday

• 2:00pm 4:00pm
(Breakout4; Jefferson)

### Friday

• 2:00pm 4:00pm
(Breakout4; Jefferson)

## Course Staff

Evan McCarty
CSE 214
ejmcc

### Teaching Assistants

Jefferson Van Wagenen
jgdv
Alon Yehiel Milchgrub
alonmil

## Schedule

• Introduction and Priority Queues
• Algorithm Analysis
• Dictionaries
• Hashing
• Sorting
• Parallelism
• Minimax
• Graphs
• Complexity

#
Day
Topic
Projects
Exercises
Introduction, Stacks and Queues
Weiss 3.1-3.7
Worklists and Priority Queues
Weiss 6.1-6.3
WorkLists and Tries
Heaps and intro to Algorithm Analysis
Weiss 6.4-6.5
Algorithm Analysis 1: Asymptotics
Weiss 1.1-1.6
Algorithm Analysis 2: Recurrences
Weiss 2.1-2.4
Heaps and Algorithm Analysis
Algorithm Analysis 3: Amortized Analysis
Project 1 - Checkpoint 1
Dictionaries and BST review
AVL Trees
Project 1 Due
Dictionaries and AVL
Dictionaries 4: Hashing
Weiss 5.1-5.3
Dictionaries 5: Hashing Collision Resolution
Weiss 5.4-5.6
Midterm Exam
Sorting
Weiss 7.1-7.2, 7.5-7.7
Sorting: Beyond Comparison Sorting
Weiss 7.8, 7.11
P2 Checkpoint
Sorting conclusion
Parallelism 1
Grossman 2.1-3.4
Parallelism 2
Grossman 3.5-4.3
Writing Parallel Programs
Parallelism 3: Alphabeta and P3
Grossman 5.1-5.4
Alphabeta Pack and Scan
Synchronization: Parallelism Conclusion
More Parallelism
Graphs 1: Definitions and Reachability
Graphs 2: Representations and Topological Sort
Graphs 3: Single-Source-Shortest Paths
Graphs
Graphs 4: Minimum Spanning Trees
Efficient Reductions and P/NP
Algorithm Design and Exam Review
Final Exam pt 1
Final Exam pt 2