Please Login To Continue
Course Overview : Gate CS & IT
Lesson 1 of 21 • 4 upvotes • 7:46mins
Sourav Newatia
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
Greedy Algorithms (Gate CS & IT)
21 lessons • 3h 2m
1
Course Overview : Gate CS & IT
7:46mins
2
Topic Covered : Greedy Algorithm (Gate CS and IT)
6:01mins
3
Mark Distribution (Gate CS & IT)
7:02mins
4
Greedy algorithm : Introduction (Gate CS and IT)
8:01mins
5
Fraction Knapsack Problem : (Gate CS & IT)
12:01mins
6
Job Sequence With Deadline : Gate CS & IT
10:07mins
7
Huffman Coding : Part 1 (Gate CS and IT)
7:13mins
8
Huffman Coding Part II : (Gate CS & IT)
8:07mins
9
Dijkstra Algorithm : Gate CS and IT
13:01mins
10
Prim's Algorithm : Gate CS and IT
11:46mins
11
Kruskal Algorithm (Gate CS and IT)
8:48mins
12
Bellman Ford Algorithm (Gate CS and IT)
8:01mins
13
Analysis of Differeny Greedy Algorithms ( Shorts Notes) : Gate CS & IT
15:00mins
14
Previous Year Question- I
7:28mins
15
Previous Year Questions -II
7:48mins
16
Previous Year Question - III
8:44mins
17
Previous Year Question -IV
7:12mins
18
Previous Year Question - V
7:04mins
19
Previous Year Question - VI
8:17mins
20
Previous Year Question- VII
7:02mins
21
Previous Year Question - VIII
6:01mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
