Index of directory ~cs323000/share

This is the "share directory" for CS323. On Math/CS lab machines, this is directory /home/cs323000/share/.

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.
[ICO]NameLast modifiedSizeDescription

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

Apache/2.4.41 (Ubuntu) Server at www.cs.emory.edu Port 80