17-683 Practical Data Structures for Developers

6 units, Carnegie Mellon University

This fast-paced course introduces data structures and fundamental algorithms for students with prior programming experience. It explores both the conceptual and implementation aspects of common data structures, as well as key techniques for analyzing algorithm efficiency. Topics include lists, sets, maps, trees, priority queues, and hashing, along with their practical applications in a standard library. Students will gain hands-on experience through frequent coding exercises, reinforcing key concepts as they write and analyze code. Students are expected to be proficient in at least one object-oriented programming language before enrolling. Those new to the required programming concepts are encouraged to take 17-681 before this course. Note: This course is also open to undergraduate students with prior programming experience.

Prerequisites: none listed

Offered: Fall 2025

Courseweave needs JavaScript to show sections, workloads and planning tools.