CSC 727
Download as PDF
CSC 727 - Algorithms and Information Structures (3 cr)
Course Title
Algorithms and Information Structures
Catalog Description
Basic data structures: lists, trees, balanced trees, hash tables, partially ordered trees, b-trees. Storage management: garbage collection, allocation strategies. Techniques for asymptotic and exact analysis of programs, and criteria for data structure and algorithm selection. Recursion vs. iteration. Methods for the design of efficient algorithms. NP-completeness, examples of intractable problems.
Minimum
3
Max
3
Academic Progress Units
3
Requirement Designation
Graduate Non-Liberal Arts
Prerequisites & Corequisites
012503
Name
Lecture