Pennsylvania State University 3 credits CMPSC
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.
Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β written from scratch to your course requirements.
Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.
Expert guides on essay writing, citation styles, study skills, and academic success.
View All Articles
Learn how to write a good research question for a paper. Narrow your topic, identify a research problem, and create a focused question with practical examples.
Learn how to choose a research topic you can actually research. Discover how to narrow broad ideas, find reliable sources, and develop a focused research question.
Learn how to cite sources in a research paper using APA, MLA, and Chicago styles, with in-text citation examples and reference-list tips.