CPS130: Useful Links

Some of the concepts covered in detail in CPS130 were introduced in CPS100. Yes, you have seen before the big-O notation, trees, balanced trees, hashing, red-black trees, priority queues, heaps, huffman coding, bubblesort, heapsort, quicksort, mergesort, radixsort, and BFS, DFS and shortest paths on graphs. If you don't believe, check out the CPS100 syllabus!

Previous CPS130 classes at Duke

Spring 2002 (Lars Arge)
Fall 2001 (John Reif)
Spring 2001 (Lars Arge)
Fall 2000 (Herbert Edelsbrunner)
Spring 2000 (Lars Arge)
Fall 1998 (Michael Littman)
Fall 1996 (Pankaj Agarwal)

Other undergraduate algorithm classes on the web:

CMU | MIT | Princeton | Yale | Stanford | Cornell

Summer School Resources

The Academic Skills Instructional Program (ASIP) has updated its website to include information about success in summer school and the services offered by the Academic Skills Program. You can find the updated homepage here.

The Peer Tutoring Program has also posted a special page listing the courses for which tutoring is offered in Summer 2002 here.

<laura@cs.duke.edu>

Last modified: Mon May 27 21:41:52 2002 by laura.