- Comparison of Algorithm and Program
- Characteristics of Algorithm
- How to Write Algorithm
- How to Analyse Algorithm
- Analyze Algorithm by Frequency Count Method Part 1
- Analyze Algorithm by Frequency Count Method Part 2
- Analyze Algorithm by Frequency Count Method Part 3
- Classes of Functions and Growth Rate
- Asymptotic Notation Part 1
- Asymptotic Notation Part 2
- Asymptotic Notation Part 3
- Properties of Asymptotic Notations
- Exercises Using Properties of Asymptotic Notations - Part 1
- Exercises Using Properties of Asymptotic Notations - Part 2
- Comparing Functions
- Best Case, Worst Case and Average Case of Algorithm

- Recurrence Relation for Decreasing Function Part 1
- Recurrence Relation for Decreasing Function Part 2
- Recurrence Relation for Decreasing Function Part 3
- Summary of Decreasing Function
- Tree Method to Analyze Recurrence Relation
- Recurrence Relation for Dividing Function Part 1
- Recurrence Relation for Dividing Function Part 2
- Recurrence Relation for Dividing Function Part 3
- Recurrence Relation for Dividing Function Part 4
- Master's Theorem
- Exercises Solved Using Master's Theorem
- More Examples of Recurrence Relations Part 1
- More Examples of Recurrence Relations Part 2

- Binary Search Fundamentals
- Binary Search Non Recursive Algorithm
- Binary Search Recursive Algorithm
- Gate Questions on Binary Search
- Merge Sort Part 1
- Merge Sort Part 2
- Time Complexity of Merge Sort
- Quick Sort Part 1
- Quick Sort Part 2
- Quick Sort Part 3
- Quick Sort Part 4
- Time Complexity of Quick Sort
- Comparision of Merge Sort and Quick Sort
- Gate Questions on Quick Sort Part 1
- Gate Questions on Quick Sort Part 2
- Gate Questions on Quick Sort Part 3

- Knapsack Problem by Greedy Method Part 1
- Knapsack Problem by Greedy Method Part 2
- Optimal Merge Patterns
- Job Sequencing with Deadlines
- Minimum Cost Spanning Tree of a Graph Using Kruskal's Algorithm Part 1
- Minimum Cost Spanning Tree of a Graph Using Kruskal's Algorithm Part 2
- Minimum Cost Spanning Tree of a Graph Using Prim's Algorithm Part 1
- Minimum Cost Spanning Tree of a Graph Using Prim's Algorithm Part 2
- Gate Questions on Graph Part 1
- Gate Questions on Graph Part 2
- Gate Questions on Graph Part 3
- Gate Questions on Graph Part 4
- Prim's Algorithm
- Shortest Distance Algorithm Part 1
- Shortest Distance Algorithm Part 2
- Huffman Coding for Data Compression
- Gate Question on Huffman Coding

- Dynamic Algorithm Introduction
- All Pair Shortest Path Algorithm Part 1
- All Pair Shortest Path Algorithm Part 2
- LCS Problem
- Bellman Ford Algorithm Part 1
- Bellman Ford Algorithm Part 2
- Matrix Chain Multiplication Part 1
- Matrix Chain Multiplication Part 2
- Matrix Chain Multiplication Part 3
- Multistage Graph Part 1
- Multistage Graph Part 2
- Knapsack Problem Using Dynamic Method Part 1
- Knapsack Problem Using Dynamic Method Part 2
- Travelling Salesman Problem Introduction
- Travelling Salesman Problem Using Dynamic Method

- P and NP class problems
- Decision Problem and Optimization Problem
- Reducing One Problem to Other Problem
- NP Hard and NP Complete
- Prove that a Clique problem is NP Complete Part 1
- Prove that a Clique problem is NP Complete Part 2
- Gate questions on NP Completeness Part 1
- Gate questions on NP Completeness Part 2

Professor Sameer Velankar has perceived degree in Bachelor of engineering with proficiency in this field for over 25 years. He has mastered subjects like Computer and Information with technology Programming and data structures as well. He adds up more to his experience of teaching with subjects like Algorithms, Automata theory, Data base management. Over 25 years he has also been teaching Computer organization and architecture with Java programming. His skills and knowledge about subjects like Python programming, web programming, and machine learning has helped various students to achieve their learning goals. He focuses on interactive and communicative learning. He quotes by saying "Teacher does one percentage of teaching but gives out 99 percentage of motivation and inspiration to all students." as he has been teaching through this motto all these years. Currently he works as a professor and founder at Glorious academy coaching classes in mulund West. He is a well qualified and organised professional who always plans at teaching with most effective methods of learning for students.

We help you in unlocking your professional careers

- Career Driven Content
- 1:1 Mentoring Sessions
- Internships
- Mock Interviews & Placement Support

- Unlimited Video Access
- Mock Tests and Quizzes
- Query Discussion Forum
- Live Doubt Solving Sessions