CSE 373, Autumn 2018: Home

Course Announcements/Updates

  • [12/14] Final exam solutions
  • [12/7] Practice exam posted. See Exams page
  • [11/21] Homework 7 is out.
  • [11/28] Final exam info, covered topics, and practice materials are available.
  • [11/27] Homework 7 sign up forms are available.
  • [11/21] Homework 6 is out.

Calendar

Topic
Materials
References
Assignments
Lecture 1
(Wed, Sep 26)
Introduction to ADTs and Data Structures
Weiss 3.1, 3.2, 3.4
(Thur, Sep 27)
No Sections
Lecture 2
(Fri, Sep 28)
Overview of Big-O and Complexity Classes
HW1 Out

Lecture 3
(Mon, Oct 1)
Stacks and Queues
Weiss 3.5, 3.6, 3.7
Lecture 4
(Wed, Oct 3)
Maps and Iterators
Weiss 3.3
Section 1
(Thur, Oct 4)
Section: 143 review, design decisions
Lecture 5
(Fri, Oct 5)
Testing and Debugging
HW1 Due

HW2 Partner Form Due

HW2 Out

Lecture 6
(Mon, Oct 8)
Asymptotic Analysis: Function Modeling
Weiss 1.2, 2.1 - 2.4.2
Lecture 7
(Wed, Oct 10)
Asymptotic Analysis: Formal Definitions
Weiss 2.4.3, 2.4.5
Section 2
(Thur, Oct 11)
Section: Asymptotic Analysis
Tutorial
(Thur, Oct 11)
Tutorial on Eclipse and Git
Lecture 8
(Fri, Oct 12)
Intro to Binary Search Trees (BSTs)
Weiss 4.3
HW2 Part 1 Due

Lecture 9
(Mon, Oct 15)
Binary search, BSTs
Weiss 4.3
Lecture 10
(Wed, Oct 17)
AVL trees
Weiss 4.4
Section 3
(Thur, Oct 18)
Section: Recurrences and AVL Trees
Lecture 11
(Fri, Oct 19)
More on AVL trees
Weiss 4.4
HW2 Part 2 Due

HW3 Out

Lecture 12
(Mon, Oct 22)
Hash tables
Weiss 5.1 - 5.5
HW4 out

Lecture 13
(Wed, Oct 24)
Hash tables: Handling collisions
Weiss 5.1 - 5.5
Section 4
(Thur, Oct 25)
Section: Dictionaries
Lecture 14
(Fri, Oct 26)
Wrap up Hash tables
Weiss 6.1 - 6.3
HW3 Due

Lecture 15
(Mon, Oct 29)
Binary Heaps
Weiss 6.1 - 6.3
HW4 Due on 10/30

Lecture 16
(Wed, Oct 31)
Midterm review
Section 5
(Thur, Nov 1)
Section: Midterm review
(Fri, Nov 2)
Midterm
HW5 Out

Lecture 17
(Mon, Nov 5)
Floyd's buildHeap and Sorting
Weiss 7.2, 7.5
Lecture 18
(Wed, Nov 7)
Sorting and recurrence analysis techniques
Weiss 7.2, 10.2
Section 6
(Thur, Nov 8)
Section: Heap, sorting
Lecture 19
(Fri, Nov 9)
Graphs
Weiss 9.1
HW5 Part 1 Due on Sat (11/10)

(Mon, Nov 12)
No lecture (Veterans Day)
Lecture 20
(Wed, Nov 14)
Graphs traversal
Weiss 9.3.1, 9.6
Section 7
(Thur, Nov 15)
Section: Graphs
Lecture 21
(Fri, Nov 16)
Shortest path
Weiss 9.3.2
Lecture 22
(Mon, Nov 19)
Topological sort
Weiss 9.2, 9.5
HW5 Part 2 Due

Lecture 23
(Wed, Nov 21)
Memory and locality
HW6 Out

(Thur, Nov 22)
No section (Thanksgiving)
(Fri, Nov 23)
No lecture (Friday after Thanksgiving)
Lecture 24
(Mon, Nov 26)
Minimum spanning trees (MST)
Weiss 9.5
Lecture 25
(Wed, Nov 28)
Kruskal's algorithm and disjoint sets
Weiss 8.1 - 8.7
Section 8
(Thur, Nov 29)
Section: Pathfinding, MSTs, disjoint sets
Lecture 26
(Fri, Nov 30)
More on disjoint sets
HW6 Due

HW7 Out

Lecture 27
(Mon, Dec 3)
Guest lecture: Interview prep
Lecture 28
(Wed, Dec 5)
P vs. NP
Weiss 9.7
Section 9
(Thur, Dec 6)
Section: Final exam review
Lecture 29
(Fri, Dec 7)
Final exam review
HW7 Due