SYLLABUS

UNIT – 1 : LINEAR DATA STRUCTURES
Abstract Data Types – Internal Representation of Primitive Data Structures – One
Dimensional and Multi-Dimensional Arrays – linear lists – Singly, doubly, Circular
linked lists – Applications.
Practical:
• Single and Multidimensional arrays
• Singly, Doubly and Circular Linked Lists
UNIT – 2 : STACKS AND QUEUES
Stack: Representations – Operations – Implementations – Applications.
Queue: Representations – Operations – Implementations – Types – Applications.
Practical:
• String reverse operations and Expression evaluation
• Circular Queue and Priority Queue
UNIT – 3: TREES
Representations – Types – Binary Search Trees (BSTs) – AVL Tree – Operations:
Search, Traversals, Rotations – Balanced BSTs- Splay trees – B-trees – Binary Heaps.
Practical:
• Traversal operation
• AVL Tree rotations
• Query and Update operations on Balanced BSTs
UNIT – 4: SORTING, SEARCHING AND HASHING TECHNIQUES
Linear and Binary Search – Bubble Sort – Insertion Sort – Merge Sort – Bucket Sort
– Quick Sort – Heap sort – Hashing techniques – Dictionaries – Hash function – Collision
– Separate chaining – open addressing.
Practical:
• Quick and Heap Sort
• Binary Search and Hashing
UNIT – 5: GRAPHS
Representation – Types – Operations – Prim’s, Kruskal algorithms – Dijikstra’s
algorithm – Connected and Biconnected Components.
Practical:
• BFS and DFS algorithms
• Minimum Spanning Tree and shortest path algorithms