Data Structures & Algorithms using C++, C and Python

Udemy

Gain an understanding of the functionalities of arrays, stacks, queues, linked lists, trees, graphs, and algorithms from the ground up.

Online

₹ 499 2899

particular

details

                                    Medium of instructions
                                    English

                                    Mode of learning
                                    Self study

                                    Mode of Delivery
                                    Video and Text Based

Basic Stuff

Memory Structure

Arrays

Why arrays are required?
Arrays Introduction and One Dimensional Arrays.
C Code : One Dimensional Arrays Implementation
C++ Code : One Dimensional Arrays Implementaiton.
Python Code : One Dimensional Arrays Implementation
Two Dimensional Arrays Introduction
Row Major Order - 1
Row Major Order - 2
Column Major Order
C Code : Two Dimentional Array - Row Major Order
Python Code : Two Dimentional Array - Row Major Order
Column Major Order - 1
Column Major Order - 2
Extra Stuff on Arrays : Lower Triangular Matrix
Extra Stuff on Arrays : Tridiagonal Matrix
Extra Stuff on Arrays : Toeplitz Matrix

Stacks

Stack Introduction
Stack Implementaion by using Arrays : Push() Operation.
Stack Implementation by using Arrays : Pop() operation.
C Code : Stacks Implementation using Arrays : Push(), Pop(), TopOfStack().
C++ Code : Stacks Implementation using Arrays : Push(), Pop(), Display().
Python Code : Stacks Implementation using Arrays : Push(), Pop(), Display
Python Code : Stacks Implementation using Arrays : Push(), Pop(), Display().
Associativity and Precedence
Converting to Prefix and Postfix notation from Infix

Recursion : Exclusive

Writing Recursive Code
Evaluation of Recursive code by using Recursive Tree
Example 1 : Recursive code Evaluation by using Recursive Tree
Constructing Recursive Tree
Example 2 : Recursive code Evaluation by using Recursive Tree
Printing Array Elements using Recursion
Finding Time Complexity from Recursive Equation by using Substitution Method
Recursive code for Multiplication and Division
Time Complexity for Fibonacci Series using Recursive Tree
Finding Time Complexity from Recursive Equation by using Substitution Method
Finding Time Complexity from Recursive Equation by using Substitution Method

Queues

Queue Introduction.
Enqueue Operation
Dequeue Operation
C Code : Queue Implementation - Enqueue and Dequeue.
C++ Code : Queue Implementation - Enqueue and Dequeue.
Python Code : Queue Implementation - Enqueue and Dequeue.
Drawbacks in Normal Queues.
Circular Enqueue Operation
Circular Dequeue Operation
C Code : Circular Queue - Enqueue and Dequeue.
C++ Code : Circular Queue - Enqueue and Dequeue.

Linked Lists

Single Linked List Introduction and Structure Creation
Single Linked List : Node Creation Physically in Memory
Single Linked List : Insertion - Beginning
Single Linked List : Insertion - Ending
Single Linked List : Insertion - Middle
C Code : Insertion - Beginning, Middle and Ending.
C++ Code : Insertion - Beginning, Middle and Ending.
Python Code : Insertion - Beginning, Middle and Ending.
Single Linked List : Deletion - Beginning and Ending
Single Linked List : Deletion - Middle
C Code : Deletion - Beginning, Middle and Ending.
C++ Code : Deletion - Beginning , Middle and Ending.
Python Code : Deletion - Beginning, Middle and Ending.
Single Linked List : Traversing
Single Linked List : Reversing
Question 1 : Single Linked List
Circular Single Linked Lists : Introduction
Circular Single Linked Lists : Insertion - Beginning
Circular Single Linked Lists : Insertion - Ending
Circular Single Linked Lists : Deletion - Beginning
Circular Single Linked Lists : Deletion - Ending
C Code : Circular Single Linked Lists : Insertion - Beginning, Middle, Ending.
C Code : Circular Single Linked Lists : Deletion - Beginning, Middle, Ending
Python Code : Cricular Single Linked Lists -Insertion - Beginning, Middle,Ending
Python Code :Circular Single Linked Lists - Deletion Beginning, Middle, Ending
Double Linked List : Introduction and Node Definition.
Double Linked List : Node Creation
Double Linked List : Insertion - Beginning
Double Linked List : Insertion - Middle
Double Linked List : Insertion - Ending
C Code : Double Linked List : Insertion - Beginning, Middle, Ending
C++ Code : Double Linked List : Insertion - Beginning, Middle, Ending
Python Code : Double Linked Lists : Insertion - Beginning, Middle, Ending.
Double Linked List : Deletion - Beginning
Double Linked List : Deletion - Ending
Double Linked List : Deletion - Middle
C Code : Double Linked List : Deletion - Beginning, Ending and Middle
C++ Code : Double Linked Lists : Deletion - Beginning, Middle, Ending.
Python Code : Double Linked List : Deletion - Beginning, Ending and Middle
Stack Implementation using Linked List
Queue Implementation using Linked List
Extra Stuff : Linked Lists nodes count - with loops
Extra Stuff : Linked Lists nodes count - with Recursion

Binary Trees

Binary Trees : Introduction
Binary Trees : Traversing Basic
Binary Trees : Traversing Technique - PREorder, INorder, POSTorder.
Binary Trees : Traversing Techniques - PREorder Recursive Code
Binary Trees : Traversing Techniques - INorder and POSTorder Recursive Codes
Binary Trees : Creating Binary Trees from PREorder and INorder.
Binary Trees : Creating Binary Trees from POSTorder and INorder.
Binary Trees : Arithmetic Expression Trees
Binary Trees : Arithmetic Expression Trees - Example

