## Data Structure

### Data Structure 4.9 out of 5 based on 4000 Students ratings.

###### Course Summary

A data structure is a particular way of organizing data in a computer so that it can be used effectively.

###### Getting Started

Day 1- Introduction Of Data Structure:
• Concept Data Structure and Example
• Need of Data structure

Day 2 to 3- Algorithm & Pseudocode:
• Algorithm Definition
• Characteristics of algorithm
• Elements of algorithm
• Pseudocode example
• Difference of Algorithm & Pseudocode

Day 4- Array:
• Concept of Array
• Types of array
• Basic Programs
• Array with Functions
• Single & 2-dimensional array in function argument.

Day 5 to 6- Pointer:
• Pointer Basics
• Pointer with functions
• Call by reference
• Array of pointers & pointer to array & Programs

Day 7 to 8- Function:
• What is function
• Types of function
• How function works
• Function recursion and how it works.

Day 9 to 10- Structure:
• Pointer structure variable
• Structure as function argument
• using call by member value
• hole structure and call by
• passing reference of structure.

Day 11- Stack:
• Operations on Stack
• Programs on stack
• Push & Pop operations
• Traversing.

Day 12 to 13- Applications of Stack :
• Arithmetic Expression Evaluation
• Notations, Infix
• Postfix, Prefix
• Conversion infix to post fix
• Conversion postfix to infix
• Evaluation of Postfix and Pre fix using stack.

Day 14 to 17- Linear Queue ,Circular Queue & its Operation
• Operations on Queue
• Programs on stack
• Insert & Delete operations
• Circular queue
• Rrepresentation
• Deque
• Priority Queue
• Application of queue.

• Difference of linklist & array
• Representation
• Operations
• Traversing
• Insertion(first node, last node, at a position, after a node value)
• Deletion(first node, last node, at a position, after a node value)

Day 21 to 23- Double LinkedList:
• Concept of Double linked list
• Representation
• Operations, traversing
• Insertion (first node, last node, at a position, after a node value)
• Deletion (first node, last node, at a position, after a node value)

Day 24 to 25- Binary Tree:
• Tree terminology
• Binary tree
• Complete Binary Tree
• Tree Traversals
• Creation of Binary Tree from traversal methods
• Expression Tree & expression Manipulation

Day 26 to 27- Binary Search Tree:
• Binary Search Tree
• Insertion & deletion in BST(Program)
• AVL Tree, M-way Search Tree

Day 28 to 29- B Tree:
• Introduction and Concept of B+ Tree
• Insertion
• Deletion.

Day 30- Graph:
• Graph terminology
• Representation of graphs

Day 31 to 34- Traversal:
• Graph Traversal
• DFS (depth first search)
• Minimum spanning Tree

Day 35 to 36- Matrix:
• Path matrix

Day 37 to 38- Algorithms:
• Kruskal's Algorithm & Prim's Algorithm
• Warshall's Algorithm (Shortest path Aalgorithm).

Day 39- Searching:
• Linear Search Methods
• Binary Search Methods

Day 40- Hashing:
• Hash functions
• Hashing techniques
• Hashing chaining

Day 40 to 45- Sorting:
• Bubble sort
• Selection sort
• Insertion sort
• Quick sort
• Merge sort
• Heap sort