DSA IIT Delhi

What are the content included in Data Structures And Algorithms subject of CSE department of IIT Delhi?

[Arun Vats]

As you want I am here giving you course content of Data Structures And Algorithms subject of CSE department of IIT Delhi .

DSA course content:

Introduction to Data Structures and Algorithms
Stacks
Queues and Linked Lists
Dictionaries
Hashing
Trees
Tree Walks / Traversals
Ordered Dictionaries
Deletion
Quick Sort
AVL Trees
AVL Trees
Trees
Red Black Trees
Insertion in Red Black Trees
Disk Based Data Structures
Case Study Searching for Patterns
Tries
Data Compression
Priority Queues
Binary Heaps
Why Sorting
More Sorting
Graphs
Data Structures for Graphs
Two Applications of Breadth First Search
Depth First Search
Applications of DFS
DFS in Directed Graphs
Applications of DFS in Directed Graphs
Minimum Spanning Trees
The Union
Prims Algorithm for Minimum Spanning Trees
Single Source Shortest Paths
Correctness of Dijkstras Algorithm
Single Source Shortest Paths

We having lecture videos on these topics also.

Address:
Indian Institute of Technology Delhi
Hauz Khas
New Delhi, Delhi 110016

Map:

[MAP]Indian Institute of Technology Delhi[/MAP]

Can you provide me the syllabus for Data Structures and Algorithms - Video course offered by the Department of Computer Science and Engineering IIT Delhi through National Programme on Technology Enhanced Learning (NPTEL)?

[sumit]

The syllabus for Data Structures and Algorithms - Video course offered by the Department of Computer Science and Engineering IIT Delhi through National Programme on Technology Enhanced Learning (NPTEL) is as follows:

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


Syllabus Data Structures and Algorithms - Video course IIT Delhi through NPTEL