Data Structure

Data Structure course is offered by Pythonsoft. Pythonsoft is a leading software training institute in India to provide quality training to students. As a training institute, we try to provide strong programming skills to our students. We provide both conceptual and practical-oriented training from very basic to advanced levels.

Content:

• Introduction
•  Structured Representation
•  Statements and Control Structures
•  Abstract Data Types
• Static & Dynamic Data Types
•  Arrays & Pointers
•  Advanced Data Structures
• Data Structure Representation
•  Analysis –Performance analysis of Time and Space
• Design : Algorithm and Flowchart
• Asymptotic Notations
• Stacks
• Defining stack
• Operations of stack
• Application of stack
•  Stack implemented as an array
• Conversion and Evaluation of Expressions
• Using Stacks to solve problems
• Queues
• Defining Queue
• Operation of Queue
• Application of Queue
• Circular Queue
• Priority Queue
• Double Ended Queue
• Queue implemented as an array
• Differences between Stacks and Queues
• Linked List
• Introduction
• Advantages of Linked List over an Array
• Application of Linked List
• Types of Linked Lists
• Singly Linked Lists
• Operation of Singly Linked Lists
• Doubly Linked Lists
• Operations on Doubly Linked Lists
• Circular Linked Lists
• Circular Double Linked Lists
• Uses of Linked Lists
• Difference between Arrays and Linked List
• Implementation n of stack as linked list
• Implementation n of queue as linked  list
• Trees
• Introduction
• Tree terminology
• Binary Trees
• Strictly binary trees
• Complete binary tree
• Extended binary tree
• Traversing a Binary Tree
• Binary search tree
• Insertion into a Binary  search Tree
• Binary search Tree Deletion
• Height Balanced Tree(AVL tree)
• Heap
• Max heap  and  min heap
• Insertion and deletion in heap
• Conversion of  General Tree to binary Tree
• Graphs
• Introduction
• Graph terminology
• Types of Graphs
• Various Representation of   Graphs
• Application of Graphs
• Path matrix
• Graph Traversals
• BFS
• DFS
• Topological sorting
• Sorting Techniques
• Introduction
• Bubble Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Iterative Merge Sort
• Radix sort
• Heap Sort
• Searching Techniques
• Introduction
• Linear Search
• Binary Search
• Hashing Techniques
• Introduction
• Truncation  method
• Modular Division Method
• Mid Square Method
• Folding Method
• Collision
• Collision resolution techniques
• Linear probing
• Quadratic probing
• Double hashing
• Separate chaining method
• Data Structure Question Papers Solving