Data Structures

B.Tech. (CSE)Third Semester 

DATA STRUCTURES 

UNIT – I

Data representation: Introduction, linear lists, formula based representation, indirect addressing, simulating pointers,
comparisons and applications. Introduction to running time analysis, space complexity analysis, Arrays, matrices, sparse
matrices.

UNIT – II

Linked lists: Creation of single linked list, double linked list, circular linked list, and operations on it.
Stacks: definitions, operations and applications, array and linked representation of stacks.
Queues: definitions and operations. Array and linked representation of queues. Applications.

UNIT – III

Graphs: Definitions and representation of graphs. Graph Traversals. Applications.
Trees: definitions and properties, representation of binary trees, operations. Binary tree traversal.AVL trees and
operations on AVL trees, B+ trees, operations on B+ trees and applications.

UNIT – IV

Searching: Linear search, Binary search, Fibonacci Search
Hashing: Various types hashing, and different collision resolution techniques.

UNIT –V

Introduction to Sorting: Insertion Sort, Selection Sort, Bubble Sort, Merge sort, Quick Sort, Heap Sort, Bucket Sort,
Radix Sort, Shell Sort, Topological Sorting.


Text Books:

1. Data Structures. Algorithms and Applications in C++, S.Sahani, Tata Mc-Graw Hill.
2. Data Structures and Algorithms in C++, Adam Drozdek, Third Edition, Cengage Learning

Reference Books:

1. Introduction to Algorithms, Thomas H. Cormen, MIT Press
2. Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, Second Edition,
Narasimha Karumanchi, Careermonk Publications
3. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Third Edition