Graduate Catalog 2012-2013
Home | Graduate Catalog 2012-2013 | Graduate Programs, Disciplines, and Course Offerings | Master of Science in Computer Science (MS) | Computer Science Courses | CSC 727 Algorithms and Information Structures
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.
Up one level
Click arrowheads to expand or collapse contents