Menu Close

Data structures

Data Structure is a set of pre-defined algorithms that can help programmers in developing an effecient solution for their client requirement. It proposes the effective methodologies that can be used to implement data processing with a minimal time and memory usage as well. Some of the commonly implemented data structures being the Stack, Queues (circular queues, priority queues, double ended queues), linked lists (single linked list, double linked list, circular single and double linked lists), trees and graphs. The most common methods of searching and sorting (arrainging in ascending or descnding order) of data are implemented using the Data Structures.

Developer – Datastructures
Analyst – Datastructures
L2 support – Datastructures

Any one who aims to be a programmer or developer in the field of Information Technology

• Definition of Data Structures
• Importance of Data Structures
• Structured Representation
• Common operations on Data Structure
• Data Structure Representation
• Stack Definition
• Applications
• Operations
• Stack implemented as an array
• Stack implemented with pointers
• Queue Definition
• Application of Queues
• Differences between Stacks & Queues
• Operation of Queue
• Circular Queue
• Priority Queue
• Double Ended Queue
• Queue implemented with Pointers
Linked List
• What is a Linked List
• Advantages of Linked List over an Array
• Application of Linked List
• Types of Linked Lists
• Singly Linked Lists
• Operations on Singly Linked List

• Doubly Linked Lists
• Operations on Doubly Linked Lists
• Circular Linked Lists
• Circular Double Linked Lists
• Root
• Leaf
• Parent
• Child
• Binary Trees
• Implementation of Binary Trees
• Insertion
• Deletion
• Binary Search Trees
• Traversing a Binary Tree
• Pre order
• In order
• Post order
Sorting Techniques
• Importance of Sorting
• Selection Sort
• Bubble Sort
• Insertion Sort
• Merge Sort
• Quick Sort
Searching Techniques
• Type of searching
• Linear Search
• Binary Search
• Best suitable Search method