15-210 Parallel and Sequential Data Structures and Algorithms

Frequency Offered: Generally offered every fall & spring - confirm course offerings for upcoming semesters by accessing the university Schedule of Classes.

Course Relevance (who should take this course?): Students already experienced with fundamentals of functional programming.

• Algorithm design techniques
• Parallel algorithms
• Analyzing costs by solving recurrences
• Graph algorithms
• Parallel data structures
• Randomized algorithms

Most Recent Syllabus:
https://www.cs.cmu.edu/~15210/syllabus.html 

• Introductory discrete math and proof techniques
• Understanding of programming
• Knowledge of SML is helpful

Sample class notes:
https://drive.google.com/file/d/0B4z2gzEmkDDCUGpPcElvaEpYRTg/view?usp=sharing

Sample Assignment:
http://www.cs.cmu.edu/~15210/labs/skyline.pdf

• Assignments - 40%
• Exam 1 - 15%
• Exam 2 - 15%
• Final - 26%
• Recitation Participation - 4%

Sample Exam: None provided

Sample Lecture Recording: Typically no recorded lectures

• Understand a variety of techniques in algorithm design including divide-and-conquer, contraction, randomization, greedy method, brute-force, reduction, and dynamic programming
• Understand parallel techniques such as scan (prefix sums) Ability to abstract a problem as a formal definition
• Ability to design new algorithms and data structures given a definition
• Understand asymptotic analysis and solve a wide variety of recurrences
• Understand purely functional algorithms.

Course Website: https://www.cs.cmu.edu/~15210/

• Course Textbook
• AutoLab
• Gradescope
• Piazza
• Notation Supplement
• Course Website

• Prerequisites Required: 15-150, 15-122
• Minimum Grades in Prereqs:
  C in 15150, C in 15122
• Corequisites: None
• Prerequisite for: 
• Anti-requisites: None
• Cross-Listed: none
• Substitutes: 
• Related Courses: 15-150
• Reservations: Some reservations are for students in CS, ECE or MSC