MPCS 55005 Advanced Algorithms (Spring 2022)

Section 1
Instructor(s) Brady, Geraldine (gb52)
Location JCL 011
Meeting Times Tuesday 1:30pm - 4:30pm
Fulfills Core Theory Elective

Syllabus

Advanced Algorithms is a second course on the design and analysis of efficient algorithms. This course will present many interesting and relevant algorithms and give students the tools to recognize and rigorously solve algorithmic problems in the real world. 

Topics include:

  • Data structures: Bloom filters, red-black trees, B-trees, skip lists, and more 
  • NP-completeness
  • Methods of dealing with NP-completeness: approximation, randomization, branch and bound, local search
  • Linear programming
  • Computational geometry and advanced graph algorithms

with applications in computing, data science, and engineering.

Engaging weekly homework assignments will involve designing new algorithms in pseudocode and implementing selected algorithms in Python. Course goals are to prepare students with skills necessary to tackle algorithmic problems they are likely to encounter in software development. 

Course Prerequisites

B+ or better in MPCS 55001 Algorithms *or consent of instructor*

Other Prerequisites

This course requires competency in GitHub. Please plan to take the online MPCS Git Bootcamp Course on Canvas or learn Git on your own if you do not already know it.

Overlapping Classes

This class is scheduled at a time that does not conflict with any other classes this quarter.

Eligible Programs

Masters Program in Computer Science MS in Computational Analysis in Public Policy (Year 2) MS in Molecular Engineering MA in Computational Social Science (Year 2) Bx/MS in Computer Science (Option 1: Research-Oriented) Bx/MS in Computer Science (Option 2: Professionally-oriented - CS Majors) Bx/MS in Computer Science (Option 3: Profesionally-oriented - Non-CS Majors)