Pursuing B.E. in University Visvesvaraya College of Engineering, Bangalore.

Kruthi Shankar Hegde

All about Algorithms from introduction to problem solving for Gate covering all the important topics on algorithm for Gate.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

Hindi

(Hindi) Design and Analysis of Algorithms for GATE

Greedy Techniques

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Overview video about design and analysis of Algorithm.

OVERVIEW (in Hindi)

Definitions of Algorithms, Characteristics of Algorithm, Important problem types

Introduction To Algorithm (in Hindi)

Algorithm Designing Techniques (in Hindi)

Algorithm Analysis
Time complexity, Space complexity in detail.

Algorithm Analysis(in Hindi)

How to find time complexity of the given code, explained in detail

How To Find Time Complexity(in Hindi)

Asymptotic notations, definitions, Graph representation.

Asymptotic Analysis(in Hindi)

Explanation about Brute Force approach. 
Detailed explanation of linear search and selection sort

Brute Force : Linear Search, Selection Sort(in Hindi)

Detailed explanation of Divide and conquer
Merge Sort : Implementation, Algorithm, Time complexity

Divide and Conquer : Merge Sort(in Hindi)

Detailed explanation of decrease and conquer
Binary search: Implementation, Algorithm, Time complexity

Decrease and Conquer: Binary Search(in Hindi)

Greedy Algorithm.
Detailed explanation of Prim's and
Problem on Prim's Algorithm

Greedy Technique : Prim's Algorithm(in Hindi)

Greedy Technique: Kruskal's Algorithm(in Hindi)

Problem Solving for Gate(in Hindi)

Master's Theorem Explanation
And problems

Master's Theorem for GATE(in Hindi)

Problems on Master's Theorem(in Hindi)

Detailed explanation of Dijkstra Algorithm, its Implementation

Dijkstra Algorithm(in Hindi)

Problems on Dijkstra for GATE(in Hindi)

Warshall Algorithm(in Hindi)

Insertion Sort 
Implementation,
Example,
Algorithm,
Time complexity,
Advantages.

Decrease and conquer: Insertion Sort(in Hindi)

Decrease and Conquer: Breadth First Search

Depth First Search (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will discuss Graph Algorithms in detail with concepts first and then previous year questions on this topic. So, this is a complete course in Graph Algorithms that have a Weightage of 2 marks.

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

This course will cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

(Hindi) Shortest Path Algorithms Practice Questions: GATE (CS and IT)

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

Working Professional | Computer Science Engineer | Developer | Programmer | Cleared GATE Examination

Jaspreet Kaur

This course is about Dynamic programming. It introduce you to what the dynamic programming is, its uses, its various problems and their analysis.

Dynamic Programming: GATE

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses searching algorithms and hashing and its different collision resolution techniques with previous year gate questions

Searching and Hashing for GATE

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

Lessons

21 lessons • 3h 20m

Invalid Date

NaN

OVERVIEW (in Hindi)

Invalid Date

NaN

Introduction To Algorithm (in Hindi)

Invalid Date

NaN

Algorithm Designing Techniques (in Hindi)

Invalid Date

NaN

Algorithm Analysis(in Hindi)

Invalid Date

NaN

How To Find Time Complexity(in Hindi)

Invalid Date

NaN

Asymptotic Analysis(in Hindi)

Invalid Date

NaN

Brute Force : Linear Search, Selection Sort(in Hindi)

Invalid Date

NaN

Divide and Conquer : Merge Sort(in Hindi)

Invalid Date

NaN

Decrease and Conquer: Binary Search(in Hindi)

Invalid Date

NaN

Greedy Technique : Prim's Algorithm(in Hindi)

+ See all lessons