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

Sourav Newatia

This course will cover all the introduction, coding behaviour, complexities and examples with interview question for Directed Graphs.

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

Directed Graphs

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Here the 2nd lesson that is Directed graph. This lesson gives you a overview about the various types of graph used .

Overview

It is the algorithm that is used to find the shortest path between two nodes. We will cover the introduction , algorithm with examples . We will also see the coding behaviour and complexities.. we will also see how it is used in real word i.e applications .

Dijkstra’s Algorithm

It is the algorithm that is used to find the shortest path between two nodes. It is as general as Dijkstra algorithm but the main advantages is that it cover negative weight also. We will cover the introduction , algorithm with examples . We will also see the coding behaviour and complexities.. we will also see how it is used in real word i.e applications .

Bellman Ford Algorithm

It is the algorithm that is used to find the minimum spanning tree weights. It can be directed or undirected graph . We will cover the introduction , algorithm with examples . We will also see the coding behaviour and complexities.. we will also see how it is used in real word i.e applications .

Prim’s Algorithm

It is the algorithm that is used to find the minimum spanning tree weights. It can be directed or undirected graph . The only difference b/w krushkal and prim is that the complexities and way of solving numerical. We will cover the introduction , algorithm with examples . We will also see the coding behaviour and complexities.. we will also see how it is used in real word i.e applications .

Krushkal’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 cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

5 lessons • 44m

Invalid Date

NaN

Overview

Invalid Date

NaN

Dijkstra’s Algorithm

Invalid Date

NaN

Bellman Ford Algorithm

Invalid Date

NaN

Prim’s Algorithm

Invalid Date

NaN

Krushkal’s Algorithm