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).
An excellent online course offered by edX: how it works
edX courses consist of weekly learning sequences. Each learning sequence is composed of short videos interspersed with interactive learning exercises, where students can immediately practise the concepts from the videos. The courses often include tutorial videos that are similar to small on-campus discussion groups, an online textbook, and an online discussion forum where students can post and review questions and comments to each other and teaching assistants. Where applicable, online laboratories are incorporated into the course.
edX offers certificates of successful completion and some courses are credit-eligible. Whether or not a college or university offers credit for an online course is within the sole discretion of the school. edX offers a variety of ways to take courses, including verified courses where students have the option to audit the course (no cost) or to work toward an edX Verified Certificate (fees vary by course). edX also offers XSeries Certificates for completion of a bundled set of two to seven verified courses in a single subject (cost varies depending on the courses).
An edX learning programme under Other Experiences
