 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

Greedy Algorithms is not an algorithm but an algorithmic paradigm where we are greedy about the current best and hope that current best will lead to global best.This course discusses greedy algorithms as an algorithmic paradigm and some problems that are solved using greedy algorithms

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

Hindi

(Hindi) Greedy Algorithms

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

In this lesson,basics of greedy algorithms are discussed.

Introduction (in Hindi)

In this lesson,Knapsack problem and it's questions are discussed

Knapsack Problem (in Hindi)

In Task scheduling Problem,n number of tasks are scheduled in a order to get maximum profit.This lesson discusses Task scheduling Problem with examples

Task Scheduling Problem (in Hindi)

Huffman coding is a lossless compression technique.This lesson discusses huffman coding along with an example

Huffman Coding (in Hindi)

Optimal Merge pattern is a problem where we have to merge 'n' number of files into one file by taking two files at a time.This lesson discusses optimal Merge pattern with an example.

Optimal Merge Pattern (in Hindi)

Kruskal's Minimal Spanning Tree Algorithm is used to find aminimal spanning tree from a given Graph.In this lesson Kruskal's algorithm is discussed along with examples.

Kruskal's Minimal Spanning Tree Algorithm (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)

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

Sourav Newatia

Divide and conquer is an algorithm design paradigm based on multi-branched recursion. In this course, the educator will cover all the D & C methods like linear search, Binary search, Merge sort, Quick sort, Matrix multiplication, Integer multiplication, Min-Max Algorithm, set Algorithms, Tree representation, Priority Queue, and Heap.

Divide and Conquer Methods: GATE (CS and IT)

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

6 lessons • 1h 8m