CSE-301 DATA STRUCTURES

• Data Types:Data structures and Abstract Data Types.
• Arrays and recursion:Axiomatization, Ordered lists, Sparse matrices, Representation of arrays.
• Stacks and queues:Fundamentals, A Mazing problem, Evaluation of expressions, Multiple stacks and queues.
• Linked lists:Linked lists, Polynomial addition, Doubly linked lists.
• Strings: Representation, Pattern - matching algorithm.
• Trees:Basic terminology, Binary Trees, Its represntation and traversal, threaded binary tree. AVL tree : searching, insertion, deletion, B-tree, Application of trees with set representation.
• Hashing:Hash table, Hash function, Collision-resolution strategy.
• Graphs:Definition and terminology, graph representations, Traversal of graph, shortest path algorithm like Dijkastra and Floyd.
• Sorting and searching:Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Bubblu sort, Radix sort, Heap sort, Linear search, Binary Search, Fibonacci search.
• Programming Methodology:Need for structural approach to programming. Top-down and Bottom-up approach.

TEXTBOOKS

1. E. Horwitz and S. Sahani: Fundamentals of Data Structures in PASCAL, Galgotia Publications(New Delhi).

2. Tanenbaum, Langsam and Augestein: Data Structure using C, PHI.

REFERENCE BOOKS

3. Data Structures & Algorithms by Tremblay & Sorenson

4. Pascal Plus Data Structures - Algorithms and Advanced Programming Dale & Lilly, TMH

5. Data Structures and Program Design, PHI

© Copyright National Institute of Science & Technology, Berhampur, Orissa, India
Website Maintained by NIST Training & Consultancy Services