CSE 373, Winter 2019: Home

Announcements and Updates

  • [3/17] Sorting slides updated to include runtimes for mergesort and quicksort. More hw data structure runtimes posted here (and before midterm at the end of this slidedeck)
  • [3/17] There will be some casual office hours / study meet up for tomorrow 3/18 in the 5th floor breakouts from 10am-7pm. See here
  • [3/14] Exam topics updated. (Now includes Heap Sort, Strongly Connected Components, and P/NP subtopics)
  • [3/13] Please fill out the online evaluations for both the lecture and section. We take your feedback seriously and appreciate it.
  • [3/13] Help us improve the content of CSE 373 for future quarters by filling out our specific course survey. This will take roughly 10 minutes and is worth 3 socrative extra credit. Due Friday, Mar 22.

Calendar

Week 1
Topic
Materials
References
Assignments
Week 1
Lecture 1
(Mon, Jan 7)
Introduction to ADTs and Data Structures
Weiss 3.1, 3.2, 3.4
Lecture 2
(Wed, Jan 9)
Stacks and Queues
Weiss 3.5, 3.6, 3.7
Section 1
(Thu, Jan 10)
CSE 143 Review
Lecture 3
(Fri, Jan 11)
Maps and Iterators
Weiss 3.3
Week 2
Lecture 4
(Mon, Jan 14)
Introduction to Asymptotic Analysis
Weiss 1.2, 2.1 - 2.4.2
Lecture 5
(Wed, Jan 16)
Algorithm Analysis and Modeling
(roughly) Weiss 2.4.3, 2.4.5
Section 2
(Thu, Jan 17)
Algorithm Analysis 1
  • HW2 Partner form due
Lecture 6
(Fri, Jan 18)
More Definitions, Modeling Complex Algorithms
Week 3
(Mon, Jan 21)
No Lecture (MLK Day)
Lecture 7
(Wed, Jan 23)
Recurrences
Section 3
(Thu, Jan 24)
Algorithm Analysis 2 (Recurrences)
Lecture 8
(Fri, Jan 25)
Master Theorem, Binary Search Trees, and AVL Trees
Weiss 4.3
  • HW2 Part 1 Due
Week 4
Lecture 9
(Mon, Jan 28)
AVL Tree Rotations
Weiss 4.4.1 - 4.4.2
Lecture 10
(Wed, Jan 30)
Hashing - Separate Chaining
Weiss 5.1 - 5.5
Section 4
(Thu, Jan 31)
AVL Trees and Hashing
Lecture 11
(Fri, Feb 1)
Hashing - Open Addressing, Double Hashing
Weiss 5.1 - 5.3
  • HW3 Partner Form Due 12pm
  • HW2 Part 2 Due
  • HW3 Out
Week 5
(Mon, Feb 4)
No Lecture (Snow Day)
Lecture 12
(Wed, Feb 6)
Binary Heaps and Floyd's Build Heap
Weiss 6.1 - 6.3
Section 5
(Thu, Feb 7)
Heaps (and more hashing + recurrences)
Lecture 13
(Fri, Feb 8)
Memory and Locality
Week 6
(Mon, Feb 11)
No Lecture (Snow Day)
  • HW3 Due Tuesday
Lecture 14
(Wed, Feb 13)
Midterm Review (livestreamed due to "snow morning")
Section 6
(Thu, Feb 14)
Midterm Review
Midterm
(Fri, Feb 15)
Midterm
Week 7
(Mon, Feb 18)
No Lecture (Presidents Day)
Lecture 15
(Wed, Feb 20)
Sorting Algorithms
Section 7
(Thu, Feb 21)
Memory, Sorting, Design Decisions
Lecture 16
(Fri, Feb 22)
Introduction to Graphs
Weiss 9.1
  • HW5 Part 1 Due
Week 8
Lecture 17
(Mon, Feb 25)
Shortest Path
Weiss 9.3.1, 9.6
Lecture 18
(Wed, Feb 27)
Dijkstra's implementation and runtime analysis
Weiss 9.3.2
Section 8
(Thu, Feb 28)
Graphs, Pathfinding
Lecture 19
(Fri, Mar 1)
Minimum Spanning Trees (MSTs)
Weiss 9.5
Week 9
Lecture 20
(Mon, Mar 4)
Intro to Disjoint Sets
Weiss 8.1 - 8.7
Lecture 21
(Wed, Mar 6)
Disjoint Set Optimizations, Graph Representations
Weiss 8.1 - 8.7
Section 9
(Thu, Mar 7)
MSTs, Disjoint Sets
Lecture 22
(Fri, Mar 8)
Topological Sort and Strongly Connected Components
Weiss 9.2, 9.5
  • HW6 Due
Week 10
Lecture 23
(Mon, Mar 11)
Combining Graph Algorithms
Lecture 24
(Wed, Mar 13)
P and NP
Section 10
(Thu, Mar 14)
Final Review
Lecture 25
(Fri, Mar 15)
Final Review
  • HW7 Due
  • Lecture / course online evaluation due (optional, recommended)
Finals week
Exam
(Tues, Mar 19)
Final Exam (SMI 120, 8:30am)
(Fri, Mar 22)
  • CSE content survey due

Note that content for future lectures is subject to change.