Course Detail

Course Description

DATA STRUCTURE TRAINING

About Data Structure Training 

Information Structures is an idea a methods for putting away an assortment of information. Software engineering is a worry with the investigation of techniques for adequately utilizing a PC to take care of issues. These can be explained by calculations and information structures. Information Structures mention to you what way the information to store in PC memory and how to get to the information proficiently. Numerous applications are planned by information structures stack applications like page visited history in an internet browser, chain of technique brings in the Java virtual machine or C++ Run-time condition, and so forth Queue Application Like Waiting Lines, Multi-programming, and so forth For some applications the decision of appropriate information structure is the main significant choice including the execution. Significantly the database planning and interior usage are done uniquely by utilizing Data Structures systems. 

Information Structure Training Course Objective 

This Course fundamental goal for the understudy to get Analysis and Designing of the Algorithms and how the various information structures are utilized for proficient getting to of the information and control of the information toward the finish of the session we can ready to Know Different Kinds of information structures and we can ready to give various calculations to existence intricacy.

Data Structure Training Course Duration

• 30 Working days, daily one and half hours

Data Structure Training Course Content Overview

Introduction to Data Structure

Algorithms

Performance Analysis

• Time complexity
• Space complexity

Asymptotic Notations-

• Big O
• Omega
• Theta notations

Arrays

Structures

Pointers

• Dynamic Memory allocation
• Malloc()
• calloc()
• realloc()
• free()

Stacks 

• Stack Operations
• push()
• pop()
• peex()
• distzay()
• isEmpty()
• isFull()
• Stack implementation using arrays
• Applications
• Decimal to Binary
• String reverse
• Number reverse
• Recursion – Towers of Hanoi
• Balanced Parentheses
• Expressions

Stack Implementation using pointer (dynamic)

Expression

• Introduction to Notations
• Importance of Notations in expression evaluation
• Conversion Algorithms
• Infix to prefix
• Infix to postfix
• Prefix to infix
• Prefix to postfix
• Postfix to infix
• Postfix to prefix
• Implementation of all the conversions

Queues

• Operations on Queue – enqueue(), dequeue()
• Queue implementation using static arrays
• Applications
• Queues Implementations using pointer (dynamic)

Circular queues

Double Ended queue (Deques)

Single linked list

• Introduction
• Construction
• Length
• Insertion
• Deletion
• Sort
• Reverse list
• Swap node data
• Swap nodes
• Applications

Stack implementation using linked list

Queue implementation using linked list

Doubly linked list

Circular linked list

Circular Doubly Linked List

Binary Tree

• Terminology
• Differences between Tree and Binary Tree
• Binary Tree Representations
• Expression Trees
• Traversals
• In-order
• pre-order
• post-order

Binary Search Tree

• Introduction to BST
• Insertion
• Deletion
• Search
• Implementation

Graph

• Introduction & Terminology
• Graph Representations
• Traversal
• BFS (Breadth First Search)
• DFS (Depth First Search)

Searching Algorithms

• Linear search
• Binary search

Sorting Algorithms

• Bubble sort
• Selection sort
• Insertion sort
• Heap sort
• Merge sort
• Quick sort

AVL Trees

• Introduction
• BST v/s AVL
• Rotations
• L-L-Rotation
• R-R-Rotation
• L-R-Rotation
• R-L-Rotation
• Insertion
• Deletion
• Traversal

Red Black Trees

• Introduction
• BST v/s AVL v/s RBT
• Rotations
• L-L-Rotation
• R-R-Rotation
• L-R-Rotation
• R-L-Rotation
• Insertion
• Deletion

B trees

• M-way Search Tree
• Search
• Insertion
• Deletion

Hashing

• Hash Table representation
• Hash function-Division Method
• Collision
• Collision Resolution Techniques
• Separate Chaining
• open addressing
• linear probing
• quadratic probing
• double hashing
• Rehashing

Priority Queue-Definition

• Operations-Insertion, Deletion,

Heap

• Definition
• Max Heap
• Min Heap
• Insertion and deletion

Pattern matching algorithms

• Brute force
• Boyer –Moore algorithm
• Knuth-Morris-Pratt algorithm

Tries

• Standard Tries
• Compressed Tries
• Suffix tries

Dynamic Programming

Greedy Method

Divide and conquer method