Adam Blank 
()

Announcements

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).
As the get closer we will post more information about them.

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

  • 1:30pm 2:30pm
    (CSE 021; Phillip)
  • 4:00pm 5:30pm
    (CSE 444; Adam)

Tuesday

  • 10:30am 11:30am
    (CSE 444; Adam)
  • 1:30pm 2:30pm
    (CSE 021; Phillip)
  • 2:30pm 3:30pm
    (CSE 021; Noah)

Wednesday

  • 1:30pm 2:30pm
    (CSE 021; Mert)
  • 2:30pm 3:30pm
    (CSE 021; Noah)
  • 3:30pm 4:30pm
    (CSE 021; Jonathan)

Thursday

  • 3:30pm 4:30pm
    (CSE 021; Mert)

Friday

  • 11:00am 12:00pm
    (CSE 444; Adam)
  • 2:30pm 3:30pm
    (CSE 218; Phillip)
  • 3:30pm 4:30pm
    (CSE 021; Jonathan)

Course Staff

Instructor

CSE 444
(206) 616-0034

Teaching Assistants

Noah Elliott
noah2l2t
AB
Jonathan Faust
jonfaust
AA
Phillip Huang
phuang2
TA
Jeffrey Pyke
jeffpyke
Extra Sessions
Mert Saglam
saglam
AC

Schedule

  • Algorithm Analysis
  • Priority Queues & Heaps
  • Trees
  • Hashing
  • Sorting
  • Parallelism
  • Concurrency
  • Graphs
  • Graph Algorithms
#
Day
Topic
Projects
Written HW
Algorithm Analysis 1: Asymptotics
Weiss 1.1-1.6
Algorithm Analysis 2: Recurrences
Weiss 2.1-2.4
(Optional) Java Review
JHN 075 @ 4:00pm
(Optional) Binary Tree and BST Review
JHN 075 @ 4:00pm
Dictionaries 1: ADT & BSTs
Weiss 4.1-4.3, 4.6
Dictionaries 3: B-Trees
Weiss 4.7
(Optional) Review of Basic Sorting
JHN 075 @ 4:00pm
Dictionaries 4: Hashing
Weiss 5.1-5.3
AVL Trees & B-Trees
Dictionaries 5: Hashing Collision Resolution
Weiss 5.4-5.6
Sorting 1: Comparison Sorting
Weiss 7.1-7.2, 7.5-7.7
Sorting 2: Beyond Comparison Sorting
Weiss 7.8, 7.11
Midterm Review
Midterm Exam

Information & Practice Exams

  • 12:30pm
    1:30pm in JHN 075
Writing Parallel Programs
Veterans Day: No Class!
Debugging Parallel Programs
P3: Minimax and Alpha-Beta
Graphs 1: Definitions & Reachability
Graphs 2: Representations & Topological Sort
Graphs 3: Single-Source-Shortest Paths
Graphs EX: All-Source-Shortest Paths
Thanksgiving: No Class!
Thanksgiving: No Class!
???
Review
Victory Lap
Final Exam