CS 458 Algorithms: Difference between revisions
Jump to navigation
Jump to search
wiki_previous>Znoble1 Created page with "== Catalog Description == Among the topics covered are: review of basic data structures and their implementations; graphs, both directed and undirected; analysis of algorithm..." |
m 1 revision imported |
(No difference)
| |
Latest revision as of 13:22, 17 August 2025
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