46-902 Data Structures and Algrithms for Computational Finance

6 units, Carnegie Mellon University

A course in foundational data structures and algorithms for Computational Finance students. Students will study the design, implementation, and analysis of core data structures including stacks, queues, priority queues, trees, and graphs. The course also covers key algorithmic techniques including graph traversal, shortest-path algorithms, and dynamic programming. Students apply these concepts through scaffolded programming projects set in financial contexts. Emphasis is placed on evaluating trade-offs between competing approaches and translating abstract algorithmic ideas into correct, efficient Python implementations. Non-MSCF students may not take this course without written permission from the instructor. To be eligible, you must be a BSCF student or a graduate student enrolled in an MSCF participating college (Dietrich, Tepper, SCS, or Mellon), and you must satisfy the prerequisites

Prerequisites: 46-901

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

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