CS 458 Algorithms

From Computer Science at Indiana State University
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Catalog Description

Among the topics covered are: review of basic data structures and their implementations; graphs, both directed and undirected; analysis of algorithms; sorting, searching, and merging, both internal and external methods; memory management algorithms; mathematical algorithms; and, as time allows, advanced topics such as NP-complete problems. Prerequisite - C or better in CS 202 and CS 303.

Prerequisites

  • TODO

Standard Content

Course Outline

  • TODO

Learning Outcomes

  • TODO

Important Assignments and/or Exam Questions

  • TODO

Standard resources

  • TODO
Retrieved from "https://cs.indstate.edu/web/index.php?title=CS_458_Algorithms&oldid=91"