Data Structures and Algorithms : DSA using C++
Loại khoá học: Programming Languages
DSA made easy. Learn, Analyze and CODE all Data Structures with examples. Learn about Recursion and Sorting
Mô tả
You may be new to Data Structure or you have already Studied and Implemented Data Structures but still you feel you need to explore more about Data Structure in detail so that it helps you challenging problems, Coding Challenges and work on Data Structures efficiently.
Whatever the reason, if you are looking for a course that focus on the implementations to give you a complete understanding of how things work, then this is the course for you.
This course goes over the theory of how things work, but only to give you what you need to know to understand the implementation covered.
This course about 50 hours covers each topic in greater details, every topic is covered on Whiteboard which gives you a classroom environment to understand the concepts of Data Structures clearly and improve your Problem Solving and Analytical Skills. Every topic is discussed, analysed and implemented with programs executed showing line-by-line coding and tracing each and every piece of Code.
After completing this course, you will have a clear understanding of Data Structures and Algorithms, how to analyse and implement them.
Course Contents
1. Working of Recursion
2. Arrays Basics and Representation
3. Array Abstract Data Type
4. Linked List and its types
5. Stacks and its applications
6. Queues
7. Trees with Binary Trees and other types
8. Dictionaries
9. Binary Search Tree
10. AVL Trees
11. Graphs
12. Hashing Technique
with Essentials of C++ Programming, which will be helpful in Implementing the Data Structures using C++
Bạn sẽ học được gì
Gain in-depth knowledge about each Data structures including Arrays, Linked List, Stacks, Queues, Trees, Graphs, Heaps, Hashing and Sorting
Coded fully using Object Oriented Programming Concepts in C++
Complete working of each Data structure with tracing during learning the concepts as well as during program execution
Analyse in-depth each of the Data structures
Basics to Advance Level Data Structures
Yêu cầu
- Some basic or no knowledge of C++
Nội dung khoá học
15 sections
Introduction to the course
02:00
Introduction to Data Structures
12:43
Data structure and memory Usage
07:25
Types of Data Structures
10:39
Linear List and Abstract Data Type
05:45
Introduction to the section - "Essentials of C++ Programming"
02:42
Understanding Classes
08:33
Classes and Member Functions
14:03
Demo Program using Classes and Member Functions
10:22
Demo Program#2 using Classes and Member functions
04:30
Constructors and Types of Constructors
12:33
Program Demonstrating Constructors
11:05
Program using Uniform Initialisation with Constructors
06:18
Dynamic Memory Allocation in C++
06:27
Introduction to Templates
03:41
Function Templates in C++
05:50
Class Templates in C++
06:33
Programs Demonstrating Class Templates
08:32
Template Specialisation in C++
07:34
Understanding Parameter Passing Mechanism in C++
14:48
Program to show the working of Parameter Passing Mechanism in C++
11:28
Understanding Exception Handling in C++
07:49
Program to understand the Basic working of Exception Handling in C++
04:32
Raising an Exception from a Function
02:52
Raising Exceptions Using User-Define Class
03:46
All about Catch Block
07:17
Quiz@C++
3 questions
Introduction to Time and Space Complexity
22:51
Asymptotic Notations
15:15
Quiz@Computational Complexity
3 questions
Idea behind Recursion
08:35
Understanding what Recursion is
10:01
Sum of 2 numbers
09:55
Let's Code Sum of 2 Numbers using Recursion
05:32
Product of 2 Numbers
06:04
Let's Code Product of 2 Numbers Using recursion
04:41
Power Function a^b
14:14
Let's Code Power Function a^b
10:04
Fibonacci Series
06:53
Let's Code Fibonacci Series using Recursion
05:46
Finding GCD or HCF of 2 given numbers Using Recursion
05:05
Let's Code GCD or HCF Using Recursion
05:54
Finding Factorial of a given number Using Recrsion
06:51
Let's Code Factorial Using Recursion
05:08
Quiz@Recursion
5 questions
Why Arrays ? and What is Arrays ?
08:49
Declaring, Initializing and Accessing - Arrays
11:25
Static Vs Dynamic Arrays - Memory Layout of Main Memory
07:43
Static Vs Dynamic Arrays Details
11:09
Static Vs Dynamic Arrays Details Continue...
04:40
Introduction to 2 Dimension Arrays
03:30
Using Different methods to allocate the Memory for 2 Dimension Arrays
08:58
Allocating and DeAllocating Memory for 2-Dim Arrays
08:11
Representation of Arrays
10:26
Representation of 2-Dim Arrays
07:35
Row-Major and Column-Major Order for 2-Dim Arrays
10:02
Row-Major and Column-Major Order for 3-Dim Arrays
09:42
Representation of n-Dim Arrays
04:06
Quiz@ArraysBasics
3 questions
Introduction to Array ADT
05:46
Array Class ADT
20:17
Let's Code the Array ADT class
07:46
Let's Create an Array ADT
04:18
Creating an Exceptional Class and Array
07:42
Inserting the Element in an Array
11:14
Let's write the Code for Inserting the Element in an Array
09:22
Deleting the Element from an Array
08:00
Let's write the Code for Deleting the Element from an Array
07:44
Find() and search() operations on Array
08:02
Let's write the Code for Find() operation on Array
04:08
Let's Code Search() operation on Array
05:33
Let's Code IsEmpty() IsFull() operations on Array
08:30
Let's see Length() and Display() operations
03:24
More Operations - Get(), Set(), FindMAX(), FindMIN(), Sum(), Avg() and Append()
12:22
Let's Implement Get(), Set() and indexOf() operations on Array
07:28
Let's Code FindMAX(), FindMIN(), Sum(), Avg() and Append() operations on Arrays
12:26
Shifting the data Elements of an Array
08:08
Let's Rotate the Elements of Array
07:23
Let's Code Left and Right Rotate of the Elements on Array
12:03
Let's Reverse the Data Elements of Array
11:48
Let's Code Reversing the Data Elements of Array
07:57
Let's Search in Array using LINEAR Search technique
12:19
Let's Code Linear Search Technique
11:44
Let's understand BINARY Search on Array
07:49
Understanding the ITERATIVE BINARY SEARCH
07:58
Let's Code Binary Search (Iterative Method)
13:21
Recursive Binary Search on Arrays
03:27
Let's Code Recursive Binary Search technique
06:16
Binary Search Using Divide and Conquer Apprach
05:47
Let's Code Binary Search Using Divide and Conquer Apprach
07:03
Coding Challenge: Finding Maximum and Minimum from an Array
04:26
Solution to Coding Challenge : Finding Maximum and Minimum
07:51
Coding Challenge : Finding Minimum Number of Merge operations on Arrays
04:08
Solution to Coding Challenge Finding Minimum No. of Merge operations on Arrays
04:52
Coding Challenge : Print All Sub-Arrays with zero sum
06:01
Solution to Coding Challenge printing All Sub-Array with zero-sum
07:16
Coding Challenege : Find Smallest missing positive number from an unsorted array
05:22
Solution to Coding Challenge Finding Smallest Positive number
12:18
Quiz@Arrays
3 questions
Introduction to Linked Lists
06:57
Linked List Vs Arrays
08:37
Linked Lists in CPP
08:30
Types of Linked Lists
14:35
Singly Linked List and its Operations
10:54
Singly Linked List Class ADT
13:32
Let's Code Class ADT for Singly Linked Lists
06:48
Example working with Insert Process in a Linked Lists
19:47
Understanding the Code for Inserting an Element in a Linked List
16:40
Program for Inserting an Element in a Linked List
11:27
Deleting an Element from Singly Linked List
12:16
Program for Delete from Singly Linked Lists
07:43
Applying Find() operation on Singly Linked List
05:46
Program to Implement FIND() operation on Singly Linked Lists
07:00
Applying Search() operation on Singly Linked List
05:39
Program to Implement Search() operation on Singly Linked Lists
04:53
isEmpty() and isFull() in Singly Linked List
03:32
Program for isEmpty() function in Singly Linked List
05:21
Displaying the Data Elements in a Singly Linked List
06:33
Implementing ALL member functions of SLL Class
06:00
Concatenating two Linked Lists
07:51
Let's Code:Concatenating Two Linked Lists
04:45
Merging Two Linked Lists
12:30
Merging Two Linked Lists by Rearranging pointers
15:52
Lets' Code:Merging Two Linked Lists by Rearranging pointers
11:17
Reversing a Linked Lists using Array
06:51
Program for Reversing a Linked Lists using Array
07:56
Reversing a Linked List by Rearranging the Pointers
08:02
Lets's Code Reversing a Linked Lists using by Rearranging the Pointers
06:35
Introduction to Circular Linked Lists
06:36
Circular Linked List ADT
06:33
Let's Code Class ADT for Circular Linked Lists
05:16
Inserting an Element in Circular Linked Lists
15:25
Program Inserting an Element in Circular Linked Lists
11:21
Deleting an Element from Circular Linked Lists
14:18
Program Deleting from Circular Linked Lists
07:35
Displaying Elements in Circular Linked lists
08:37
Another method to Display Elements in Circular Linked lists
03:38
Displaying Elements Recursively in Circular Linked Lists
06:01
Let's Code Display() Circular Linked Lists
05:48
Implementing the Destructor of Circular Linked Lists
07:46
Program Implementing the Destructor of Circular Linked Lists
04:37
Introduction to Doubly Linked Lists
09:09
Class ADT for Doubly Linked lists
05:45
Let's Code Class ADT for Doubly Linked lists
04:26
Inserting in Doubly Linked Lists
16:57
Program to Implement insert() in Doubly Linked Lists
12:56
Deleting from Doubly Linked Lists
11:15
Program Implementing Doubly Linked Lists Class
12:36
Polynomial Addition
15:08
Program to Implement Polynomial Addition
13:45
Coding Challenge : Detect Cycle in Linked List
04:19
Solution to Coding Challenge to Detect Cycle in Linked List
06:45
Coding Challenge : Remove Loop (Cycle) from Linked List
02:47
Solution to Coding Challenge to Remove Loop from Linked Lists
06:22
Coding Challenge : Find the Intersection Point in Linked Lists
02:59
Solution to Coding Challenge to Find the Intersection Point in Linked Lists
06:22
Coding Challenge : Pairwise Swap of Adjacent Nodes using Links(pointers)
06:44
Solution to Coding Challenge Pairwise Swap of Adjacent Nodes using Links
04:04
Quiz@LinkedLists
4 questions
Introduction to Stack
07:57
Representations of Stack
04:35
Stack ADT
04:18
Array Representation of Stack
10:48
Implementing Stack using Array Representation
07:19
Implementing Stack Member Functions - Part 1
15:13
Implementing Stack Member Functions - Part 2
11:13
Let's Code Stack using Array Representation
22:56
Implementing 2 STACKS using single Array
16:54
Let's Code Two Stacks Using 1 single Array
08:45
Stack Using Linked Lists or Linked Representation of Stack
06:00
Implementing Linked Stack ADT
05:27
Stack PUSH and POP using Linked Lists
07:59
Let's Code Stack using Linked Representation
19:13
Applications of Stack Data Structures - Introduction
05:55
Converting an Infix Expression to postfix Expression
13:20
Infix to Postfix example conversion
10:19
One more Infix to Postfix example conversion
06:24
Infix to Postfix without Parenthesis Using Stack
18:42
Let's Code Infix to Postfix without Parenthesis
08:15
Infix to Postfix with Parenthesis Using Stack
13:51
Let's Code Infix to Postfix With Parenthesis
10:14
Evaluating a Postfix Expression
04:32
Implementing Postfix Evaluation
15:32
Let's Code Postfix Evaluation
09:07
Parenthesis Matching
10:37
Implementing Parenthesis Matching
04:20
Let's Code Parenthesis Matching
10:01
Working of Tower of Hanoi
09:18
Tower of Hanoii
06:08
Let's Code Tower of Hanoii using Stack
10:27
Another Application of stack - Recursion
10:36
Reverse a String using Stack
05:17
Let's Code Reverse a String using Stack
07:22
A Mazing Problem (Rat in a MAZE)
05:25
Let's Code A Mazing Problem
08:24
Coding Challenge : Create Stack that returns the Smallest Element in const time
10:55
Solution to Coding Challenge that returns Smallest Element in Const Time
08:11
Coding Challenge : Create Stack that returns the Smallest Element with One stack
10:39
Solution to Coding Challenge that returns the Smallest Element with One stack
07:58
Quiz@Stack
5 questions
Introduction to Queue Data Structure
08:22
Representations of Queue
01:39
Array representation of Queue
09:16
Queue ADT
06:30
Implementing Constructor and Destructor of Queue Class
03:55
Implementing EnQueue() and DeQueue() functions in Queue
10:39
Implementing other Member functions of Queue
10:00
Let's Code Queue ADT
14:59
Circular Queue
24:45
EnQueue() in Circular Queue
06:29
DeQueue() in Circular Queue
05:05
Let's Code Circular Queue
16:48
Understanding Linked Representation of Queue
07:38
EnQueue() and DeQueue() using Linked Representations
08:32
Implementing Linked Representation of Queue
13:30
Let's Code Queue using Linked Lists
07:51
DEQueue ( Double-Ended-Queue )
08:02
InsertFront() and InsertRear() in DEQueue
04:51
DeleteFront() and DeleteRear() from DEQueue
04:55
Let's Code DEQueue (Double-Ended-Queue)
07:58
Implementing QEUEUE using STACK Data Structure
08:15
Let's Code Queue Using Stack Data Structure
14:35
Coding Challenge : Implement Queue Using ONE stack
02:22
Solution to Coding Challenge Implement Queue Using ONE stack
04:16
Quiz@QUEUES
4 questions
Introduction to Trees with Basic Terminology used
14:12
Binary Tree
07:00
Array Representation of Binary Treea
08:46
Linked Representation of Binary Tree
07:39
Types of Binary Trees
18:37
Full Vs Complete Vs Almost Complete Binary Trees
06:58
Properties of Binary Trees
23:19
Height of a Binary Tree
11:39
Counting the Number of Nodes in a Binary Tree
08:32
Expression Trees
13:15
Number Of Binary Trees with 'n' - Nodes
07:35
Internal Vs External Nodes of a Binary Tree
11:17
Tree Traversal Techniques
06:17
InOrder Traversal
20:24
Iterative InOrder Traversal of a Binary Tree
11:59
PreOrder Traversal
15:29
Iterative PreOrder Traversal of a Binary Tree
09:35
PostOrder Traversal
13:22
Level Order Traversal
11:15
Constructing/Generating a Unique Binary Tree from Traversals
24:04
Binary Tree Class ADT
05:25
Let's Code Binary Tree Class
17:32
Let's Code Binary Tree Class using Queue
23:23
Coding Challenege:Check children-sum property in a binary tree
02:56
Solution to Coding Challenege to Check children-sum property in a binary tree
07:53
Coding Challenege : Evaluate a Binary Expression Tree
02:42
Solution to Coding Challenege to Evaluate a Binary Expression Tree
06:05
Quiz@Trees
3 questions
Dictionaries
03:42
Binary Search Tree (BST)
14:28
Types Of Binary Search Trees
08:32
Search Operation in Binary Search Tree
15:19
Insert Operation in Binary Search Tre
12:41
Delete Operation in Binary Search Tree
14:36
Let's Code BST Class ADT with Insert(), Delete() and Search()
12:54
Idea behind AVL Trees
07:33
Introduction to AVL Trees
12:31
AVL Tree Class ADT
06:31
Rotations on AVL Trees
02:38
LL-Rotation on AVL Trees
15:32
Let's code LL-Rotation
21:14
RR-Rotation on AVL Trees
07:27
Let's code RR-Rotation
09:27
LR-Rotation on AVL Trees
09:59
Let's code LR-Rotation
10:37
RL-Rotation on AVL Trees
08:06
Let's code RL-Rotation
11:27
Constructing an AVL Tree
14:48
Coding Challenge : Determine Whether a Binary tree is Skewed BST or Not
07:30
Solution to Coding Challenge to determine whether a Binary tree is Skewed BST
06:26
Quiz@SearchTrees
7 questions
Introduction to HEAP
07:17
Operations on Heap (Inserting an Element in a Heap)
09:41
Operations on Heap (Deleting an Element from a Heap)
07:31
Priority Queues
05:56
Heap and Heap Sort
11:26
Let's See Heap Sort function(Source Code)
10:28
Let's code Heap Sort
07:21
Heapify process
12:45
Heapify function(Suorce Code)
02:28
Let's Code Heap Sort Usng Heapify Process
03:45
Quiz@Heap
3 questions
Basics of Graph Data Structure
15:48
Properties of Graph - Directed and Undirected
06:32
Graph Representations (Adjacency Matrix, Adjacency Lists, Packed Adjacency List)
18:19
Graph ADT Class
06:09
Let's Code the Graph Class ADT
13:42
BFS (Breadth-First Search) - Graph traversal
10:40
BFS Program and its functionality
13:22
Let's code BFS
07:38
DFS (Depth-First Search) - Graph traversal
11:42
DFS Program and its functionality
09:42
Let's code DFS
05:20
Quiz@GRAPHS
4 questions
Introduction to Sorting - Part 1
04:42
Introduction to Sorting - Part 2
08:45
Bubble Sort
10:08
Let's see the Code and working of Bubble Sort Function
05:26
Analysis of Bubble Sort
10:31
Let's Code Bubble Sort
09:06
Idea Behind Insertion Sort
04:44
Understanding Insertion Sort
04:10
Let's see the working of Insertion Sort with an example
05:07
Insertion Sort Function Code and it's tracing
07:03
Analysing Insertion Sort
07:26
Let's Code Insertion Sort
08:15
Selection Sort
08:56
Let's See the Code and Working of Selection Sort
05:28
Analysing Selection Sort
06:47
Let's Code Selection Sort
10:13
Let's Understand Merge Process
05:26
Let's Understand Merge Code
09:05
Understanding Merge Sort - Part 1
09:49
Understanding Merge Sort - Part 2
09:41
Analysis of Merge Sort
05:45
Let's Code Merge Sort
11:07
Idea behind the working of Quick Sort
06:23
Let's See the working of Quick Sort - Part 1
07:53
Let's See the working of Quick Sort - Part 2
08:00
Understanding the Partition Code
07:20
Undertanding the QuickSort Function
04:02
Analysis of Quick Sort
09:21
Let's Code Quick Sort
14:15
Introduction to Shell Sort
02:45
Shell Sort - Walk through an Example
09:56
Let's see the code for Shell Sort
08:55
Analysis of Shell Sort
02:50
Let's Code Shell Sort
04:58
Understanding Counting Sort
06:22
Let us understand the Code(Function) for Counting Sort
05:02
Let's Code Counting Sort
08:30
Let's Analyz Counting Sort
02:37
Bin Sort
04:39
Let's see the source code for Bin Sort
04:09
Let's Code Bin Sort
07:44
Understanding Radix Sort
08:53
Let's Code Radix Sort
14:43
Quiz@Sorting Techniques
5 questions
Understanding the Working of Hashing
06:11
Using Linear Probing to resolve Collision
06:16
Let's Code Hashing Using Linear Probing as Collision resolution technique
28:26
Hashing Using Chaining
06:31
Let's Code Hashing Using Chaining as Collision resolution technique
21:11
Quiz@Hashing
3 questions
Viết Bình Luận
Khoá học liên quan
Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!
Get khoá học giá rẻ ngay trước khi bị fix.
Đánh giá của học viên
Bình luận khách hàng