15-351 Algorithms and Advanced Data Structures

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

Course Relevance (who should take this course?): This course is for students not in the computer science major or minor who are interested in advanced data structures.

• Run time analysis
• Divide-and-conquer algorithms
• Dynamic programming algorithms
• Network flow algorithms
• Linear and integer programming
• Large-scale search algorithms and heuristics
• Efficient data storage and query
• NP-completeness

Understanding of C and data structures from 15-122

Sample class notes: not provided

Sample Assignment: not provided

• Homework 20%
• First Midterm 25%
• Second Midterm 25%
• Final Exam 30%

Sample Exam: not provided

Sample Lecture Recording: Typically no recorded lectures

• Ability to design, analyze complexity of, and prove the correctness of algorthims used with data structures.

Course Website: http://www.cs.cmu.edu/~jianma/15351/index.html

• Piazza
• Blackboard
• Course Textbook

• Prerequisites Required: 15-122 or 15-121
• Minimum Grades in Prereqs:
  D in 15-122, D in 15-121
• Corequisites: None
• Prerequisite for: 
• Anti-requisites: None
• Cross-Listed: 02-613, 15-650
• Substitutes: 15-112 for 15-121, 15-123 for 15-122
• Related Courses: 15-650, 02-613
• Reservations: None

This course is not open to Computer Science Majors or Minors. Cross-listed with graduate level number 15-650 and graduate students will not be enrolled into the undergraduate level course and will be removed from the waitlist without notification.