Graduate Catalog 2020-2021

CSC 727 Algorithms and Information Structures

3 hours; 3 credits. 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.

Credits

3