15-210 Parallel and Sequential Data Structures and Algorithms

12 units, Carnegie Mellon University

Teaches students about how to design, analyze, and program algorithms and data structures. The course emphasizes parallel algorithms and analysis, and how sequential algorithms can be considered a special case. The course goes into more theoretical content on algorithm analysis than 15-122 and 15-150 while still including a significant programming component and covering a variety of practical applications such as problems in data analysis, graphics, text processing, and the computational sciences. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course. Register for Lecture 1. All students will be waitlisted for Lecture 2 until Lecture 1 is full.

Prerequisites: 15-150 (min C) and 15-122 (min C)

Offered: Spring 2027, Fall 2026, Spring 2026, Fall 2025

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