DATA STRUCTURES

 Unit-I

Review of algorithmic notations , Linear data structures and their sequential storage representation, Representation of stack , Queues, Circular queues and Dequeues, Operations on these data structure, Applications of stack and queue: recursion, infix, prefix and postfix notations and their conversions, using stack priority queue.  

 Unit-II

Linear data structures and their linked representation: Singly linked, circular linked, and double linked lists, insertion and deletion operations on these data structures, Applications of linked lists: Representation of sparse matrix and polynomials.

Unit-III

Representation of binary tree, tree traversal algorithms : In order, preorder, post order (recursive and no n recursive algorithms), Binary search tree, Applications of binary tree, AVL tree and B-trees.  

Unit-IV

Representation of graph, Adjacency matrix , adjacency list and adjacency multi list Graph traversal algorithms, Single source shortest path problem, Minimal spanning tree  

Unit-V

Sorting and searching : Linear , Binary and Fibonacci search, Selection, Bubble , Quick, 2-way merge, Radix and heap sort, Complexity of these algorithms.  

Books

•  An  introduction to data structures with application, J.P. Tremblay and P.G.Sorenson, McGrawill

•  Data structures, Lipschutz, Mcgrawill

•  Data structure using c/c++, Y.Langsam, A.M.Tenebbaum,PHI