CS3301 Data Structures
Important Topics
UNIT 1
❖ Abstract data types / List / Polynomial ADT
❖ Application of lists / Multilists / Radix Sort
❖ Implementation of Array / Linked List
❖ Single / Doubly / Circularly Linked List
UNIT 2
❖ Stack / Queue ADT & its Applications / Operations
❖ Circular Queue / DeQueue
❖ Evaluating Arithmetic Expression
❖ Applications of Queue / InFix to PostFix
UNIT 3
❖ Tree Traversal / AVL Trees
❖ Binary / Binary Search Tree ADT
❖ Priority Queue / Binary Heap
UNIT 4
❖ Prim’s / Kruskal’s / Dijkstra’s Algorithm
❖ Minimum Spanning Tree / B+ Tree / Types of Graphs
❖ Breadth / Depth First Traversal
❖ Topological Sort / Euler Circuit
UNIT 5
❖ Linear / Binary Search
❖ Bubble / Insertion / Selection / Merge / Shell Sort
❖ Hashing / Rehashing / Extendible Hashing