Course details
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). Updated on 17 September, 2019IT, Computing and Technology Related Questions
Courses you can instantly connect with... Do an online course on IT, Computing and Technology starting now.
- JavaScript Full stack web developer virtual internship Virtual Bootcamp + Internship at LaimoonAED 1,449Duration: Upto 30 Hours
- Mastering Your Android Phone Study 365AED 122
AED 833Duration: Upto 4 Hours - GCSE Maths Course LineAED 93
AED 1,763Duration: Upto 11 Hours - MBA IT Project Management Euclea Business SchoolAED 29,384Duration: 15 Months Live virtual classroom
- AED 10,898Duration: 12 Weeks Live virtual classroom
