Tarun S

In this versatile course we are going to discuss about most needy subject Algorithm Design and Analysis and understand how can we encounter any problem by this

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) A Guide to understand Algorithm Design and Analysis

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

Course Overview of Algorithm design and Analysis

Course Overview (in Hindi)

Introduction to Algorithm design and Analysis

Introduction to Algorithm Design and it's Concept (in Hindi)

Concept of Time & Space Complexity - 1 (in Hindi)

Concept of Time and Space Complexity - 2 (in Hindi)

Divide and Conquer Technique - 1 (in Hindi)

Binary search on the basis of Divide and Conquer technique

Divide and Conquer technique - 2

Introduction of Greedy Algorithm technique

Greed Algorithm technique - 1

Huffman coding algo and compressed tree by Huffman code

Greedy Algorithm technique-2(Huffman coding)

Description of Minimum Spanning tree and approach to solve it

Greedy Algorithm technique-3(Minimum Spanning tree & Prim's algorithm)

Minimum Spanning tree with the help of Kruskal approach

Greedy Algorithm technique-4(Kruskal's 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 48m

Invalid Date

NaN

Course Overview (in Hindi)

Invalid Date

NaN

Introduction to Algorithm Design and it's Concept (in Hindi)

Invalid Date

NaN

Concept of Time & Space Complexity - 1 (in Hindi)

Invalid Date

NaN

Concept of Time and Space Complexity - 2 (in Hindi)

Invalid Date

NaN

Divide and Conquer Technique - 1 (in Hindi)

Invalid Date

NaN

Divide and Conquer technique - 2

Invalid Date

NaN

Greed Algorithm technique - 1

Invalid Date

NaN

Greedy Algorithm technique-2(Huffman coding)

Invalid Date

NaN

Greedy Algorithm technique-3(Minimum Spanning tree & Prim's algorithm)

Invalid Date

NaN

Greedy Algorithm technique-4(Kruskal's Algorithm)