(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. This topic cover numercial part in gate exam.

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

Course Overview : Gate CS & IT

This lesson is all about topic covered in gate exam. In this , topic covered in this chapter will be covered.

So, you will able to understand how important is this subject in Gate

Topic Covered : Greedy Algorithm (Gate CS and IT)

This lesson is all about mark distribution in gate exam. So, we have seen previous 10 year mark distributon for subject Algorithm. As you will see, the average mark for algorithm is 13 marks. And the highest mark asked in gate is 25.

So, you will able to understand how important is this subject in Gate

Mark Distribution (Gate CS & IT)

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.

Greedy algorithm : Introduction (Gate CS and IT)

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

Fraction Knapsack Problem : (Gate CS & IT)

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 : Gate CS & IT

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 : Part 1 (Gate CS and IT)

Huffman Coding Part II : (Gate CS & IT)

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 Algorithm : Gate CS and IT

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 : Gate CS and IT

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

Kruskal Algorithm (Gate CS and IT)

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 (Gate CS and IT)

Analysis of Differeny Greedy Algorithms ( Shorts Notes) : Gate CS & IT

Hello friends, 

So we have all the topic that asked in Gate exam. Now, we start from the previous year question asked in Gate . Even, we have solutions too for your help.

It will help you to clearify your doubt and solve different variant of various topics.

Previous Year Question- I

Previous Year Questions -II

Previous Year Question - III

Previous Year Question -IV

Previous Year Question - V

Previous Year Question - VI

Previous Year Question- VII

Previous Year Question - VIII

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

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)

 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

An algorithm is a step by step procedure to solve a problem.A problem can have multiple algorithms.Every algorithm is analysed for its performance on parameters like space and time and then the best one is selected to solve the problem.

(Hindi) Analysis of Algorithms

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

(Hindi) Greedy Approach : GATE

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

21 lessons • 3h 2m

Invalid Date

NaN

Course Overview : Gate CS & IT

Invalid Date

NaN

Topic Covered : Greedy Algorithm (Gate CS and IT)

Invalid Date

NaN

Mark Distribution (Gate CS & IT)

Invalid Date

NaN

Greedy algorithm : Introduction (Gate CS and IT)

Invalid Date

NaN

Fraction Knapsack Problem : (Gate CS & IT)

Invalid Date

NaN

Job Sequence With Deadline : Gate CS & IT

Invalid Date

NaN

Huffman Coding : Part 1 (Gate CS and IT)

Invalid Date

NaN

Huffman Coding Part II : (Gate CS & IT)

Invalid Date

NaN

Dijkstra Algorithm : Gate CS and IT

Invalid Date

NaN

Prim's Algorithm : Gate CS and IT

+ See all lessons