Чему вы научитесь
Hello! This is a course of Analysis and Design of Algorithms. This course is for the students who want to learn to write and analyse algorithms. The course begins from the basic definition of algorithms and go on to discuss various paradigms of algorithm design like Divide and Conquer,Greedy Method etc. It presents many classic and interesting problems for the students to solve. Hope you enjoy learning! Thank you.
P.S. This course is still ongoing, new lessons will be announced, as soon as they are created. Checks the news tab for updates.
О курсе
On completion of course students will learn:
1.Analyzing the time complexity of non-recursive and recursive algorithms
2.Divide and Conquer
3. Greedy Approach
4. Dynamic Programming
5.Graph based Problems
6. Backtracking
and many more
Для кого этот курс
Students who wish to learn Algorithms.
Начальные требования
The students are assumed to be well versed with the basic concepts some programming language like C/C++,Java, etc. and has a good grasp of Data Structures and Basic Mathematics.
5