Home - CSE 373, Summer 2019 (original) (raw)

Announcements and Updates

Calendar

Introduction and administrivia

Weiss 3.1, 3.2, 3.4

Stacks, queues

Weiss 3.5, 3.6, 3.7

CSE 143 review and testing

Code analysis

Weiss 3.3

Formal Big-O definitions, Big-O Proofs

Weiss 1.2, 2.1 - 2.4.2

Big-Omega, Big-Theta, cases, and dictionaries

Asymptotic analysis practice!

Unrolling and tree method

Algorithm Analysis

Recurrences 3 and AVL trees

Weiss 4.3

AVL trees

Weiss 4.4.1 - 4.4.2

Lecture 10

(Wed, July 17)

Hashing: chaining

Weiss 5.1 - 5.5

AVL Trees and Hashing

Lecture 11

(Fri, July 19)

Hashing: open addressing

Weiss 5.1 - 5.3

Lecture 12

(Mon, July 22)

Heaps

Weiss 6.1 - 6.3

Lecture 13

(Wed, July 24)

Heaps: implementation and midterm review

Midterm Review

Lecture 14

(Mon, July 29)

Sorting 1

Weiss 6.1 - 6.3

Lecture 15

(Wed, July 31)

Sorting 2

Section 6

(Thu, August 1)

Heaps and Sorting

Lecture 16

(Fri, August 2)

Graphs 1 (intro, BFS, DFS)

Lecture 17

(Mon, August 5)

Dijkstra's Algorithm

Lecture 18

(Wed, August 7)

Kruskal's Algorithm and Disjoint Sets 1

Section 7

(Thu, August 8)

BFS, Dijkstra's, Kruskal's

Lecture 19

(Fri, August 9)

Disjoint Sets 2

Lecture 20

(Mon, August 12)

Array Disjoint Sets, Prim's

Lecture 21

(Wed, August 14)

Topological sort, SCCs, DFS

Section 8

(Thu, August 15)

Dijsoint Sets, Prim's, SCC, Topo sort

Lecture 22

(Fri, August 16)

Graph Modeling, P/NP 1

Lecture 23

(Mon, August 19)

P/NP 2

Lecture 24

(Wed, August 21)

Final review

Final exam part 1 - in section

Final exam part 2 - in lecture

Note that content for future lectures is subject to change.