COMP 410 (Spring 2017)

January

Sun Mon Tue Wed Thu Fri Sat
8 9 10 11 FDOC
first 410 meeting

Topic: syllabus
Topic: alg efficiency, eBay sort, bubble sort
12 13 14
15 16 holiday
no class


PPT: Oracle Tutorial
17 18
Text: Ch. 1,2,3
PPT: abstract data types
ASSN 0 due 11:55pm
19 20 21
22 23
Text: Weiss Ch. 3
Implementations: an exercise
PPT: Lists, Stacks, Queues
24 25
Text: Weiss Ch. 2
PPT: Complexity (Big-Oh)
26 27 28
29 30
Text: Weiss Ch. 4
PPT: Trees
31

February

Sun Mon Tue Wed Thu Fri Sat
1
more trees
2 3 4
5 6
PPT: Binary Search Trees
7 8
more BST, recursive vs. iterative
9 10 11
12 13
PPT: Recursion and Run-time
PPT: Notes on Trees Big O
14 15
Text: Weiss Ch. 6
PPT: Priority Queue
16 17 18
19 20
Text: Weiss Ch. 6
PPT: Binary Heap
PPT: Array rep for binary trees
21 22
Heap Build
Binary Heap JS code
23 24 25
26 27
Text: Weiss Ch. 4 (again)
PPT: Balanced Trees: AVL
Examples: data structure animation
28

March

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

April

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

May

Sun Mon Tue Wed Thu Fri Sat
1 2 3 reading day 4 Final Exam
12:00 noon
5 6 reading day
7 8 9 10 11 12 13