COMP 410 (Spring 2018)

January

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

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


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

February

Sun Mon Tue Wed Thu Fri Sat
1


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

March

Sun Mon Tue Wed Thu Fri Sat
1
PPT: Balanced Trees: Splay

2 3
4 5
midterm exam


6 7
PPT: Maps and Sets
8 9 10
11 12 spring break


13 spring break 14 spring break 15 spring break 16 spring break 17 spring break
18 19
Text: Weiss Ch. 5
PPT: Hashing, Hash Maps
20 21
PPT: Hashing, Hash Maps
PPT: blockchain
22 23 24
25 26
Text: Weiss Ch. 9
PPT: Basic Graph Theory
27 28
PPT: Modeling, Implementing Graphs
29 30 holiday 31

April

Sun Mon Tue Wed Thu Fri Sat
1 2
PPT: Graph Algorithms
topological sort, shortest path
3 4
PPT: Minimum Spanning Tree (Prim's, Kurskal's)
5 6 7
8 9
PPT: Minimum Spanning Tree (Prim's, Kurskal's)
10 11
PPT: Euler, Hamiltonian Paths, Circuits
12 13 14
15 16
Text: Weiss Ch. 8
PPT: Sorting

17 18 19 20 21
22 23
PPT: Trie for type-ahead text retrieval
Text: Weiss Ch. 10.4.2
Skip Lists
24 25
last 410 class
26 27 LDOC 28
29
 
 
 
30

May

Sun Mon Tue Wed Thu Fri Sat
1 2 reading day 3 final exam
12:00 noon
in GS G100
 
4 5
6 reading day
 
 
 
7 8 9 10 11 12