Data Structures And Algorithms
BaluTutorials provides online Advance data structures training using C. This Course main objective for the student or working professional 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.
Course Fee: RS 5000/-**PayU service fee: 2%
Course Duration: 60hr
See the Online Advance Data Structure and Algorithms Training content below.
BASIC CONCEPT IN DATA STRUCTURES
- What is Data Structure?
- Types of Data structure
- Memory Management
- How array stores in the system
- Longest Substring Without Repeating Characters
- Merge k Sorted Lists
- Kth Largest Element in an Array
LINKED LIST
- What are a list, node, and next reference?
- Linked list implementation (adding, deleting and finding specific nodes )
- Linked list using singly
- Linked list using doubly
- Linked list using Circular
- Reverse Linked List
- Linked List Cycle
- Remove Nth Node From End of List
- Palindrome Linked List
STACK
- What is a Stack? Practical use of it
- Stack using array
- Stack using list
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Postfix to Prefix Conversion
- Postfix to Infix
- The Stock Span Problem
- Check for balanced parentheses in an expression
- Next Greater Element
- Arithmetic Expression Evaluation
QUEUE
- What is a Queue? Practical use of it
- Queue using Array
- Queue using Stacks
- Queue using list
- Operations on queue
- Circular Queue
- Reversing a queue using recursion
- Reversing the first K elements of a Queue
TREES
- What is a Tree data structure?
- Practical use of Trees in data storing and process scheduling.
- Trees – BST
- Trees – AVL
- Trees – Red Black
- Tree traversal (recursion and iterative method )
- Binary Tree Traversal
- Binary Tree Level Order Traversal
- Lowest Common Ancestor of a Binary Search Tree
- Convert Binary Search Tree to Sorted Doubly Linked List
- Convert Sorted Array to Binary Search Tree
GRAPHS
- What is a Graph, how to represent a graph?
- Practical use of a graph.
- Network Algorithms
- Network Terminology
- Spanning Trees
- Shortest Paths
- Breadth-First Traversal for a Graph
- Depth First Traversal for a Graph
- Application of Depth First Search
- Application of Breadth First Traversal
- Topological Sorting
- Check whether a given graph is Bipartite or not
- Applications of Minimum Spanning Tree Problem
- Kruskal’s Minimum Spanning Tree Algorithm
- Minimum cost to connect all cities
- Dijkstra’s shortest path algorithm
- Dijkstra’s Algorithm for Adjacency List Representation
RECURSION
- Fibonacci Numbers
- Permutations
- Tower Of Hanoi
- Regular Expression Matching
DYNAMIC PROGRAMMING
- What is Dynamic Programming?
- longest increasing subsequence in c programming
- Longest Common Subsequence
- Coin Change
- Min Cost Path
- Weighted Job Scheduling
BACKTRACKING ALGORITHMS
- Backtracking in C
- The Eight Queens Problem
- The Knights Tour
- Rat in a Maze
SEARCHING AND SORTING
- Binary Search, Selection Sort, BubbleSort
- Insertion Sort,Merge Sort,Heap Sort
- Quick Sort ,Radix Sort
- Complexity Theory
- Big O Notation
- Functions Comparing Run time
- Divide and Conquer
- Median of two sorted arrays
- Closest Pair of Points
Prerequisites
Before you start learning Data structure and algorithms, You should aware of basic knowledge of any programming language like C, C++, Java, C#, Python Programming.