Binary Search Trees

Binary Trees : Drawbacks
Binary Search Trees : Introduction
Insertion on Binary Search Trees
Deletion on Binary Search Trees

Heaps

Introduction and Definition of Heaps (Max Heap and Min Heap).
Max Heap Creation (Insertion Operation).
Heap Tree Creation Time Complexity.
Heap Tree representation by using Arrays

Bonus Lecture - Advanced Data Structure : 6. Avl Trees - Exclusive

6.1 Why AVL Trees are required?
What is AVL Trees & Introduction.
Insertion : Imbalance
Insertion : LL Imbalance
Insertion : RR Imbalance
Insertion : LR Imbalance
Insertion : RL Imbalance
AVL Tree Creation (Insertion) - 1
AVL Tree Creation (Insertion) - 2
AVL Tree - Deletion : Introduction
AVL Tree - Deletion : R0
AVL Tree - Deletion : R1
AVL Tree - Deletion : R-1
AVL Tree - Deletion : L0
AVL Tree - Deletion : L-1
AVL Tree - Deletion : L1

2ary Tree, Full Binary Tree, Complete Binary Tree - Properties.

2ary Tree, Full Binary Tree, Complete Binary Tree - Properties: More Insights

Graphs

Graphs : Introduction
Graph Representation : Adjacency Lists and Adjacency Matrix for Undirected Graph
Graph Representation : Adjacency Lists and Adjacency Matrix for directed Graph,
Graph Traversing Techniques : Depth First Search
Graph Traversing Techniques : Breadth First Search

Hashing

Hashing Introduction.
Types of Hash Functions
Question 1
Question 2 : Collision
Question 3 : Collision
Collision Resolution Techniques (CRT).
CRT : Open Addressing - Linear Probing.
CRT : Open Addressing - Linear Probing Drawback
CRT : Open Addressing - Quadratic Probing
CRT : Open Addressing - Quadratic Probing : Drawbacks
CRT : Open Addressing - Random Probing.
CRT : Open Addressing - Double Hashing / Rehashing.
CRT : Open Addressing - Drawbacks.
CRT : Chaining.

Aymptotic Notations

Asymptotic Notations : Introduction.
Big Oh (O) : Example - 1
Big Oh (O) : Example : 2
Big Oh (O) : Example : 3
Big Oh (O) : Multiplication and Addition
Big Omega (Ω)
Theta (Θ)
Properties
Example : 4
Examples

Time Complexity : Exclusive

Introduction
Time Complexity Calculation for Simple Loops - 1
Time Complexity Calculation for Simple Loops - 2
Time Complexity Calculation for Nested Loops - 1
Time Complexity Calculation for Nested Loops - 2

Master Theorem

Master Theorem Introduction.
Master Theorem Formula discussion.
Master Theorem Examples - 1
Master Theorem Examples - 2

Spanning Trees

Spanning Trees Introduction.
Spanning Trees Properties Continuation.
Minimum Spanning Trees Definition and Algorithms Introduction
Krushkal's Algorithm for finding Minimum Spanning Trees.
Krushkal's Algorithm for finding Minimum Spanning Trees Continuation
Krushkal's Algorithm for finding Minimum Spanning Trees - Time Complexity.
Prim's Algorithm for finding Minimum Spanning Tree and Time Complexity.

Sorting Algorithms

Bubble Sort : Understanding Example
Bubble Sort : Time Complexity
Bubble Sort : Algorithm
Bubble Sort : Reducing Time Complexity
Code : Bubble Sort
Python Code : Bubble Sort
Insertion Sort : Understanding Example
Insertion Sort : Algorithm
Insertion Sort : Time Complexity
C Code : Insertion Sort
Python Code : Insertion Sort
Selection Sort : Understanding Example
Selection Sort : Algorithm
Selection Sort : Time Complexity
C Code : Selection Sort
Python Code : Selection Sort
Merge Sort : Theory
Merge Sort : Algorithm
C Code : Merge Sort
Quick Sort : Example
Quick Sort : Algorithm
Quick Sort : Time Complexity Analysis - Placing Pivot Element
Quick Sort : Time Complexity Analysis - Best Case
Quick Sort : Time Complexity Analysis - Worst Case
Heap Sort : Understanding with Example
Heap Sort : Time Complexity

Searching Algorithms

Linear Search
C Code : Linear Search
Python Code : Linear Search
Binary Search : Understanding with Example
Binary Search : Iterative and Recursive Algorithms
C Code : Binary Search - Iterative
C Code : Binary Search - Recursive
Python Code : Binary Search - Iterative
Python Code : Binary Search - Recursive

Greedy Method

Job Sequencing Problem : Theory
Job Sequencing Problem : Example 1
Job Sequencing Problem : Example 2
Knapsack Problem : Theory
Knapsack Problem : Example - Greedy about Weight, Profit and Unit Cost.
Optimal Merge Pattern : Theory
Optimal Merge Pattern : Example

Dynamic Programming

Travelling Salesperson Problem
Longest Common Subsequence - Intro & Difference between Substring & Subsequence
Longest Common Subsequence - Problem and Solution
Multistage Graph

Popular Courses

Popular Platforms

Popular Searches

Data Structures & Algorithms using C++, C and Python

Online

₹ 499 2899

Quick Facts

Course overview

The highlights

Program offerings

Course and certificate fees

Fees information

certificate availability

certificate providing authority

Who it is for

What you will learn

The syllabus