Algorithmic Design and Techniques
half-circle
vector

Algorithmic Design and Techniques

Highlights

In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming.

This course will cover theories, including:

  • how to sort data and how it helps for searching;
  • how to break a large problem into pieces and solve them recursively;
  • when it makes sense to proceed greedily;
  • how dynamic programming is used in genomic studies.

You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

About the Course Provider

edX was established by Harvard and MIT to provide the highest quality education and serves as a leading worldwide online learning platform.

Course by

  • self
    Self paced
  • domain
    Domain IT & Computer Science
  • subs
    Monthly Subscription
    Course is included in
    1. Professional @ AED 149 + VAT
    2. Starter @ AED 99 + VAT
  • fee
    Buy Now AED 529 + VAT
  • language
    Language English