You will lean about different data structure like array,structure,linked list,stack,queue,tree and graph

Course content
INTRODUCTION TO DATA STRUCTURE:

• Data types â?? primitive and nonprimitive.
• Performance Analysis and Measurement
• (Time and space analysis of algorithms-Average, best and worst case analysis)
• Types of Data Structures- Linear & Non Linear Data Structures.

LINEAR DATA STRUCTURE :

• Representation of arrays.
• Applications of arrays.
• sparse matrix and its representation.
• Stack, Stack-Definitions & Concepts
• Operations On Stacks
• Push Pop and peep
• Applications of Stacks .
• Polish Expression, Reverse Polish Expression.
• Infix to Postfix, Evalution of Expression
• Recursion, Tower of Hanoi.
• Queue:Representation Of Queue.
• Operations On Queue.
• Circular Queue.
• Priority Queue.
• Array representation of Priority Queue.
• Double Ended Queue.
• Applications of Queue.
• Linked List: Singly Linked List
• Doubly Linked list
• Circular linked list.
• Array implementation of Stack
• Array implementation of Queue
• Linked implementation of Stack
• Linked implementation of Queue
• Applications of linked list.

NONLINEAR DATA STRUCTURE :

• Tree-Definitions and Concepts.
• Representation of binary tree.
• Binary tree traversal (Inorder, postorder, preorder).
• Threaded binary tree.
• Binary search trees.
• Conversion of General Trees To Binary Trees.
• Applications Of Trees.
• Some balanced tree mechanism.
• AVL trees, 2-3 trees.
• Height Balanced tree.
• Weight Balance tree.
• Graph-Matrix Representation Of Graphs,
• Elementary Graph operations
• Breadth First Search(BFS)
• Depth First Search(DFS)
• Spanning Trees
• Shortest path
• Minimal spanning tree

HASHING

• Hashing Functions
• Collision-Resolution Techniques