COMP 410 (Spring 2019)

January

Mon Tue Wed Thu Fri Sat Sun
07 08 09 FDOC
Survey

syllabus
alg efficiency, eBay sort, bubble sort

Admin: Assn 0, email, etc.
10 11 12 13
14
Text: Ch. 1,2,3
PPT: abstract data types
15 16
Text: Ch. 3
Implementations: an exercise
PPT: Lists, Stacks, Queues
(lists)
PPT: a sentinel
17 18 19 20
21 holiday
no class
22 23
Text: Ch. 2
PPT: Complexity (Big-Oh)
24 25 26 27
28
PPT: Lists, Stacks, Queues
(stacks and queues)
29 30
Text:Ch. 4
PPT: Trees
PPT: Binary Search Trees
31

February

Mon Tue Wed Thu Fri Sat Sun
01 02



03
04
Examples: data structure animation
05 06
PPT: Recursion and Run-time
07 08 09 10
11
PPT: Notes on Trees Big O
12 13
Text: Ch. 6
PPT: Priority Queue
Text: Ch. 6
PPT: Binary Heap
14 15 16 17
18
PPT: Array rep for binary trees
19 20
Text: Ch. 4 (again)
PPT: Balanced Trees: AVL
21 22 23 24
25
PPT: Balanced Trees: Splay
26 27
PPT: Maps and Sets
28

March

Mon Tue Wed Thu Fri Sat Sun
01 02 03
04 05 06
Midterm Exam


07 08 09 spring break starts 10 spring break
11 spring break

12 spring break

13 spring break

14 spring break`

15 spring break

16 spring break

17 spring break

18
Text: Ch. 5
PPT: Hashing, Hash Maps
19 20
PPT: Hashing, Hash Maps
PPT: Blockchain
21 22 23 24
25
Text: Ch. 9
PPT: Basic Graph Theory
26 27
PPT: Modeling, Implementing Graphs
28 29 30 31

April

Mon Tue Wed Thu Fri Sat Sun
01
PPT: Graph Algorithms
topological sort, shortest path
02 03
PPT: Minimum Spanning Tree (Prim's, Kurskal's)
04 05 06 07
08
PPT: Minimum Spanning Tree (Prim's, Kurskal's)
09 10
PPT: Euler, Hamiltonian Paths, Circuits
11 12 13 14
15
Text:Ch. 8
PPT: Sorting, finish up
16 17 18 19 holiday
20 21
22
Text: Ch. 10.4.2
Skip Lists
PPT: Trie for type-ahead text retrieval
23 24 25 26 LDOC 27 28
29



30

May

Mon Tue Wed Thu Fri Sat Sun
01 reading day

02 Final Exam
12:00 noon, in our classroom

03 04 reading day


05
06 07



08 09 10 11 12 graduation day