CMPSC 462Data Structures
In-depth theoretical study of data structures such as balanced trees, hash tables, priority queues, B-trees, binomial heaps, and Fibonacci heaps. CMPSC 462 Data Structures (3) The primary goals of this course are (1) to provide the students with a set of basic data structures useful in the design of efficient algorithms, and (2) to provide the students with the ability to design and analyze new data structures as needed to solve problems. The secondary goal of this course is to introduce basic algorithm analysis techniques to prepare the students for the follow up course CMPSC 463 , Design and Analysis of Algorithms. This is a required course in the BS COMP program. It is also a prerequisite for a number of other courses in the COMP program such CMPSC 463 , 460 , 430 , etc.
Prerequisites
From the catalog: “C or better in MATH 141 and (C or better in CMPSC 122 or C or better in CMPSC 132 ) and C or better in CMPSC 360 and CMPSC 330”
Where it sits in degree plans
Suggested plans most often put it in Year 2 · Spring (4 programs).
Required in (3)
- Computer Science, B.S. (Abington)
- Computer Science, B.S. (Capital)
- Computer Science, Minor (Capital)
One of the options in (2)
- Artificial Intelligence Methods and Applications, B.S. (Capital)
- Artificial Intelligence Methods and Applications, B.S. (Information Sciences and Technology)