(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

The Greedy method is one of the optimization problem. We will see different types of algorithms for different real time problem. In this course, Fractional knapsack prolem , shortest path , Minimum spanning tree are included.

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

English

Greedy Algorithms: 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

This chapters is all about different type of greedy algorithm.that can be used in real time example. There are so many algorithm but we only covers the important for the Gate exam.. its include Fractional knapsack problem , Job deadline , dijkstra’s , prim and krushkal and many more..

Chapter Overview

This lesson is all about the introduction of greedy algorithm. In this chapter we have seen the defination of greedy algorithm. Comparison of greedy algo with dynamic programming , impact of this algo in real time.

Introduction of Greedy Algorithm

Fractional knapsack problem is one of the greedy algorithm. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Fractional Knapsack Problem

Job sequence is the algo which totally shown in your real world. Even we use this methodology. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Job Sequence with Deadline

Dijkstras algorithm is the greedy algorithm which help us to find the shortest path between two nodes. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Dijkstra’s Algorithm

Bellman ford algo is the advance part of dijkstra algorithm. But it is not used mostly beacuse it is slower than dijkstra.. but advantage is that it can also useful for negative value. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Bellman Ford Algorithm

Prim’s algorithm is the greedy approach to find the minimum spanning tree in between two nodes. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Prim’s Algorithm

Krushkal algo is part of minimum spanning tree to find the minimum cost to visit all the nodes. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Krushkal Algorithm

Huffman coding or optimal merge or prefix techniques ia the greedy algorithm which is used to save from data compression. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Huffman Coding

This is the last chapter  where we have cover all the algorithm once again . But in the short manner . This video will summerize your study in greedy algo once again. It is one of the importamt topic related to Gate . We will cover the algorithm , coding behavior , defination, examples and previous question asked in Gate ..

Analysis of Different Greedy algorithm

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

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

Invalid Date

NaN

Chapter Overview

Invalid Date

NaN

Introduction of Greedy Algorithm

Invalid Date

NaN

Fractional Knapsack Problem

Invalid Date

NaN

Job Sequence with Deadline

Invalid Date

NaN

Dijkstra’s Algorithm

Invalid Date

NaN

Bellman Ford Algorithm

Invalid Date

NaN

Prim’s Algorithm

Invalid Date

NaN

Krushkal Algorithm

Invalid Date

NaN

Huffman Coding

Invalid Date

NaN

Analysis of Different Greedy algorithm