My name is Monika Dubey. M.Tech(CSE).Worked  as Asst. Professor. Currently, working as Research Scholar   

Monika Dubey

The course discusses Minimum Spanning Tree, Kruskal's Algorithm, Prim's Algorithm and many more concepts.

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) Spanning Tree (MST) - GATE(CS and IT)

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Lesson-1 Introduction (Spanning Tree) (in Hindi)

Lesson-2 Minimum Spanning Tree (in Hindi)

Lesson-3 Kruskal's Algorithm (in Hindi)

Lesson-4 Prim's Algorithm (in Hindi)

Difference between Kruskal's Algorithm and Prim's Algorithm

Lesson-5 Difference between Kruskal's Algorithm and Prim's Algorithm (in Hindi)

Lesson-6 GATE PYQs (in Hindi)

Lesson-7 GATE PYQs (in Hindi)

Lesson-8 GATE PYQs Spanning Tree (in Hindi)

Lesson-9 GATE PYQs Spanning Tree (in Hindi)

Lesson-11 GATE PYQs Spanning Tree (in Hindi)

Lesson-10 GATE PYQs Spanning Tree(in Hindi)

Lesson-12 GATE PYQs Spanning Tree(in Hindi)

Lesson-13 GATE PYQs Spanning Tree (in Hindi)

Lesson-14 GATE PYQs Spanning Tree(in Hindi)

Lesson-15 GATE PYQs Spanning Tree(in Hindi)

Lesson-16 GATE PYQs Spanning Tree(in Hindi)

Lesson-17 GATE PYQs Spanning Tree(in Hindi)

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

In this course , Sweta Kumari will be covering 50 Most Expected Output Programs and PYQs.

(Hindi) 50 Most Expected Output Programs and PYQs - GATE (CS and IT)

In this course, I will discuss Arrays in C with some GATE PYQs along with the basic concepts. The course will be beneficial for GATE Aspirants.

(Hindi) Array in C With Concepts and PYQs: GATE (CS and IT)

This course will cover Queue in Data Structures for GATE (CS & IT) Aspirants. In this course, I will be explaining Queue Operations and its implementation using Array & Linked List.

(Hindi) Queue in Data Structures - GATE (CS & IT)

This course will cover total Previous Year Questions From Tree topic of Data structures asked in GATE Exam.

Lessons

17 lessons • 2h 53m

Invalid Date

NaN

Lesson-1 Introduction (Spanning Tree) (in Hindi)

Invalid Date

NaN

Lesson-2 Minimum Spanning Tree (in Hindi)

Invalid Date

NaN

Lesson-3 Kruskal's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-4 Prim's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-5 Difference between Kruskal's Algorithm and Prim's Algorithm (in Hindi)

Invalid Date

NaN

Lesson-6 GATE PYQs (in Hindi)

Invalid Date

NaN

Lesson-7 GATE PYQs (in Hindi)

Invalid Date

NaN

Lesson-8 GATE PYQs Spanning Tree (in Hindi)

Invalid Date

NaN

Lesson-9 GATE PYQs Spanning Tree (in Hindi)

Invalid Date

NaN

Lesson-11 GATE PYQs Spanning Tree (in Hindi)

+ See all lessons