Algorithms and Data Structures Tutorial
Prerequisites
In order to under the concept of Algorithms and Data Structures Tutorial,reader must have a basic concept of C language. Even though you don’t have we are going to provide basic C Programming concepts. we appreciate you if first look in this course
Algorithms Tutorial list of Topics
- Introduction to Algorithm as Technology
- Time complexity And Space complexity Performance Analysis
- Amortized Analysis | Techniques used in Amortized Analysis
- Asymptotic Notation | Big oh notation | Omega notation | Theta notation
- Recurrences | Master Method theorem
- Divide and conquer
- Fibonacci Search:
- Quick sort
- Disjoint sets
- Disjoint Sets Representation
- Greedy method
- Job sequencing with deadlines
- Minimum cost spanning trees using Kruskal’s Algorithms
- Single source shortest path problem using Dijkstra’s Algorithms
- Optimal Merge Patterns | Two way merge pattern
- Dynamic Programming
- Matrix chain multiplication
- 0/1 knapsack problem
- All Pairs Shortest Path Problem Using Floyd Warshall Algorithm
- Backtracking
- N queen problem
This tutorial is contributes by A S KARTHIK Senior Software Engineer if you find any mistake please comment below in comment section
Topic : Algorithms and Data StructuresTutorial