Dynamic Programming, Greedy Algorithms

The University of Colorado Boulder, situated against the stunning backdrop of the Rocky Mountains, is a flagship institution renowned for its academic excellence, research prowess, and vibrant campus life. CU Boulder has evolved into a hub of innovation and intellectual exploration. The university offers a diverse range of undergraduate, graduate, and professional programs across various disciplines, encouraging students to pursue their passions and make meaningful contributions to society. At CU Boulder, students engage with world-class faculty who are leaders in their fields, fostering an environment that promotes critical thinking and creativity. The campus is a melting pot of ideas and cultures, providing a rich tapestry of experiences for students. With a commitment to sustainability and a focus on cutting-edge research, the University of Colorado Boulder continues to be a beacon of higher education, preparing students to navigate the complexities of our ever-changing world.

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.This course can be taken for academic credit as part of CU Boulder’s MS in Data Science or MS in Computer Science degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more: