Data Structure and Algorithms with competitive programming and preparation

Data Structure and Algorithms for Beginners to Advance entire course will be discussed in python language and all the implementation and project will be done by using python .

Start Date: 27th February 2021
Class Timings: 12:00 PM to 02:00 PM (IST) Saturday - Sunday
Doubt Clearing Session: 3:30 PM to 5:30 PM (IST) Monday

Course Overview

Every application mentioned in the curriculum will be discussed in very detail starting from introduction to complexity analysis and end to end implementation will be shown to you.

What you'll learn
  • Analysis in Algorithms
  • Divide and Conquer
  • Greedy Technique
  • Dynamic Programming
  • Arrays
  • Linked List
  • Skip List
  • Hashing
  • Tree
  • Graph Traversal
  • Tree Traversal
  • Programming
  • Stack
  • Queue
  • String Matching
  • NP-Hard and NP-Complete Problems
Requirements
  • Dedication
  • PC with internet connectivity

Course Curriculum

  • Introduction to Algorithms
  • Analyzing Algorithm
  • Asymptotic Notation
  • Big O
  • Omega
  • Theta
  • Recurrence Relation Solving
  • Substitution Method
  • Recursive Tree Method
  • Master's Theorem
  • Introduction to Divide and Conquer
  • Discussion of applications of Divide and Conquer
  • Finding of maxima and minima
  • Finding Power of an Element
  • Binary Search
  • Quicksort
  • Mergesort
  • Strassen's Matrix Multilplication
  • Maximum-subarray problem
  • Finding of number of inversions
  • Introduction to Greedy Techniques
  • Discussion of applications of Greedy Technique
  • Knapsack Problem
  • Job Sequencing with deadline
  • Huffman Coding
  • Optimal Merge Pattern
  • Minimum Cost Spanning Tree
  • Kruskal Algorithm
  • Prim's Algorithm
  • Single Source Shortest Path
  • Dijkstra's Algorithm
  • Bellmanford Algorithm
  • Introduction to Dynamic Programming
  • Discussion of applications of Dynamic Programming
  • Fibonacci Series
  • Longest Common Subsequence
  • 0/1 Knapsack
  • Sum of Subset
  • All Shortest Path
  • Matrix Chain Multiplication
  • Introduction to Arrays
  • One Dimensional Array - How to find the address of an element in an array
  • Two Dimensional Array
  • Row Major Order
  • Column Major Order
  • Searching in an array
  • Linear Search
  • Binary Search(Discussed in DAC)
  • Sorting of an array
  • Comparison Sort
  • Selection Sort
  • Bubble Sort
  • Insertion Sort
  • Quicksort(Discussed in DAC)
  • Mergersort(Discussed in DAC)
  • Non Comparison Sort
  • Radix Sort
  • Bucket Sort
  • Count Sort
  • Introduction to Linked List
  • Searching in Linked List
  • Deleting from a Linked List
  • Doubly Linked List
  • Reversal in linked list
  • Introduction to Skip List
  • Operations and Randomization in Skip Lists
  • Insertion and Deletion in Skip Lists
  • Complexity analysis
  • Introduction to Hashing
  • Hash Tables
  • Hash Functions
  • Collision Resolution Techniques
  • Chaining
  • Open Addressing
  • Linear Probing
  • Quadratic Probing
  • Double Hashing
  • Perfect Hashing
  • Analysis of Chaining
  • Analysis of Open Addressing
  • Application of Hashing : Bloom Filters Discussion
  • Introduction to Binary Tree
  • Binary Search Tree
  • AVL Tree - Creation , Insertion, Deletion
  • Red Black Tree - Creation , Insertion, Deletion
  • BTree and B+ Tree - Creation , Insertion, Deletion
  • Breadth First Search
  • Depth First Search
  • Preorder Traversal
  • Postorder Traversal
  • Inorder Traversal
  • Static and Dynamic Scoping
  • Static Variable
  • Pointers
  • Introduction to Stack Data Structure
  • Implementation of Stack Using Arrays
  • Implementation of Stack Using Linked List
  • Average Stack Lifetime of an element
  • Implementing multiple stacks in single array
  • Applications of Stack
  • Recursion
  • Tail Recursion
  • Non-Tail Recursion
  • Nested Recursion
  • Indirect Recursion
  • Infix to Postfix
  • Prefix to Postfix
  • Postfix Evaluation
  • Towers of Hanoi
  • Fibonacci Series
  • Introduction to Queue Data Structure
  • Implementation of Queue Using Arrays
  • Implementation of Queue Using Linked List
  • Circular Queue
  • Priority Queue
  • Implementation of Stack using Queue
  • Naive String Matching Algorithms
  • Rabin-Karp Algorithm
  • String Matching with finite automata
  • NP-Hard
  • NP-Complete Problem
5.00 out of 5.0
1 Star 0.0%
2 Star 0.0%
3 Star 0.0%
4 Star 0.0%
5 Star 100.0%
Priya Bhatia

Expertise in data structure competitive programing and solving an analytical problems and implementing data structure algorithm in multiple programing language. I have done my M. Tech in AI at IIT Hyderabad and have an experience of implementation in multiple projects.

Reviews

Shailabh S
May 10,2021
5.00

" \"The course is awesome! The instructor spoke very clear and was very knowledgeable and patient. Good curriculum and obviously the support team of iNeuron is the best. "

Kevin Garda
May 10,2021
5.00

" Very thoughtful, persuasive and patient teaching. Always willing to solve any queries of her students. "

Rajiv Ranjan
May 10,2021
5.00

" Priya has wonderful in-depth knowledge of the subject. The way she teaches and explains the concepts is really awesome. Last but not the least, she always makes sure that even a small doubt is cleared before moving to the next topic, which I feel is a great thing. "

Submit Reviews

You can not rate this course before login

Join Thousand of Happy Students!

Subscribe our newsletter & get latest news and updation!