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 cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

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 & ESE

Hindi

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

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

This course will cover Shortest Path Algorithms like Djikstra,Bellman Ford and Floyd Warshall Algorithm.

Strategy to Follow (in Hindi)

Shortest Path Problems With Different Algorithms (in Hindi)

Djikstra Shortest Path Problem : 1 (in Hindi)

Djikstra Shortest Path Problem : 2 (in Hindi)

Bellman Ford Algorithm Problem : 1 (in Hindi)

Floyd Warshall Algorithm Problem : 1 (in Hindi)

Floyd Warshall Algorithm Problem : 2 (in Hindi)

Djikstra Algorithm Problem: 3 (in Hindi)

Disadvantage Of Bellman Ford Algorithm (in Hindi)

Disadvantage Of Djikstra Algorithm (in Hindi)

GATE PYQs : Shortest Path Algorithms (in Hindi)

Bellman Ford Algorithm Problem : 2 (in Hindi)

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 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

My name is Monika Dubey. M.Tech(CSE).Worked  as Asst. Professor. Currently, working as Research Scholar   

Monika Dubey

This course covers Matrix Chain Multiplication- Concept+Practice Question +GATE Previous Year Questions

(Hindi) Matrix Chain Multiplication (Dynamic Programming)

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

Lessons

12 lessons • 2h 20m

Invalid Date

NaN

Strategy to Follow (in Hindi)

Invalid Date

NaN

Shortest Path Problems With Different Algorithms (in Hindi)

Invalid Date

NaN

Djikstra Shortest Path Problem : 1 (in Hindi)

Invalid Date

NaN

Djikstra Shortest Path Problem : 2 (in Hindi)

Invalid Date

NaN

Bellman Ford Algorithm Problem : 1 (in Hindi)

Invalid Date

NaN

Floyd Warshall Algorithm Problem : 1 (in Hindi)

Invalid Date

NaN

Floyd Warshall Algorithm Problem : 2 (in Hindi)

Invalid Date

NaN

Djikstra Algorithm Problem: 3 (in Hindi)

Invalid Date

NaN

Disadvantage Of Bellman Ford Algorithm (in Hindi)

Invalid Date

NaN

Disadvantage Of Djikstra Algorithm (in Hindi)

+ See all lessons