Greedy Techniques

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.

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) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

This lesson will cover Breadth First Search + PYQs.

Breadth First Search + PYQs (in Hindi)

Strategy to Crack Graph Algorithms - GATE (in Hindi)

Graph and its Representation : Adjacency matrix (in Hindi)

Depth First Search + PYQs (in Hindi)

Topological Ordering + GATE PYQs (in Hindi)

Please Login To Continue

Breadth First Search + PYQs (in Hindi)

Sweta Kumari

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

1

2

3

4

5

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

Tests & practice

More from Sweta Kumari

Padho, Khelo and Crack Karo - Database Management System

Sweta Kumari

Practice Data Link Layer with Shortcut Tricks - GATE 2020

Sweta Kumari

Most Challenging Questions Of Compiler Design

Sweta Kumari

Understand Theory of Computation through PYQs - GATE 2020

Sweta Kumari

INFOSYS Previously Asked Questions | Code : HELLOSONU01

Sweta Kumari

Shortcuts To Calculate Complexity of Recurrence Relations

Sweta Kumari

Similar Plus Courses

Detailed course on Capacitors for NEET 2025

Prateek Jain

Complete Course on Disaster Management - UPSC CSE - GS

Sumit Konde

Phoenix All Star Fastrack Course on Physics for NEET 2025

Anubhav Shrivastava