OBJECTIVES
• To learn how the choice of data structures impacts the performance of programs.
• To study specific data structures such as arrays, linear lists, stacks, queues, hash tables,
binary trees,binary search trees, heaps and AVL trees.
• To learn efficient searching and sorting techniques.
Unit-1
Introduction: Basic Terminology, Data structure, Time and space complexity, Review of
Array, Structures, Pointers.
Linked Lists: Dynamic memory allocation, representation,Linked list insertion and deletion,
Searching, Traversing in a list, Doubly linked list, Sparse matrices.
Unit-2
Stack: Definition, Representation, Stack operations, Applications (Infix–Prefix–Postfix
Conversion & Evaluation, Recursion).
Queues:Definition, Representation, Types of queue, Queue operations, Applications.
Unit-3
Trees:Tree Terminologies, General Tree, Binary Tree, Representations,Traversing,
BST,Operations on BST, Heap tree, AVL Search Trees, M-way search tree, Applications of all
trees.
Unit-4
Sorting:Exchange sorts, Selection Sort, Bubble sort, Insertion Sorts, Merge Sort, Quick Sort,
Radix Sort, Heap sort.
Searching: Linear search, Binary search.

REFERENCES

1. Ellis Horowitz, Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia Publications,

2000.

2. Sastry C.V., Nayak R, Ch. Rajaramesh, Data Structure & Algorithms, I.K.International

Publishing House Pvt.Ltd, New Delhi.