Algorithms and Information Structures
Overview
Subject area
CSC
Catalog Number
727
Course Title
Algorithms and Information Structures
Department(s)
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.
Typically Offered
Fall, Spring
Academic Career
Graduate
Liberal Arts
No
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
012503