If a subdirectory has a 4-digit name, it contains files relevant to that date. For example, 0118/ has files from January 18, our first meeting. Directories often contain Notes.txt file (and sometimes Addendum.txt) describing their contents. Students are encouraged to browse around.
Name | Last modified | Size | Description | |
---|---|---|---|---|
Parent Directory | - | |||
HEADER.html | 2012-04-01 13:39 | 501 | ||
Makefile | 2012-02-24 12:58 | 1.5K | 'make' config | |
0227/ | 2012-02-27 11:45 | - | BFS and shortest paths, SymbolGraph | |
0413/ | 2012-04-30 10:45 | - | BWT forward (suffix sorting) and back (cleverness) | |
0330/ | 2012-03-30 11:45 | - | Dijkstra vs Acyclic vs BellmanFord, A* mention | |
0423/ | 2012-04-23 13:09 | - | Ford Fulkerson, hw5 written | |
0203/ | 2012-02-03 11:45 | - | LL red-black trees, insert/put by rotations and color-flip | |
0406/ | 2012-04-30 10:42 | - | MSD radix sort, 3-way radix quicksort, LRS | |
0321/ | 2012-03-21 11:45 | - | MST cut prop and greedy algo, faster geom/GeomGraph | |
0409/ | 2012-04-30 10:43 | - | QuadTree, Manber algorithm | |
calendar.txt | 2012-01-25 05:24 | 1.2K | basic semester calendar | |
0125/ | 2012-01-25 11:45 | - | binary heap in array, swim and sink, heapsort | |
0418/ | 2012-04-30 10:47 | - | compression: Huffman, LZW intro | |
0217/ | 2012-02-17 11:45 | - | cuckoo hashing, some benchmarks | |
0229/ | 2012-02-29 11:45 | - | directed graphs (4.2), topological sort | |
0427/ | 2012-04-27 11:45 | - | examples of linear programming (LP), duality, IP | |
0319/ | 2012-03-19 11:45 | - | exams back, starting 4.3 on MST | |
0309/ | 2012-03-09 11:45 | - | exam solutions, greed preview (MST vs TSP) | |
0420/ | 2012-04-20 11:40 | - | finishing LZW, starting maxflow/mincut | |
0118/ | 2012-01-18 11:45 | - | first meeting, background survey | |
handouts/ | 2012-04-23 11:18 | - | formatted handouts | |
0328/ | 2012-03-28 11:45 | - | generic relax algo, some Dijkstra, 2-opt, hw4-outputs/ | |
0220/ | 2012-02-20 11:45 | - | graphs intro: examples, adjacency lists, Paths API example | |
0213/ | 2012-02-13 11:45 | - | hashing intro: hash functions, separate chaining | |
hw5/ | 2012-04-30 10:49 | - | homework: Burrows Wheeler Transform | |
hw4/ | 2012-04-03 13:07 | - | homework: GeomGraph, MST, TSP, 2-opt | |
hw1/ | 2012-02-24 12:54 | - | homework: UF, weighted-union versus path-compression | |
hw3/ | 2012-02-28 13:32 | - | homework: find largest bridge edge in movies.txt | |
hw2/ | 2012-02-24 12:54 | - | homework: persistent left-leaning red-black tree | |
0201/ | 2012-02-01 11:45 | - | hw1 help, 2-3 trees | |
0208/ | 2012-02-08 11:45 | - | hw2 intro: persistent binary search tree (PBST) | |
0326/ | 2012-03-26 11:45 | - | hw4 program out, starting 4.4 shortest paths | |
0323/ | 2012-03-23 11:45 | - | hw4 written out, Kruskal and Prim, IndexMinPQ | |
0430/ | 2012-04-30 11:09 | - | last meeting, review, evals | |
0302/ | 2012-03-02 11:45 | - | linear time SCC, transitive closure, some review | |
0127/ | 2012-01-27 11:45 | - | linear time heap construction, CollisionSystem | |
mail/ | 2012-05-03 22:29 | - | mail archive | |
0425/ | 2012-04-30 10:48 | - | maxflow code, performance, applications | |
0307/ | 2012-03-07 11:45 | - | midterm exam! (see handouts) | |
0222/ | 2012-02-22 11:45 | - | more DFS, Paths, the DFS tree, CC, linear time | |
0123/ | 2012-01-23 11:45 | - | more UF, sorting bound, priority queue | |
0215/ | 2012-02-15 11:45 | - | more hashing: linear probing, deletion, in practice | |
0210/ | 2012-02-10 11:45 | - | more hw2: persistent red-black BST, stack iterator | |
0224/ | 2012-02-24 11:45 | - | movies.txt, oracle of Bacon, introducing hw3 | |
0502/ | 2012-05-02 23:59 | - | reading day review session, solutions | |
0206/ | 2012-02-06 11:45 | - | red-black deletion (sketchy), rank and select ops | |
0305/ | 2012-03-05 11:45 | - | review for midterm exam | |
0404/ | 2012-04-04 11:37 | - | starting Chapter 5: Strings and string sorting | |
0416/ | 2012-04-30 10:46 | - | substring search, KMP (DFA) and KMPplus (NFA) | |
book/ | 2012-04-18 11:35 | - | textbook files (Java, data, JAR) | |
0411/ | 2012-04-30 10:44 | - | tries, R-way, TST, prefix ops | |
0130/ | 2012-01-30 11:45 | - | unbalanced BST's (find/insert/delete) | |
0120/ | 2012-01-20 11:45 | - | union find (slow, faster, fastest) | |