Data Structures and Algorithms

Week-1: C++ Basics, operators, Flow charts & Loops
Explore fundamental structures crucial for organizing data efficiently. Arrays provide ordered collections, linked lists offer dynamic data storage, while stacks and queues manage data access based on specific rules, crucial for various algorithmic implementations.

C++ introduction, How do C++ Programs Run
Data Types in C++
Operators like, Arithmetic, Comparison, Logical, Assingnment, Bitwise, Arithmetic Progression, Geometric Progression, etc
If else, Nested If else, Switch statement in C++. Example- Leap Year, Simple Calculator, etc
For Loops, While Loops, Do While Loops, Break & Continue statements. Examples- All Divisor of a Number, Fibonacci Numbers, Binary to Decimal, etc

Week-2: Analysis of Algorithm, Pointer, Recursion Session 1: Analysis of Algorithm
Dive into various algorithms to manipulate and process data. Sorting algorithms such as bubble, merge, and quick sort arrange data systematically. Searching algorithms like binary search efficiently locate elements. Additionally, graph algorithms navigate relationships among data points, pivotal in numerous applications.

Week-3: Arrays
Engage in coding challenges and exercises designed to reinforce theoretical knowledge. These challenges simulate real-world scenarios, encouraging the application of learned concepts to solve complex problems, fostering proficiency in algorithmic thinking and problem-solving.

Week-4: Searching & Sorting
Understand how these data structures and algorithms manifest in software development. Discover how utilizing the right data structure and algorithm can significantly impact the efficiency and performance of applications, making them more scalable and robust.

Week-5: Matrix & Hashing
Equip yourself for technical interviews by honing problem-solving skills and algorithmic thinking. Prepare to articulate solutions and optimize code efficiency, crucial for excelling in software engineering interviews and real-world development challenges.

Search

Course Details

Data Structures and Algorithms

Teacher

Last Update:

Review:

Course Content

C++ introduction, How do C++ Programs Run

Data Types in C++

Operators like, Arithmetic, Comparison, Logical, Assingnment, Bitwise, Arithmetic Progression, Geometric Progression, etc

If else, Nested If else, Switch statement in C++. Example- Leap Year, Simple Calculator, etc

For Loops, While Loops, Do While Loops, Break & Continue statements. Examples- All Divisor of a Number, Fibonacci Numbers, Binary to Decimal, etc

Analysis of Algorithm

– Asymptotic analysis (Order of Growth, Best, Average and Worst cases of various algorithms using Asymptotic Notations)

Time & Space Complexity

Pointer

Address and Dereference Operators, Introduction to Pointers, Function Parameter and Pointers, NULL in C++, nullptr in C++, Dynamic Memory Allocation, etc

Introduction to Recursion

Writing Base Cases in Recursion

Tail Recursion Examples- Rope Cutting Problem, Rat in a Maze, etc

Introduction to Backtracking Examples- Tower of Hanoi, Josephus Problem etc

Week-3: Arrays Engage in coding challenges and exercises designed to reinforce theoretical knowledge. These challenges simulate real-world scenarios, encouraging the application of learned concepts to solve complex problems, fostering proficiency in algorithmic thinking and problem-solving.

ntroduction to Arrays

Operations of Arrays – Searching, Insertion, and Deletion

Sliding Window Technique Examples- Leaders in an Array Problem, Stock Buy and Sell, Trapping Rain Water, Kth smallest element, Subarray sum divisible K, etc

Practice more questions

Week-4: Searching & Sorting Understand how these data structures and algorithms manifest in software development. Discover how utilizing the right data structure and algorithm can significantly impact the efficiency and performance of applications, making them more scalable and robust.

Searching

Linear Search

Binary Search

Two Pointer Approach Examples- Index of the first Occurrence in SortedArray, Count 1s in a Sorted Binary Array, Square root of a number, Aggressive cows, etc

Sorting

Sorting Algorithms e.g. Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Radix Sort Examples- Minimum Difference in an Array, Chocolate Distribution Problem, Minimum swaps to sort, etc

Week-5: Matrix & Hashing Equip yourself for technical interviews by honing problem-solving skills and algorithmic thinking. Prepare to articulate solutions and optimize code efficiency, crucial for excelling in software engineering interviews and real-world development challenges.

Multidimensional Array

Passing 2D Arrays as an argument Examples- Transpose of a Matrix, Matrix in Snake Pattern, Count Distinct Elements, etc

Introduction to Hashing

Collision Handling

Hashing Function

Practice more questions

Week-6: Strings & LinkedList

Introduction to Strings

Pattern Searching Algorithm (Boyer Moore Algorithm)

Rabin Karp Algorithm

KMP Algorithm Examples- Palindrome Check, Anagram Search, Word wrap, etc

Introduction to Linked List

Traversing a Linked List

Insertion and Deletion of Node

Doubly Linked List and Circular Linked List Examples- Loop detection, Intersection of two LL, Sum of two LL, etc

Week-7: Stack, Queue & Deque

Introduction to Stacks

Stack Operations like push, pop, etc

Array Implementation of Stack

Linked List Implementation of Stack Examples- Balanced Parenthesis, Stock Span Problems, Infix, Prefix, and Postfix expressions, etc

Introduction to Queue

Implementation of Queue using Array

Implementation of Queue using Linked List

Introduction to Deque Examples- Generate Numbers with Given Digits, First Circular Tour, etc

Week-8: Tree and Binary Search Tree

Introduction to Trees

Introduction to Binary Tree

Tree Traversal – Inorder, Preorder, and Postorder

Level Order Traversal

Lowest Common Ancestor of a Binary Tree

Serialize and Deserialize a Binary Tree Examples- Height of a Binary Tree, Serialize and Deserialize a Binary Tree, etc

Introduction to BST (Binary Search Tree)

Search, Insertion, Deletion in BST

Self Balancing BST – AVL Tree, Red Black Tree Examples- Find Kth Smallest in BST, Vertical Sum in Binary Tree, Largest BST in a Binary tree, etc

Week-9: Greedy, & Heap

Introduction to Greedy Algorithm

Binary Heap – Introduction

Binary Heap – Insertion, Heapify, and Extract

Binary Heap – Decrease, Delete and Build Heap

Heap Sort

Priority Queue Examples- Activity Selection Problem, Fractional Knapsack, Job Sequencing Problem, Sort K Sorted Arrays, etc

Practice more questions

Week-10: Graphs

Introduction to Graph

Graph Representation (Adjacency List and Matrix)

Breadth First Search

Week-3: Arrays
Engage in coding challenges and exercises designed to reinforce theoretical knowledge. These challenges simulate real-world scenarios, encouraging the application of learned concepts to solve complex problems, fostering proficiency in algorithmic thinking and problem-solving.

Week-4: Searching & Sorting
Understand how these data structures and algorithms manifest in software development. Discover how utilizing the right data structure and algorithm can significantly impact the efficiency and performance of applications, making them more scalable and robust.

Week-5: Matrix & Hashing
Equip yourself for technical interviews by honing problem-solving skills and algorithmic thinking. Prepare to articulate solutions and optimize code efficiency, crucial for excelling in software engineering interviews and real-world development challenges.