Optimization Techniques

Module Overview

This module teaches you two of the most important problem-solving techniques in the optimization domain: Greedy Techniques and Dynamic Programming. Not all problems require an exhaustive search through the solution space. Rather, consistently choosing the locally optimal solution can be proven to yield the globally optimal solution. In such situations, Greedy Techniques result in simple, highly efficient solutions. Other problems have a well-defined structure, where the same subproblem is encountered and solved multiple times. Dynamic Programming techniques allow us to compute once and reuse the solutions to recurring subproblems.

Module Objectives

The ability to recognize when Greedy Techniques result in optimal solutions

Hands-on experience with using the Greedy Techniques pattern

The ability to analyze problems as being composed of nested subproblems

The ability to recognize opportunities for improving efficiency using Dynamic Programming

A working knowledge of the Dynamic Programming pattern

Lifetime Discount 50% OFF

Standard

 $29.92 

$14

.99

per mo,

billed annually ($179)

4 interest-free payments

Module 7

Content (Module 8)
Module 9

Module 7

Content (Module 8)
Module 9

Lifetime Discount 50% OFF

Standard

 $29.92 

$14

.99

per mo,

billed annually ($179)

4 interest-free payments