CMPSC 222Advanced Data Structures and Algorithms in C
This course provides a practical introduction to the design, implementation and analysis of advanced data structures and algorithms, using the C programming language and its related command line tools. Data structures include D-ary, Binomial and Fibonacci heaps; Red-Black, splay and quad-trees, along with algorithms for managing and manipulating them. Also covered is the implementation of graph data structures using adjacency lists and adjacency matrices. Graph algorithms studied include searching and minimum spanning tree construction. Pattern matching algorithms include Brute force, Boyer-Moore, KMP, and Rabin-Karp.
Prerequisites
You need:
Where it sits in degree plans
Suggested plans most often put it in Year 2 · Spring (1 program).
Required in (1)
- Computer Science, B.S. (Engineering)
Courses that list CMPSC 222 as a prerequisite (1)
- CMPSC 315 Computer Systems I