# COMP 410 (Fall 2017)

## August

Sun Mon Tue Wed Thu Fri Sat
20 21 22 UNC FDOC 23 first 410 meeting
Topic: syllabus
PPT: Oracle Tutorial
24 25 26
27 28
Text: Ch. 1,2
Topic: alg efficiency, eBay sort, bubble sort
PPT: abstract data types
29 30
PPT: Lists, Stacks, Queues
Text: Ch. 1,2
ASSN 0 due 11:55pm
31

## September

Sun Mon Tue Wed Thu Fri Sat
1 2
3 4 holiday
no class
5 6
Text: Weiss Ch. 3
Implementations: an exercise
PPT: Lists, Stacks, Queues
7 8 9
10 11
Text: Weiss Ch. 2
PPT: Complexity (Big-Oh)
ASSN 1 due 11:55pm
12 13
Text: Weiss Ch. 4
PPT: Trees
14 15 16
17 18
more trees
19 20
PPT: Binary Search Trees
21 22 23
24 25
more BST, recursive vs. iterative
Examples: data structure animation
26 27
PPT: Recursion and Run-time
PPT: Notes on Trees Big O
28 29 30

## October

Sun Mon Tue Wed Thu Fri Sat
1 2
Text: Weiss Ch. 6
PPT: Priority Queue
3 4
Text: Weiss Ch. 6
PPT: Binary Heap
PPT: Array rep for binary trees
5 6 7
8 9
Text: Weiss Ch. 4 (again)
PPT: Balanced Trees: AVL
Examples: data structure animation
10 11
More AVL trees
PPT: Balanced Trees: Splay
12 13 14
15 16
Midterm Exam
17 18 No class meeting 19 fall break
no class
20 fall break
no class
21 fall break
22 fall break 23
More splay as needed
PPT: Maps and Sets
24 25
Text: Weiss Ch. 5
PPT: Hashing, Hash Maps
26 27 28
29 30
More hashing
31

## November

Sun Mon Tue Wed Thu Fri Sat
1
More Hashing
2 3 4
5 6
Text: Weiss Ch. 9
PPT: Basic Graph Theory
7 8
PPT: Modeling, Implementing Graphs
9 10 11
12 13
PPT: Graph Algorithms
topological sort, shortest path
14 15
PPT: Minimum Spanning Tree (Prim's, Kurskal's)
16 17 18
19 20
PPT: Euler, Hamiltonian Paths, Circuits
21 22 holiday
no class
23 holiday
no class
24 holiday
no class
25 holiday
26 holiday 27
Text: Weiss Ch. 8
PPT: Sorting
28 29
Text: Weiss Ch. 10.4.2
Skip Lists
30

## December

Sun Mon Tue Wed Thu Fri Sat
1 2
3 4
PPT: Trie for type-ahead text retrieval
O( N! )
5 6 UNC LDOC
last 410 meeting

Review and wrapup
7 Reading day 8 9 Final Exam
4:00pm
10 11 12 13 Reading day 14 15 16