UNC-CH COMP 410
Class Readings
-
Weiss, ch. 1
Math and Java summary
-
Weiss, ch. 2
Basics of Algorithm Analysis
-
Weiss, ch. 3
List, Stack, Queue
-
Weiss, ch. 4, sect. 4.1, 4.2, 4.3
Trees, Binary tree, Binary Search Tree
-
Weiss, ch. 4
sect. 4.4 (AVL trees), 4.5 (Splay trees)
sect. 4.6 (traversals),
sect. 4.8 (sets and maps)
-
Weiss, ch. 5
Hashing and Hash tables
-
Weiss, ch. 6 (sect. 6.1 through 6.4)
Heaps and Priority Queues
heapsort
-
Weiss, ch. 7 (sect. 7.1 through 7.7)
Sorting, bubble, insertion, selection, heapsort, mergesort, quicksort
-
Weiss, ch. 9
Graphs and graph algorithms
-
Weiss, ch. 10.4.2
Skip lists
(Pugh paper)