CSE 373, Spring 2019: Home

Announcements and Updates

  • [6/7] Course survey released, available here. Due Friday 6/14
  • [5/30] HW7 released

Calendar

Week 1
Topic
Materials
References
Assignments
Week 1
Lecture 1
(Mon, April 1)
Introduction to ADTs and Measuring Complexity
Weiss 3.1, 3.2, 3.4
Lecture 2
(Wed, April 3)
Stacks and Queues
Weiss 3.5, 3.6, 3.7
Section 1
(Thu, April 4)
CSE 143 Review
Lecture 3
(Fri, April 5)
Maps and Iterators
Weiss 3.3
Week 2
Lecture 4
(Mon, April 8)
Algorithm Analysis: Code Modeling
Weiss 1.2, 2.1 - 2.4.2
  • HW2 Partner Form Due
Lecture 5
(Wed, April 10)
Algorithm Analysis: Big O Definitions
Weiss 2.4.3, 2.4.5,
Please Try Pair Programming
  • HW1 Due
  • HW2 Part 1 Out
Section 2
(Thu, April 11)
Algorithm Analysis 1
Lecture Review Slides
Lecture 6
(Fri, April 12)
Algorithm Analysis: Modeling Complex Functions
Week 3
Lecture 7
(Mon, April 15)
Recurrences and Master Theorem
Lecture 8
(Wed, April 17)
Tree Method
Another helpful walkthrough
  • HW2 Part 1 Due
  • HW2 Part 2 Out
Section 3
(Thu, April 18)
Algorithm Analysis 2 (Recurrences)
Lecture Review Slides
In–depth Review Video
Lecture 9
(Fri, April 19)
More Tree Method, Binary Search Trees
Weiss 4.3
Week 4
Lecture 10
(Mon, April 22)
AVL Trees
Weiss 4.4.1 - 4.4.2
Lecture 11
(Wed, April 24)
Intro to Hashing
Weiss 5.1 - 5.5
Section 4
(Thu, April 25)
AVL Trees and Hashing
Lecture Review Slides
Lecture 12
(Fri, April 26)
Hashing - Collisions
Weiss 5.1 - 5.3
Week 5
Lecture 13
(Mon, April 29)
Design Decisions
  • HW4 Partner Form Due
Lecture 14
(Wed, May 1)
Midterm Review
Section 5
(Thu, May 2)
Midterm Review
Lecture 15
(Fri, May 3)
Midterm
Week 6
Lecture 16
(Mon, May 6)
Heaps I
Weiss 6.1 - 6.3
Lecture 17
(Wed, May 8)
Midterm recap and Heaps II
Section 6
(Thu, May 9)
Heaps
Lecture Review Slides
  • HW5 Part 1 Out
Lecture 18
(Fri, May 10)
Memory
Week 7
Lecture 19
(Mon, May 13)
Sorting Algorithms
Lecture 20
(Wed, May 15)
Intro to Graphs and Traversals
Weiss 9.1
  • HW5 Part 2 Out
Section 7
(Thu, May 16)
Sorting and Graph Definitions
Lecture Review Slides
  • HW5 Part 1 Due
Lecture 21
(Fri, May 17)
Shortest Path
Weiss 9.3.1, 9.6
Week 8
Lecture 22
(Mon, May 20)
Dijkstra's II
Lecture 23
(Wed, May 22)
Minimum Spanning Trees (MSTs)
Weiss 9.5
Section 8
(Thu, May 23)
BFS, DFS, Dijkstra's
Review + Solutions Slides
Lecture 24
(Fri, May 24)
Disjoint Sets I
Weiss 8.1 - 8.7, notesheet
  • HW7 partner form out
Week 9
Lecture 25
(Mon, May 27)
Memorial Day (no lecture)
  • HW7 partner form due
Lecture 26
(Wed, May 29)
Disjoint Sets II
Weiss 8.1 - 8.7
Section 9
(Thu, May 30)
MSTs, Disjoint Sets
Review + Solution Slides
Lecture 27
(Fri, May 31)
Array Disjoint Sets, Topological Sort, and Strongly Connected Components
Weiss 9.2, 9.5
Week 10
Lecture 28
(Mon, Jun 3)
Combining Graph Algorithms
Lecture 29
(Wed, Jun 5)
P and NP
Section 10
(Thu, Jun 6)
Final Review
Lecture 30
(Fri, Jun 7)
Final Review
  • HW7 Due
Finals week
Exam
(Tues, Jun 11)
Final Exam (CSE2 G20, 8:30am)
(Fri, June 14)
  • CSE content survey due

Note that content for future lectures is subject to change.