NIT Delhi Syllabus B Tech for Data Structures


NIT Delhi Syllabus B Tech for Data Structures

DATA STRUCTURES              

Introduction: complexity expression in different notations.  abstract data types: lists, stacks and queues.

trees: binary trees, binary search trees, introduction to AVL trees. hashing: hash table organization, hash

functions, open hashing, closed hashing. priority queues: the model and binary heap. sorting: insertion

sort, shell sort, heap sort, merge sort, quick sort and bucket sort methods. graph algorithms: topological

sort, shortest path algorithms, network flow problems, minimum spanning trees.




1. Data Structures and Algorithm Analysis in C++, MARK ALLEN WEISS, Pearson, 2000

* * *

Leave a Comment