CS 458Algorithms

Indiana State University · 3.000 credits · UGRD

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. Corequisite: Concurrent enrollment in CS 458L required Prerequisites: A grade of C or better in CS 303 or 203, CS 202 or 302 and MATH 132 Note: open to graduate students. Graduate students are required to do additional work of a research nature.

Recent sections

Spring 2027 · 2 sections

Jan 11 – May 7

SectionDays & timeLocationInstructor
001Class #11169Mo We · 3:30 – 4:45 PMTBAArash Rafiey
301Class #11201Time not publishedWeb Site WEBArash Rafiey