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).
You can view our .
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

  • 9:30am 10:30am
    (Breakout4; krm28)
  • 10:30am 11:30am
    (Breakout4; michajoh/rluckey)
  • 11:30am 12:30pm
    (Breakout4; ollin/brandv2)
  • 1:30pm 2:30pm
    (Breakout4; ijchen/khow89)
  • 3:30pm 4:30pm
    (Breakout4; cwolf11/jkbach)
  • 5:30pm 6:30pm
    (Breakout4; ollin/weberlo)

Tuesday

  • 1:00pm 3:00pm
    (CSE 444; blank)

Wednesday

  • 10:30am 11:30am
    (Breakout4; michajoh/rluckey)
  • 11:30pm 12:30pm
    (Breakout4; krm28/ollin)
  • 1:30pm 2:30pm
    (Breakout4; khow89/ijchen)
  • 3:30pm 6:00pm
    (CSE 444; blank)

Thursday

  • 3:30pm 4:30pm
    (Breakout4; dtallen1)
  • 5:30pm 6:30pm
    (Breakout4; mlee42/ollin)
  • 6:30pm 7:30pm
    (Breakout4; mlee42)

Friday

  • 10:00am 11:00am
    (CSE 444; blank)
  • 11:00am 12:30pm
    (Breakout4; michajoh/brandv2)
  • 1:30pm 2:30pm
    (Breakout4; dtallen1/jkbach)
  • 3:30pm 4:30pm
    (Breakout4; cwolf11/lia4)
  • 4:30pm 5:30pm
    (Breakout4; lia4/jgdv)
  • 5:30pm 7:00pm
    (Breakout4; jgdv/weberlo)

Sunday

  • 1:00pm 2:00pm
    (Breakout4; medskm)
  • 2:00pm 3:00pm
    (Breakout4; medskm/cjc61)
  • 3:00pm 4:00pm
    (Breakout4; cjc61)

Course Staff

Instructor

Adam Blank
CSE 444
(206) 616-0034

Teaching Assistants

Daniel Allen
dtallen1
Yay!
Ollin Boer Bohan
ollin
BB
Irving Chen
ijchen
AC
Christopher Choi
cjc61
AC
Kathryn Howland
khow89
AD
John Kaltenbach
jkbach
BA
Michael Lee
mlee42
BD
Andrew Li
lia4
AB
Royden Luckey
rluckey
?E
Karishma Mandyam
krm28
AD
Melissa Medsker
medskm
BC
Johan Michalove
michajoh
?E
Jefferson Van Wagenen
jgdv
BC
Brandon Vincent
brandv2
BB
Logan Weber
weberlo
AA
Christine Wolf
cwolf11
AA

Schedule

  • Algorithm Analysis
  • Priority Queues & Heaps
  • Trees
  • Hashing
  • Sorting
  • Parallelism
  • Concurrency
  • Graphs
  • Graph Algorithms
#
Day
Topic
Projects
Exercises
WorkLists; Stacks & Queues
Syllabus, Manifesto, Choosing A Partner
Weiss 3.1-3.7
Priority Queues 1: ADT
Weiss 6.1-6.3
Introduction & WorkLists
Priority Queues 2: Heaps
Weiss 6.4-6.5
Algorithm Analysis 1: Asymptotics
Weiss 1.1-1.6
Heaps & Algorithm Analysis
Algorithm Analysis 2: Recurrences
Weiss 2.1-2.4
Algorithm Analysis 3: More Recurrences & Amortization
Recurrences
Dictionaries 1: ADT & BSTs
Weiss 4.1-4.3, 4.6
Dictionaries 2: AVL Trees
Weiss 4.4
Dictionaries 3: B-Trees
Weiss 4.7
AVL Trees & B-Trees
Dictionaries 4: Hashing
Weiss 5.1-5.3
Dictionaries 5: Hashing Collision Resolution
Weiss 5.4-5.6
Sorting 1: Comparison Sorting
Weiss 7.1-7.2, 7.5-7.7
Midterm Review
Sorting 2: Beyond Comparison Sorting
Weiss 7.8, 7.11
Parallelism 1: ForkJoin
Grossman 2.1-3.4
Writing Parallel Programs
Parallelism 2: Analysis
Grossman 3.5-4.3
Midterm Exam

Information & Practice Exams

  • 4:30pm
    5:55pm in GUG 220
P3: Minimax and Alpha-Beta
Interview Questions
Parallelism 3: Scan and Sorting
Grossman 5.1-5.4
Synchronization: Locks
More Parallelism
Graphs 1: Definitions & Reachability
Graphs 2: Representations & Topological Sort
Graphs 3: Single-Source-Shortest Paths
More Graphs
Graphs 4: Minimum Spanning Trees
P/NP 1: Efficient Reductions
P/NP 2: What is P/NP?
Review
Victory Lap