Learning Outcomes:
Upon successful completion of this class, students will:
- Become familiar with fundamental data structures like stacks, queues, priority
queues, associative arrays / hashes, and graphs (e.g. search trees and perhaps
tries)
- Become familiar with fundamental algorithms based on these data structures,
including sorting, clustering, graph search, and string search
- Improve your facility with software development, by implementing these data
structures and algorithms in Java
- Become familiar with the basic notion of run time and space analysis, as applied
to algorithm development
|
Travis Wheeler, Associate Professor of Computer Science.
|