InfotechMantra | Home

## Data Structure

Data Structures is a concept a means of storing a collection of data. Computer Science is a concern with study of methods for effectively using a computer to solve problems. These can be solve by algorithms and data structures. Data Structures tells you what way the data as to store in computer memory and how to access the data efficiently. Many Applications are designed by data structures stack applications like page visited history in a webbrowser, chain of method calls in the Java virtual machine or C++ Runtime environment etc Queue Application Like Waiting Lines, Multiprogramming etc For many applications the choice of proper data structure is the only major decision involving the implementation. Majorly the database designing and internal implementation is done only by using Data Structures techniques.

#### Data Structure Training Course Objective

This Course main objective for the student to understand Analysis and Designing of the Algorithms and how the different data structures are used for efficient accessing of the data and Manipulation of the data at the end of the session we can able to Know different Kinds of data structures and we can able to provide different algorithms for time and space complexity.
Data Structure Training Course Duration - 30 Working days, daily one and half hours

#### Course Outline

• Introduction
• Structured Representation
• Statements and Control Structures
• Abstract Data Types
• Static Data Types
• Dynamic Data Types
• Arrays
• Pointers
• Data Structure Representation
• Searching Techniques
• Introduction
• Linear Search
• Binary Search
• Stacks
• Defining stack
• Application of stack
• Operations of stack
• Stack implemented as an array
• Stack implemented with pointers
• Using Stacks to solve problems
• Queues
• Defining Queue
• Application of Queue
• Operation of Queue
• Circular Queue
• Priority Queue
• Queue implemented with Pointers
• Differences between Stacks and Queues
• Introduction
• Operation of Singly Linked Lists
• Operations on Doubly Linked Lists
• Trees
• Introduction
• Binary Trees
• Implementation of Binary Trees
• Insertion into a Binary Tree
• Binary Tree Deletion
• Traversing a Binary Tree
• Binary Height Balanced Trees
• Graphs
• Introduction
• Types of Graphs
• Various Representation of Graphs
• Application of Graphs
• Graph Traversals
• Sorting Techniques
• Introduction
• Bubble Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Iterative Merge Sort
• Introduction to Heap
• Heap Operations
• Heap Sort