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

Monika Dubey

This course will cover Algorithm Designing Approaches with concepts, problems, and their Solutions.

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) Dijkstra's and Bellman-Ford Algorithm (Single Source Shortest Path Algorithm)

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

Concept of Greedy Approach and Course Overview

Lesson-1 Concept of Greedy Approach (in Hindi)

Applications of Greedy Approach and Path Finding Algorithm

Lesson-2 Concept of Singal Source Shortest Path (in Hindi)

Lesson-3 Dijkstra's Algorithm (in Hindi)

Lesson-4 Dijkstra's Algorithm Practice Problem (in Hindi)

Trick to Solve Dijkstra's Algorithm Problem

Lesson-5 Trick to Solve Dijkstra's Algorithm Problem (in Hindi)

Lesson-6 Bellman–Ford Algorithm (in Hindi)

GATE Previous Year Questions Dijkstra's Algorithm

Lesson-7 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)

Lesson-8 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)

Lesson-9 GATE Previous Year Questions (in Hindi)

Lesson-10 GATE Previous Year Questions (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

10 lessons • 1h 28m

Invalid Date

NaN

Lesson-1 Concept of Greedy Approach (in Hindi)

Invalid Date

NaN

Lesson-2 Concept of Singal Source Shortest Path (in Hindi)

Invalid Date

NaN

Lesson-3 Dijkstra's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-4 Dijkstra's Algorithm Practice Problem (in Hindi)

Invalid Date

NaN

Lesson-5 Trick to Solve Dijkstra's Algorithm Problem (in Hindi)

Invalid Date

NaN

Lesson-6 Bellman–Ford Algorithm (in Hindi)

Invalid Date

NaN

Lesson-7 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-8 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-9 GATE Previous Year Questions (in Hindi)

Invalid Date

NaN

Lesson-10 GATE Previous Year Questions (in Hindi)