Dynamic Programming, Greedy Algorithms, and Intractability

Dynamic Programming, Greedy Algorithms, and Intractability training provided by University of Colorado

Beginner 0(0 Ratings) 0 Students enrolled
Created by University of Colorado Staff Last updated Thu, 03-Mar-2022 English


Dynamic Programming, Greedy Algorithms, and Intractability free videos and free material uploaded by University of Colorado Staff .

Syllabus / What will i learn?

Divide and Conquer Algorithms

We will formally cover divide and conquer algorithms as a design scheme and look at some divide and conquer algorithms we have encountered in the past. We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest Pair of Points.

Dynamic Programming Algorithms

In this module, you will learn about dynamic programming as a design principle for algorithms. We will provide a step-by-step approach to formulating a problem as a dynamic program and solving these problems using memoization. We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting dynamic programming applications.

Greedy Algorithms

In this module, we will learn about greedy algorithm. We will understand the basic design principles for greedy algorithms and learn about a few algorithms for greedy scheduling and Huffman codes. We will also learn some interesting cases when being greedy provides a guaranteed approximations to the actual solution.

Intractability and Supplement on Quantum Computing

P vs NP, Examples such as Travelling Salesperson Problem, Vertex Cover, 3-Coloring and others; Integer Linear Programming and Translating Problems into Integer Programming.

Final Exam

This module contains materials for the final exam for MS-DS degree students. If you've upgraded to the for-credit version of this course, please make sure you review the additional for-credit materials in the Introductory module and anywhere else they may be found.



Curriculum for this course
0 Lessons 00:00:00 Hours
+ View more
Description

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.

You need online training / explanation for this course?

1 to 1 Online Training contact instructor for demo :


+ View more

Other related courses
Updated Wed, 22-Apr-2020
Updated Wed, 24-Feb-2021
Updated Wed, 22-Apr-2020
Updated Thu, 30-Apr-2020
About the instructor
  • 0 Reviews
  • 3 Students
  • 208 Courses
Student feedback
0
Average rating
  • 0%
  • 0%
  • 0%
  • 0%
  • 0%
Reviews

Material price :

Free

1:1 Online Training Fee: 1 /-
Contact instructor for demo :