What you'll learn
- Basic Java Script
Algorithm Design Techniques : Live problem solving in Java Script
Algorithms are everywhere! One great algorithm applied sensibly can result into a System like GOOGLE!
Larry Page, founder of google designed “Page Rank” algorithm that is behind the search in google. That is why when we search on google we generally find the most relevant result on the First Page itself.
Every Computer Programmer should learn how to design algorithms which are not only correct but also efficient in terms of
TIME and SPACE!
Completer scientists have worked from 100s of years !! - (Put images of some of the scientists…)
And derived some of the techniques that can be applied to write and design algorithms!
So Why to reinvent the wheel ??
Let’s go through some of the most famous algorithm design techniques in this course!!
Once you will come to know these design techniques It will become very easy for you to approach a problem by identifying which technique to apply to solve that correctly and efficiently.
We will start this course with some measurement techniques in algorithms that is called complexity analysis so that we can measure -
The time and space in an algorithm when we design that.
Then we will start with understanding recursion and deep dive into that.
Recursion is the base of any algorithm design … because most of the algorithms has to be solved using recursion!
Recursion is executed in computers in a very special way using stack frames… we will understand all that..
There are many types of recursion and we will have a look into that.
We will solve some classic problems like the Tower of Hanoi, Binary subtree… to understand the recursion deeply…
And WE WILL WRITE THE CODE LINE BY LINE IN JAVA !! To make it very easy to understand and code…
Then we will move into another design technique backtracking !!
Backtracking algorithms are enhanced recursion where we can revert our decision from inside a recursion…
We will understand how to Identify and approach this kind of problems..
Also, we will solve some classical problems
Rat In Maze, NQueens, KnightsTour problems… and Code them LINE by LINE …
Then, We will then move to the next section
Divide and Conquer… Greedy algorithms
And will take the same approach !! To understand identify and Solve some problems… and code some classic problems.
Then there will be a very important section! Dynamic programming
That is not only important for Algorithms design but also, Interviews
This is a very favorite paradigm for the interviewer to ask questions from - We will solve a lot of problems in section along with code… and understand how to approach this kind of problem!!
All in all!
By the end of this course -
1. You will understand how to design algorithms
2. A lot of coding practice and design live problems in Java
3. Algorithm Complexity analysis
If you are preparing for your coding Interview or doing competitive programming
This course will be a Big help for you!
I think this is enough to create the THRILL !! I welcome you to the course and I am sure this will be fun!!
If it does not - It comes with a 30 Days money-back guarantee so don’t think twice to give it a shot…
Welcome Again !! And See you in the course.
Who this course is for:
DOWNLOAD NOW !