COMP 410 (Fall 2016)

August

Sun Mon Tue Wed Thu Fri Sat
21 22 23 FDOC
first 410 meeting

Topic: syllabus
Topic: alg efficiency, eBay sort, bubble sort
24 25
Text: Ch. 1,2,3
PPT: abstract data types
26 27
28 29 30
Text: Weiss Ch. 3
PPT: Lists, Stacks, Queues
PPT: Oracle Tutorial
31

September

Sun Mon Tue Wed Thu Fri Sat
1
Text: Weiss Ch. 2
PPT: Complexity (Big-Oh)
2 3
4 5 6
Text: Weiss Ch. 4
PPT: Trees
7 8
more trees
ASSN 1 due 11:55pm
9 10
11 12 13
PPT: Binary Search Trees
14 15
more BST, recursive vs. iterative
16 17
18 19 20
Text: Weiss Ch. 6
PPT: Notes on Trees Big O
PPT: Priority Queue
21 22
PPT: Array rep for binary trees
PPT: Binary Heap
ASSN 2 due 11:55pm
23 24
25 26 27 travel
in-class TA session for ASSN 3 (PQUE)
28 29 PPT: Balanced Trees: AVL 30

October

Sun Mon Tue Wed Thu Fri Sat
1
2 3 4
PPT: Balanced Trees: Splay
ASSN 3 due 11:55pm
5 6
PPT: Trie for type-ahead text retrieval
PPT: Maps and Sets
7 8
9 10 11 Text: Weiss Ch. 5
PPT: Hashing, Hash Maps
12 13
PPT: Hashing, Hash Maps
14 15
16 17 18 midterm exam 19 20 fall break 21 fall break 22 fall break
23 fall break 24 25
Text: Weiss Ch. 9
PPT: Basic Graph Theory
26 27
PPT: Modeling, Implementing Graphs
ASSN 4 due 11:55pm
28 29
30 31

November

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

December

Sun Mon Tue Wed Thu Fri Sat
1
Text: Weiss Ch. 10.4.2
Skip Lists
2 3
4 5 6 last 410 meeting
Design problem, review
7 LDOC 8 reading day 9 10
11 12 13 14 reading day 15 final exam
(4 pm)
16 17