The first course in seires of Data Structures and Algorithms Specialization
The class covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming, and many others, You will learn how to sort and search data, how to break a large problem into pieces and solve them recursively; how to pack your knapsack using greedy algorithms, and how to search for similarities between genes using dynamic programming. You will practice solving computational problems, designing new algorithms, and implementing them as efficient software tools.
Offered By UNIVERSITY OF CALIFORNIA SAN DIEGO from Coursera
STATUS: On going