Complete Dsa Developer
in 2022:
Zero to Mastery

4.7 (200 reviews)

Master problem solving for Coding Interviews, ace Data Structures & Algorithms by
solving over 150 important questions!


2,983 enrolled on this course
complete dsa course

Duration

4 Months

Assignments

Daily

Courses

Both Online & Offline

Course Fee

See Prices

Overview

CodePlanet Technologies is one of the best Data Structure and Algorithm Training/Internship institute in Jaipur. We have a team of experienced Java developers and Oracle Certified trainers trainers from multinational companies to teach students.CodePlanet Technologies trainers provides highly customized and result oriented training in Core Java, Advance Java, , Spring, Hibernate, Web Services etc. We focus on practical training sessions as well as Conceptual classes.

We believe that learning technology makes you better, but implementing it makes you perfect. We provide computer labs to students so that they can implement regularly whatever they learn in the class.

In Java training, our training institute offers practical knowledge and full job assistance with Java training course.

overview-img
overview-img

What you'll learn

  • Become a Dsa Expert.
  • Solve every problem with a unique method.
  • Be able to use Dsa for Web Development and App development.
  • Be able to solve tier 1 Companies Dsa question.
  • With Dsa you can make your problem solving capability strong.
  • Be able to build fully fledged websites and web apps with Dsa

    • Our Instructor

    Chandrapal Singh Deora

    Co-Founder at Code Planet
    Technologies

    Parth Maheshwari

    Co-Founder at Code Planet
    Technologies

    overview-img

    Course Content

    Introducion to Dsa
    • Introduction
    • Stack vs Heap Memory
    • Physical vs Logical Data Structure
    • Abstract Data Type
    Recursion
    • How Recursion Works
    • Generalising Recursion
    • How Recursion uses Stack
    • Static vs Global Variables in Recursion
    • Tail Recursion
    • Head Recursion
    • Tree Recursion
    • Indirect Recursion
    • Nested Recursion
    • Sum of natural numbers using recursion
    • Factorial using Recursion
    • Power using Recursion
    • Taylor Series using Recursion
    • Taylor Series using Horner’s Rule
    • Fibonacci Series using Recursion-Memoization
    • nCr using Recursion
    • Tower of Hanoi Problem
    Array Representation
    • Introduction
    • Static vs dynamic array
    • How to increase array size
    • 2D Array
    • Array representation by compiler
    • Row major formula for array
    • Column major formula for array
    Array ADT
    • Introduction
    • Inserting in an Array
    • Deleting from Array
    • Linear Search
    • Improving Linear Search
    • Binary Search
    • Analysis of Linear & Binary Search
    • Reverse & shift an Array
    • Check if Array is Sorted
    • Merging Arrays
    • Set operations on Array
    • Finding single missing element in an Array
    • Finding multiple elements in an Array
    • Finding duplicates in a Sorted Array
    • Finding duplicates in a unsorted Array
    • Finding a pair of elements with sum K
    • Various Competitive Programs
    Strings
    • Introduction
    • Finding Length of a String
    • Changing Case of a String
    • Counting Words and Vowels in a String
    • Validating a String
    • Reversing a String
    • Comparing Strings and Checking Palindrome
    • Finding Duplicates in a String
    • Checking if 2 Strings are Anagram
    • Permutation of String
    Matrices
    • Introduction
    • Diagonal Matrix
    • Lower Triangular Matrix
    • Upper Triangular Matrix
    • Symmetric Matrix
    • Tri-Diagonal and Tri-Band Matrix
    • Toeplitz Matrix
    Sparse Matrix and Polynomial Representation
    • Sparse Matrix Representation
    • Addition of Sparse Matrice
    • Array Representation of Sparse Matrix
    • Polynomial Representation
    • Polynomial Evaluation
    • Mathematical operations on Polynomial
    Linkedlist
    • Why we need LinkedList?
    • Introduction
    • Add/Insert/Delete/Update in singly LinkedList
    • Analysis of Add/Insert/Delete/Update in singly LinkedList
    • Add/Insert/Delete/Update in doubly LinkedList
    • Analysis of Add/Insert/Delete/Update in doubly LinkedList
    • Add/Insert/Delete/Update in singly circular LinkedList
    • Analysis of Add/Insert/Delete/Update in singly circular LinkedList
    • Add/Insert/Delete/Update in doubly circular LinkedList
    • Analysis of Add/Insert/Delete/Update in doubly circular LinkedList
    • Display For LinkedList
    • Recursive Display For LinkedList
    • Searching in a LinkedList
    • Improve Searching in LinkedList
    • Check if a LinkedList is sorted
    • Remove Duplicates from LinkedList
    • Reversing a LinkedList
    • Recursive Reverse for LinkedList
    • Concatenating 2 LinkedList’s
    • Merging 2 LinkedList’s
    • Comparison of LinkedList
    • Comparison of Array with LinkedList
    • Finding middle elements of a LinkedList
    • Finding intersecting point of Two LinkedList
    • Sparse Matrix and Polynomial using LinkedList
    Stack
    • Introduction
    • Stack using Array
    • Stack using LinkedList
    • Parenthesis Matching
    • Infix to Postfix Conversion
    • Associativity and Unary Operators
    • Evaluation of Postfix Expression
    Queue
    • Queue ADT
    • Array Representation of Queue
    • Queue using single and double pointer
    • LinkedList Representation of Queue
    • Linear Queue6. Circular Queue
    • Priority Queue
    • Dequeue
    • Queue using 2 pointers
    Trees
    • Terminology
    • Number of Binary trees using n nodes
    • Height vs Nodes in Binary Tree
    • Internal Nodes vs External Nodes in Binary Tree
    • Strict Binary Tree
    • Height vs Nodes in Strict Binary Tree
    • Internal vs External nodes of Strict Binary Tree
    • Representation of Binary Tree
    • n-ary trees
    • Full vs Complete Binary Tree
    • Strict vs Complete Binary Tree
    • Binary Tree Traversals
    • Creating Binary Tree
    • Recursive version of Preorder, Inorder, Postorder
    • Iterative version of Preorder, Inorder, Postorder
    • Level Order Traversal
    • Generating tree from traversals
    • Height and Count of Binary Tree
    • Count Leaf nodes of a Binary Tree
    Binary Search Trees
    • Introduction
    • Searching in a BST
    • Inserting in a BST
    • Creating a BST
    • Deleting from BST
    • Generating BST from traversals
    • Drawbacks of BST
    AVL Trees
    • Introduction
    • Inserting in AVL with Rotations
    • General form of AVL Rotations
    • Generating AVL Tree
    • Deletion from AVL Tree with Rotations
    • Height Analysis of AVL Trees
    Search Trees
    • 2-3 Trees
    • 2-3-4 Trees
    • Red-Black Tree Introduction
    • Red-Black Tree Creation
    • Red-Black Trees vs 2-3-4 Trees
    • Red-Black Tree vs 2-3-4 Tree Deletion
    Heap
    • Introduction
    • Inserting in a Heap
    • Creating a Heap
    • Deleting from Heap and Heap Sort
    • Heap Sort
    • Heapify
    • Heap as Priority Queue
    Sorting Techniques
    • Criteria used for Analysing Sorts
    • Bubble Sort
    • Analysis of Bubble Sort
    • Insertion Sort
    • Analysis of Insertion Sort
    • Comparing Bubble and Insertion Sort
    • Selection Sort
    • Analysis of Selection Sort
    • Quick Sort
    • Analysis of Quick Sort
    • Iterative Merge Sort
    • Recursive Merge Sort
    • Analysis of Merge Sort
    • Count Sort
    • Bin/Bucket Sort
    • Analysis of Count & Bin/Bucket Sort
    • Radix sort
    • Analysis of Radix sort
    • Shell Sort
    • Analysis of Shell Sort
    Hashing
    • Introduction
    • Chaining
    • Linear Probing
    • Quadratic Probing
    • Double Hashing
    • Hash Function Ideas
    Graphs
    • Introduction & Terminology
    • Representation of Undirected graph
    • Representation of Directed graph
    • BFS
    • DFS
    • Spanning Trees
    • Prim’s Minimum Cost Spanning Tree
    • Kruskal’s Minimum Cost SpanningTree
    • Detecting cycles in a graph
    • Articulation Points & Biconnected Components
    • Algorithms
    • Various Algorithms Explanations
    Asymptotic Notations
    • Big-Oh
    • Omega
    • Theta
    • Properties of Asymptotic Notations
    • Best, Worst, Average Case Analysis
    • Time Complexity Analysis for “for” loop
    • Time Complexity Analysis for if condition & while loop
    • Recurrence Relations