
|
|
Computer Science 34 Data Structures and Algorithm Analysis Instructor - Mr. Naps Advanced data structures and the time and space efficiency of the algorithms that manipulate such structures. Topics include string search algorithms, sparse matrices, union-find problems, recursion, internal and external sorting, optimized tree structures, graphs, networks, path-finding algorithms, hashing, memory-management techniques, and parallelism.
Prerequisites: Computer Science 20 and Mathematics 22.
|
This page is being developed by Laura Norton. Please email comments and suggestions to nortonl@lawrence.edu.
© 2000 Lawrence University, Appleton, WI
Last Updated: March 2000