()

## Information

Welcome to CSE 332! You might want to start by looking at the course policies in the .
Our optional this quarter will be Data Structures and Algorithm Analysis in Java, 3rd edition (Weiss).

## Getting Help

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

## Office Hours

### Monday

• 12:00pm 1:30pm

### Tuesday

• 1:00pm 2:00pm
(CSE 220; Siva)

### Wednesday

• 12:00pm 1:30pm

### Thursday

• 2:00pm 3:00pm

### Friday

• 1:00pm 2:00pm

CSE 444
(206) 616-0034

anied
TA
Siva Ramamoorthy
sivanr
TA

## Schedule

• Program Analysis
• Priority Queues & Heaps
• Trees
• Hashing
• Sorting
• Parallelism
• Concurrency
• Graphs
• Graph Algorithms
#
Day
Topic
Homework
Syllabus, Stacks & Queues
Weiss 3.1-3.7
Algorithm Analysis 1
Weiss 1.1-1.6
Practicing Big-Oh and Proofs
Algorithm Analysis 2
Weiss 2.1-2.4
Amortized Analysis
Priority Queues & Heaps
Weiss 6.1-6.3
Algorithm Analysis & Recurrence Relations
Independence Day: No Class!
Dictionaries & BSTs
Weiss 4.1-4.3, 4.6
Heaps, Testing
AVL Trees
Weiss 4.4
B-Trees
Weiss 4.7
Hashing 1
Weiss 5.1-5.3
AVL Trees & B-Trees
Hashing 2
Weiss 5.4-5.6
Sorting 1
Weiss 7.1-7.2, 7.5-7.7
Sorting 2
Weiss 7.8, 7.11
Midterm Review
Midterm Exam

#### Information & Practice Exams

• 10:50
11:50 am in EEB 026
Introduction To ForkJoin
Grossman 2.1-3.4
Analyzing ForkJoin Programs
Grossman 3.5-4.3
ForkJoin & Minimax
Parallel Scan & Parallel Sorting
Grossman 5.1-5.4
Synchronization 1
Synchronization 2
Prefix Sum and Currency Problems
Graphs 1: Introduction, BFS, DFS
Graphs 2: Representation and Topological Sort
Single-Source-Shortest Paths
Graphs
MSTs and Union Find
Victory Lap
Dijkstra & P/NP & Review
Final Exam

#### Information & Practice Exams

• 10:50
11:50 am in EEB 026