Deep Dive into Algorithms
What you’ll learn
-
Students will learn various Backtracking Problems along with implementation using C language
-
Students will learn various Dynamic Programming Problems along with implementation using C language
-
Students will learn various Graph Algorithms along with implementation using C language
-
Branch and Bound
-
Divide and Conquer
-
Greedy Algorithm
-
Pattern Matching
-
Searching and Sorting
Requirements
-
Recursion
Description
An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. An algorithmic paradigm is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.
- How does one calculate the running time of an algorithm?
- How can we compare two different algorithms?
- How do we know if an algorithm is `optimal’?
Who this course is for:
- Programmers who are interested to learn algorithms
