UNIT DATA STRUCTURE
I Introduc on: Arrays:
Basic Terminology: Array Defini on and Analysis
Elementary Data Organiza on Representa on of Linear Arrays in
Data Structure Opera ons Memory Traversing
Algorithms Complexity Inser on And Dele on in Array
Time-Space Trade off Single Dimensional Arrays
Two Dimensional Arrays
Bubble Sor ng
Selec on Sor ng
Linear Search
Binary Search
Mul dimensional Arrays
Func on Associated with Arrays
Character String in C
Character String Opera ons
Arrays as parameters
Implemen ng One Dimensional Array
II Stacks and Queues: Queues:
Introduc on Representa on of Queues
Opera ons Associated with Stacks Push & Pop Opera ons of queues:
Array representa on of stacks Create
Opera on associated with stacks: Add
Create Delete
Add Front
Delete Empty
Applica on of stacks: Priority Queues
Recursion Heaps
Polish expression & their compila on Dequeue
Conversion of infix expression to prefix
Conversion of infix expression to pos ix
Tower of Hanoi problem
III Recursion: Linked Lists:
Recursive thinking Opera ons on linked list
Recursive Defini on of Mathema cal Formulae Polynomial addi on
Recursive Array Search Header nodes
Recursive Data Structure Doubly linked list
Problem Solving with Recursion Generalized list
Back Tracking Circular linked lists
IV Trees:
Trees-mathema cal proper es
Binary Search Trees and their representa on
Expression evalua on
Complete Binary trees
Extended binary trees
Traversing binary trees
Searching
Inser on and Dele on in binary search trees
Complexity of searching algorithm
Path length
Huffman's algorithm
General trees
AVL trees
Threaded trees
B trees
Trie data structure
V Sor ng: Graphs:
Inser on Sort Sequen al representa on of graphs
Quick sort Adjacency matrices
two-way Merge sort Search and Traversal of graphs:
Heap sort Depth first
Sor ng on different keys Breadth first
External sor ng. Topological sort