Design of algorithms. Graphs, paths, and trees. Analysis of algorithms for internal and external sorting,
searching, and merging. Hashing. Algorithms for dynamic storage allocation. Spring, every
other Fall. Credit, 3 semester hours. PREREQ: CSC 2150 and C or better in CSC 1850.