CS 558Algorithms
Indiana State University · 3.000 credits · GRAD

Catalog
Among the topics covered will be: 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 advanced topics as time allows, such as NP-complete problems. Prerequisites:C or better in CS 202, CS 303 and Math 132, or A- or better in CS 500
Recent sections
Spring 2027 · 2 sections
Jan 11 – May 7
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 001Class #11170 | Mo We · 3:30 – 4:45 PM | TBA | Arash Rafiey |
| 301Class #11202 | Time not published | Web Site WEB | Arash Rafiey |