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 Problems and thier 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) Greedy Approach : 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

Concept of Greedy Approach (in Hindi)

Job Sequence Problem with Deadlines with Example

Job Sequence Problem with Deadlines (in Hindi)

Knapsack Problem (in Hindi)

Shortest Path Algorithm (in Hindi)

Kruskal's Algorithms (in Hindi)

Prim's Algorithm (in Hindi)

Difference - Kruskal's Algorithms and Prim's Algorithms

Difference - Kruskal's Algorithms and Prim's Algorithms (in Hindi)

Dijkstra's Algorithm with Example (in Hindi)

Bellman-Ford Algorithms (in Hindi)

Haffman Coding (in Hindi)

Humming Code Algorithm with Example (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)

(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

11 lessons • 1h 29m

Invalid Date

NaN

Concept of Greedy Approach (in Hindi)

Invalid Date

NaN

Job Sequence Problem with Deadlines (in Hindi)

Invalid Date

NaN

Knapsack Problem (in Hindi)

Invalid Date

NaN

Shortest Path Algorithm (in Hindi)

Invalid Date

NaN

Kruskal's Algorithms (in Hindi)

Invalid Date

NaN

Prim's Algorithm (in Hindi)

Invalid Date

NaN

Difference - Kruskal's Algorithms and Prim's Algorithms (in Hindi)

Invalid Date

NaN

Dijkstra's Algorithm with Example (in Hindi)

Invalid Date

NaN

Bellman-Ford Algorithms (in Hindi)

Invalid Date

NaN

Haffman Coding (in Hindi)

+ See all lessons