Introduction to Data Structures and Algorithms 
Introduction to Data Structures and Algorithms
by NPTEL / Naveen Garg
Video Lecture 1 of 40
5 ratings
Views: 5,462
Date Added: April 19, 2009

Lecture Description

This video lecture, part of the series Data Structures and Algorithms by Prof. Naveen Garg, does not currently have a detailed description and video lecture title. If you have watched this lecture and know what it is about, particularly what Computer Science topics are discussed, please help us by commenting on this video with your suggested description and title. Many thanks from,

- The CosmoLearning Team

Course Index

Course Description

The objective of the course is to familiarize students with basic data structures and their use in fundamental algorithms. Course contents: Introduction to object oriented programming through stacks, queues and linked lists. Dictionaries: skip-lists, hashing, analysis of collision resolution techniques. Trees, traversals, binary search trees, optimal and average BST's. 2-4 trees and red-black trees. Tries and pattern matching. Priority queues and binary heaps. Sorting: merge, quick, radix, selection, heap. Graphs, Breadth first search and connected components. Depth first search in directed and undirected graphs and strongly connected components. Spanning trees: Prim's and Kruskal's algorithm, union-find data structure. Dijkstra's algorithm for shortest paths, shortest path tree. Directed acyclic graphs: topological sort and longest path.


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)