Lecture - 33 Prims Algorithm for Minimum Spanning Trees Video Lecture, IIT Delhi

Home »Computer Science »IIT Delhi » Data Structures And Algorithms



Data Structures And Algorithms

Lecture 33: Prims Algorithm for Minimum Spanning Trees

Embed
Download:   MP4, FLV and 3GP 8474 views

SEE: Guide to Download NPTEL Video Lecture

Lecture Details :

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

Course Description :

Introduction, Stacks, Queues and Linked Lists, Dictionaries, Hashing, Tree Walks/Traversals, Deletion, Quick Sort, AVL Trees, Red Black Trees, Disk Based Data Structures, Priority Queues, Binary Heaps, Sorting, Graphs, Depth First Search(DFS) , Prims Algorithm for Minimum Spanning Trees and Dijkstras Algorithm.

Other Resources :

Syllabus | Citation |

Above free video lectures are presented by IIT Delhi, under NPTEL program, there are still 6000+ iit video lectures are available.

Other Computer Science Courses

» check out the complete list of Computer Science Video lectures          

 

Comments

Post your Comments