Mastering Data Structures & Algorithms using C and C++

About Course

Mastering Data Structures & Algorithms using C and C++ – Free Online Course

Enhance your coding skills with this comprehensive and free online course, designed to help you master Data Structures and Algorithms. This course, taught by an experienced instructor, will provide you with a deep understanding of data structures and their implementation in C and C++.

This 53-hour course covers everything from the basics to advanced topics, including:

Recursion
Arrays Representation
Array ADT
Linked List
Stack
Queues
Trees
Binary Search Tree
AVL Trees
Graphs
Hashing Technique

The course is presented on a whiteboard, which helps to improve your problem-solving and analytical skills. Each data structure is discussed, analyzed, and implemented with practical line-by-line coding examples. All source code is available for download.

This free online course is available on Udemy, Udacity, Coursera, MasterClass, NearPeer, and other platforms. Enroll now and start your journey to becoming a coding expert!

Course Content

01 – Before we Start

A Message from the Professor
001 – Instructors Note.mp4

00:00
002 – Introduction.mp4

00:00

02 – Essential C and C Concepts

003 – Arrays Basics.mp4

00:00
004 – Practice Arrays Basics.mp4

00:00
005 – Structures.mp4

00:00
006 – Practice Structures.mp4

00:00
007 – Pointers.mp4

00:00
008 – Practice Pointers.mp4

00:00
009 – Reference in C.mp4

00:00
010 – Practice Reference.mp4

00:00
011 – Pointer to Structure.mp4

00:00
012 – Practice Pointer to Structure.mp4

00:00
013 – Functions.mp4

00:00
014 – Practice Functions.mp4

00:00
015 – Parameter Passing Methods.mp4

00:00
016 – Practice Parameter Passing Methods.mp4

00:00
017 – Array as Parameter.mp4

00:00
018 – Practice Array as Parameter.mp4

00:00
019 – Structure as Parameter.mp4

00:00
020 – Practice Structure as Parameter.mp4

00:00
021 – Structures and Functions Must Watch.mp4

00:00
022 – Converting a C program to a C class Must Watch.mp4

00:00
023 – Practice Monolithic Program.mp4

00:00
024 – Practice Modular Program.mp4

00:00
025 – Practice Structure and Functions.mp4

00:00
026 – Practice ObjectOriented Program.mp4

00:00
027 – C Class and Constructor.mp4

00:00
028 – Practice C Class.mp4

00:00
029 – Template classes.mp4

00:00
030 – Practice Template Class.mp4

00:00
Section Quiz

03 – Required Setup for Programming

031 – Online C and C compiler.mp4

00:00
032 – Setup CodeBlocks and Settings.mp4

00:00
033 – Setup DevC and Settings.mp4

00:00
034 – Debugging using DevC.mp4

00:00
035 – Debugging using CodeBlocks.mp4

00:00
036 – Setup Visual Studio.mp4

00:00
037 – Debugging using Visual Studio.mp4

00:00
038 – Setup Xcode.mp4

00:00
Section Quiz

04 – Introduction

05 – Recursion

046 – How Recursion Works Tracing.mp4

00:00
047 – Generalising Recursion.mp4

00:00
048 – How Recursion uses Stack.mp4

00:00
049 – Recurrence Relation Time Complexity of Recursion.mp4

00:00
050 – Lets Code Recursion.mp4

00:00
051 – Static and Global Variables in Recursion.mp4

00:00
052 – Lets Code Static and Global in Recursion.mp4

00:00
053 – Tail Recursion.mp4

00:00
054 – Head Recursion.mp4

00:00
055 – Tree Recursion.mp4

00:00
056 – Lets Code Tree Recursion.mp4

00:00
057 – Indirect Recursion.mp4

00:00
058 – Lets Code Indirect Recursion.mp4

00:00
059 – Nested Recursion.mp4

00:00
060 – Lets Code Nested Recursion.mp4

00:00
061 – Sum of Natural Number using Recursion.mp4

00:00
062 – Lets Code Sum of N using Recursion.mp4

00:00
063 – Factorial using Recursion.mp4

00:00
064 – Lets Code Factorial using Recursion.mp4

00:00
065 – Power using Recursion.mp4

00:00
066 – Lets Code Power Recursion.mp4

00:00
067 – Taylor Series using Recursion.mp4

00:00
068 – Lets Code Taylor Series using Recursion.mp4

00:00
069 – Taylor Series using Horners Rule.mp4

00:00
070 – Lets Code Taylor Series Horners Rule Recursion.mp4

00:00
071 – Lets Code Taylor Series Iterative.mp4

00:00
072 – Fibonacci Series using Recursion Memoization.mp4

00:00
073 – Lets Code Fibonacci.mp4

00:00
074 – nCr using Recursion.mp4

00:00
075 – Lets Code nCr using Recursion.mp4

00:00
076 – Tower of Hanoi Problem.mp4

00:00
077 – Lets Code Tower of Hanoi.mp4

00:00
078 – Quiz 1 Solutions.mp4

00:00
Section Quiz

06 – Arrays Representations

079 – Introduction to Array.mp4

00:00
080 – Declarations of Array.mp4

00:00
081 – Demo Array Declaration.mp4

00:00
082 – Static vs Dynamic Arrays.mp4

00:00
083 – Demo Static vs Dynamic Array.mp4

00:00
084 – How to Increase Array Size.mp4

00:00
085 – Demo Increasing Array Size.mp4

00:00
086 – 2D Arrays.mp4

00:00
087 – Demo 2D Array.mp4

00:00
088 – Array Representation by Compiler.mp4

00:00
089 – Row Major Formula for 2D Arrays.mp4

00:00
090 – Column Major Formula for 2D Arrays.mp4

00:00
091 – Formulas for nD Arrays.mp4

00:00
092 – Formulas for 3D Arrays.mp4

00:00
093 – Solutions for Quiz 2.mp4

00:00
Section Quiz

07 – Array ADT

094 – Array ADT.mp4

00:00
095 – Demo Array ADT.mp4

00:00
096 – Inserting in an Array.mp4

00:00
097 – Lets Code Insert.mp4

00:00
098 – Deleting from Array.mp4

00:00
099 – Lets Code Delete.mp4

00:00
100 – Linear Search.mp4

00:00
101 – Improving Linear Search.mp4

00:00
102 – Lets Code Linear Search.mp4

00:00
103 – Binary Search.mp4

00:00
104 – Binary Search Algorithm.mp4

00:00
105 – Lets Code Binary Search.mp4

00:00
106 – Analysis of Binary Search.mp4

00:00
107 – Average Case Analysis of Binary Search.mp4

00:00
108 – Get Set Avg Max functions on Array.mp4

00:00
109 – Lets Code Get Set Max on Array.mp4

00:00
110 – Reverse and Shift an Array.mp4

00:00
111 – Lests Code Reversing an Array.mp4

00:00
112 – Check if Array is Sorted.mp4

00:00
113 – Lets Code to check if Array is Sorted.mp4

00:00
114 – Merging Arrays.mp4

00:00
115 – Lets Code to Merge Arrays.mp4

00:00
116 – Set operations on Array Union Intersection and Difference.mp4

00:00
117 – Lets Code Set operations on Array.mp4

00:00
118 – Lets Code a Menu Driver program for Arrays.mp4

00:00
119 – Lets convert C program for Array to C.mp4

00:00
120 – Lets Put all together in C program for Array.mp4

00:00
121 – Student Challenge Finding Single Missing Element in an Array.mp4

00:00
122 – Student Challenge Finding Multiple Missing Elements in an Array.mp4

00:00
123 – Student Challenge Finding Missing Element in an Array Method 2.mp4

00:00
124 – Student Challenge Finding Duplicates in a Sorted Array.mp4

00:00
125 – Student Challenge Finding Duplicates in Sorted Array using Hashing.mp4

00:00
126 – Student Challenge Finding Duplicates in a Unsorted Array.mp4

00:00
127 – Student Challenge Finding a Pair of Elements with sum K.mp4

00:00
128 – Student Challenge Finding a Pair of Elements with sum K in Sorted Array.mp4

00:00
129 – Student Challenge Finding Max and Min in a single Scan.mp4

00:00
130 – Solutions for Quiz 3.mp4

00:00

08 – Strings

131 – Introduction to Strings.mp4

00:00
132 – Finding Length of a String.mp4

00:00
133 – Changing Case of a String.mp4

00:00
134 – Counting Words and Vowels in a String.mp4

00:00
135 – Validating a String.mp4

00:00
136 – Reversing a String.mp4

00:00
137 – Comparing Strings and Checking Palindrome.mp4

00:00
138 – Finding Duplicates in a String.mp4

00:00
139 – Finding Duplicates in a String using Bitwise Operations.mp4

00:00
140 – Checking if 2 Strings are Anagram distinct letters.mp4

00:00
141 – Permutation of String.mp4

00:00
Section Quiz

09 – Matrices

142 – Section Introduction.mp4

00:00
143 – Diagonal Matrix.mp4

00:00
144 – Lets Code Diagonal Matrix.mp4

00:00
145 – C class for Diagonal Matrix.mp4

00:00
146 – Lets Code C class for Diagonal matrix.mp4

00:00
147 – Lower Triangular Matrix RowMajor Mapping.mp4

00:00
148 – Lower Triangular Matrix ColumnMajor Mapping.mp4

00:00
149 – Lets Code Lower Triangular Matrix in C.mp4

00:00
150 – Lets Code Lower Triangular Matrix in C.mp4

00:00
151 – Upper Triangular Matrix RowMajor Mapping.mp4

00:00
152 – Upper Triangular Matrix ColumnMajor Mapping.mp4

00:00
153 – Symmetric Matrix.mp4

00:00
154 – TriDiagonal and TriBand Matrix.mp4

00:00
155 – Toeplitz Matrix.mp4

00:00
156 – Menu Driven Program for Matrices.mp4

00:00
157 – Menu Driven Program for Matrices using Functions.mp4

00:00
158 – How to Write C Classes for All Matrices.mp4

00:00
Section Quiz

10 – Sparse Matrix and Polynomial Representation

159 – Sparse Matrix Representation.mp4

00:00
160 – Addition of Sparse Matrices.mp4

00:00
161 – Array Representation of Sparse Matrix.mp4

00:00
162 – Lets Code to Create Sparse Matrix.mp4

00:00
163 – Program for Adding Sparse Matrix.mp4

00:00
164 – Lets Code to Add Sparse Matrix.mp4

00:00
165 – Lets Code Sparse Matrix using C.mp4

00:00
166 – Lets Code Sparse Matrix using C Continued.mp4

00:00
167 – Polynomial Representation.mp4

00:00
168 – Polynomial Evaluation.mp4

00:00
169 – Polynomial Addition.mp4

00:00
170 – Lets Code Polynomial.mp4

00:00
Section Quiz

11 – Linked List

171 – Why we need Dynamic Data Structure Linked List.mp4

00:00
172 – About Linked List.mp4

00:00
173 – More About Linked List.mp4

00:00
174 – Display Linked List.mp4

00:00
175 – Lets Code Display for Linked List.mp4

00:00
176 – Recursive Display of Linked List.mp4

00:00
177 – Lets Code Recursive Display for Linked List.mp4

00:00
178 – Counting Nodes in a Linked List.mp4

00:00
179 – Sum of All Elements in a Linked List.mp4

00:00
180 – Lets Code Count and Sum.mp4

00:00
181 – Maximum Element in a Linked List.mp4

00:00
182 – Lets Code Max for Linked List.mp4

00:00
183 – Searching in a Linked List.mp4

00:00
184 – Improve Searching in Linked List.mp4

00:00
185 – Lets Code Searching in Linked List.mp4

00:00
186 – Inserting in a Linked List.mp4

00:00
187 – Lets Code Insert for Linked List.mp4

00:00
188 – Creating a Linked List using Insert.mp4

00:00
189 – Creating a Linked List by Inserting at Last.mp4

00:00
190 – Inserting in a Sorted Linked List.mp4

00:00
191 – Lets Code Insert in Sorted Linked List.mp4

00:00
192 – Deleting from Linked List.mp4

00:00
193 – Lets Code Delete on Linked List.mp4

00:00
194 – Check if a Linked List is Sorted.mp4

00:00
195 – Lets Code to check if Linked List is Sorted.mp4

00:00
196 – Remove Duplicates from Sorted Linked List.mp4

00:00
197 – Lets Code to Remove Duplicates from Sorted Linked List.mp4

00:00
198 – Reversing a Linked List.mp4

00:00
199 – Reversing using Sliding Pointers.mp4

00:00
200 – Recursive Reverse for Linked List.mp4

00:00
201 – Lets Code Reversing a Linked List.mp4

00:00
202 – Concatenating 2 Linked Lists.mp4

00:00
203 – Merging 2 Linked Lists.mp4

00:00
204 – Lets Code to Concatenate and Merge Linked Lists.mp4

00:00
205 – Check for LOOP in Linked List.mp4

00:00
206 – Lets Code to Check LOOP.mp4

00:00
207 – Lets Code a C class for Linked List.mp4

00:00
208 – Circular Linked List.mp4

00:00
209 – Display Circular Linked List.mp4

00:00
210 – Lets Code Circular Linked List.mp4

00:00
211 – Inserting in a Circular Linked List.mp4

00:00
212 – Lets Code Insert for a Circular Linked List.mp4

00:00
213 – Deleting From Circular Linked List.mp4

00:00
214 – Lets Code Delete for Circular Linked List.mp4

00:00
215 – Doubly Linked List.mp4

00:00
216 – Lets Code Doubly Linked List.mp4

00:00
217 – Insert in a Doubly Linked List.mp4

00:00
218 – Lets Code Insert for Doubly Linked List.mp4

00:00
219 – Deleting from Doubly Linked List.mp4

00:00
220 – Lets Code Delete for Doubly Linked List.mp4

00:00
221 – Reverse a Doubly Linked List.mp4

00:00
222 – Lets Code Reverse for Doubly Linked List.mp4

00:00
223 – Circular Doubly Linked List.mp4

00:00
224 – Comparison of Linked List.mp4

00:00
225 – Comparison of Array with Linked List.mp4

00:00
226 – Student Challenge Finding Middle Element of a Linked List.mp4

00:00
227 – Student Challenge Finding Intersecting point of Two Linked List.mp4

00:00
Section Quiz

12 – Sparse Matrix and Polynomial using Linked List

13 – Stack

231 – Introduction to Stack.mp4

00:00
232 – Stack using Array.mp4

00:00
233 – Implementation os Stack using Array.mp4

00:00
234 – Lets Code Stack using Array.mp4

00:00
235 – Stack using Linked List.mp4

00:00
236 – Stack Operations using Linked List.mp4

00:00
237 – Lets Code Stack using Linked List.mp4

00:00
238 – Lets Code C class for Stack using Linked List.mp4

00:00
239 – Parenthesis Matching.mp4

00:00
240 – Program for Parenthesis Matching.mp4

00:00
241 – Lets Code Parenthesis Matching.mp4

00:00
242 – More on Parenthesis Matching.mp4

00:00
243 – Infix to Postfix Conversion.mp4

00:00
244 – Associativity and Unary Operators.mp4

00:00
245 – Infix to Postfix using Stack Method 1.mp4

00:00
246 – Infix to Postfix using Stack Method 2.mp4

00:00
247 – Program for Infix to Postfix Conversion.mp4

00:00
248 – Lets Code Infix to Postfix Conversion.mp4

00:00
249 – Student Challenge Infix to Postfix with Associativity and Parenthesis.mp4

00:00
250 – Evaluation of Postfix Expression.mp4

00:00
251 – Program for Evaluation of Postfix.mp4

00:00
252 – Lets Code Evaluation of Postfix.mp4

00:00
Section Quiz

14 – Queues

253 – Queue ADT.mp4

00:00
254 – Queue using Single Pointer.mp4

00:00
255 – Queue using Two Pointers.mp4

00:00
256 – Implementing Queue using Array.mp4

00:00
257 – Lets Code Queue using Array.mp4

00:00
258 – Lets Code Queue in C.mp4

00:00
259 – Drawback of Queue using Array.mp4

00:00
260 – Circular Queue.mp4

00:00
261 – Lets Code Circular Queue.mp4

00:00
262 – Queue using Linked List.mp4

00:00
263 – Lets Code Queue using Linked List.mp4

00:00
264 – Double Ended Queue DEQUEUE.mp4

00:00
265 – Priority Queues.mp4

00:00
266 – Queue using 2 Stacks.mp4

00:00
Section Quiz

15 – Trees

267 – Terminology.mp4

00:00
268 – Number of Binary Trees using N Nodes.mp4

00:00
269 – Height vs Nodes in Binary Tree.mp4

00:00
270 – Internal Nodes vs External Nodes in Binary Tree.mp4

00:00
271 – Strict Binary Tree.mp4

00:00
272 – Height vs Node of Strict Binary Tree.mp4

00:00
273 – Internal vs External Nodes of Strict Binary Trees.mp4

00:00
274 – nary Trees.mp4

00:00
275 – Analysis of nAry Trees.mp4

00:00
276 – Representation of Binary Tree.mp4

00:00
277 – Linked Representation of Binary Tree.mp4

00:00
278 – Full vs Complete Binary Tree.mp4

00:00
279 – Strict vs Complete Binary Tree.mp4

00:00
280 – Binary Tree Traversals.mp4

00:00
281 – Binary Tree Traversal Easy Method 1.mp4

00:00
282 – Binary Tree Traversal Easy Method 2.mp4

00:00
283 – Binary Tree Traversal Easy Method 3.mp4

00:00
284 – Creating Binary Tree.mp4

00:00
285 – Program to Create Binary Tree.mp4

00:00
286 – Lets Code Creating Binary Tree.mp4

00:00
287 – Lets Code Creating Binary Tree in C.mp4

00:00
288 – Preorder Tree Traversal.mp4

00:00
289 – Inorder Tree Traversals Functions.mp4

00:00
290 – Iterative Preorder.mp4

00:00
291 – Iterative Inorder.mp4

00:00
292 – Lets Code Iterative Traversals.mp4

00:00
293 – Level Order Traversal.mp4

00:00
294 – Lets Code Level Order Traversal.mp4

00:00
295 – Can we Generate Tree from Traversals.mp4

00:00
296 – Generating Tree from Traversals.mp4

00:00
297 – Height and Count of Binary Tree.mp4

00:00
298 – Lets Code Height and Count.mp4

00:00
299 – Student Challenge Count Leaf Nodes of a Binary Tree.mp4

00:00
Section Quiz

16 – Binary Search Trees

300 – BST intro.mp4

00:00
301 – Searching in a Binary Search Tree.mp4

00:00
302 – Inserting in a Binary Search Tree.mp4

00:00
303 – Recursive Insert in Binary Search Tree.mp4

00:00
304 – Creating a Binary Search Tree.mp4

00:00
305 – Lets code Binary Search Tree.mp4

00:00
306 – Deleting from Binary Search Tree.mp4

00:00
307 – Lets Code Recursive Insert and Delete on BST.mp4

00:00
308 – Generating BST from Preorder.mp4

00:00
309 – Program for Generating BST from Preorder.mp4

00:00
310 – Drawbacks of Binary Search Tree.mp4

00:00
Section Quiz

17 – AVL Trees

311 – Introduction to AVL Trees.mp4

00:00
312 – Inserting in AVL with Rotations.mp4

00:00
313 – General form of AVL Rotations.mp4

00:00
314 – Lets Code LL Rotation on AVL.mp4

00:00
315 – Lets Code LR Rotation on AVL.mp4

00:00
316 – Generating AVL Tree.mp4

00:00
317 – Deletion from AVL Tree with Rotations.mp4

00:00
318 – Height Analysis of AVL Trees.mp4

00:00
Section Quiz

18 – Search Trees

319 – 23 Trees.mp4

00:00
320 – 234 Trees.mp4

00:00
321 – RedBlack Trees Introduction.mp4

00:00
322 – RedBlack Tree creation.mp4

00:00
323 – RedBlack Trees vs 234 Trees.mp4

00:00
324 – Creating RedBlack Tree similar to Creating 234 Tree.mp4

00:00
325 – RedBlack Tree Deletion Cases.mp4

00:00
326 – RedBlack Tree Deletion Examples.mp4

00:00
327 – RedBlack Tree vs 234 Tree Deletion.mp4

00:00
Section Quiz

19 – Heap

328 – Introduction to Heap.mp4

00:00
329 – Inserting in a Heap.mp4

00:00
330 – Program to Insert in a Heap.mp4

00:00
331 – Creating a Heap.mp4

00:00
332 – Deleting from Heap and Heap Sort.mp4

00:00
333 – Lets Code Heap Sort.mp4

00:00
334 – Heapify Faster Method for creating Heap.mp4

00:00
335 – Heap as Priority Queue.mp4

00:00
Section Quiz

20 – Sorting Techniques

336 – Criteria used for Analysing Sorts.mp4

00:00
337 – Bubble Sort.mp4

00:00
338 – Lets Code Bubble Sort.mp4

00:00
339 – Insertion Sort.mp4

00:00
340 – Insertion Sort Continued.mp4

00:00
341 – Program for Insertion Sort.mp4

00:00
342 – Analysis of Insertion Sort.mp4

00:00
343 – Lets Code Insertion Sort.mp4

00:00
344 – Comparing Bubble and Insertion Sort.mp4

00:00
345 – Selection Sort.mp4

00:00
346 – Program for Selection Sort.mp4

00:00
347 – Analysis of Selection Sort.mp4

00:00
348 – Lets Code Selection Sort.mp4

00:00
349 – Idea behind Quick Sort.mp4

00:00
350 – Quick Sort.mp4

00:00
351 – Analysis of Quick Sort.mp4

00:00
352 – Analysis of Quick Sort Continued.mp4

00:00
353 – Lets Code Quick Sort.mp4

00:00
354 – Merging.mp4

00:00
355 – Iterative Merge Sort.mp4

00:00
356 – Lets Code Iterative Merge Sort.mp4

00:00
357 – Recursive Merge Sort.mp4

00:00
358 – Lets Code Recursive Merge Sort.mp4

00:00
359 – Count Sort.mp4

00:00
360 – Lets Code Count Sort.mp4

00:00
361 – Bin Bucket Sort.mp4

00:00
362 – Radix Sort.mp4

00:00
363 – Shell Sort.mp4

00:00
364 – Lets Code Shell Sort.mp4

00:00

21 – Hashing Technique

365 – Introduction to Hashing.mp4

00:00
366 – Chaining.mp4

00:00
367 – Lets Code Chaining.mp4

00:00
368 – Linear Probing.mp4

00:00
369 – Lets Code Linear Probing.mp4

00:00
370 – Quadratic Probing.mp4

00:00
371 – Double Hashing.mp4

00:00
372 – Hash Function Ideas.mp4

00:00
Section Quiz

22 – Graphs

373 – Introduction to Graphs.mp4

00:00
374 – Representation of Undirected Graph.mp4

00:00
375 – Representation of Directed Graphs.mp4

00:00
376 – Breadth First Search.mp4

00:00
377 – Program for BFS.mp4

00:00
378 – Depth First Search.mp4

00:00
379 – Program for DFS.mp4

00:00
380 – Lets Code BFS DFS.mp4

00:00
381 – Spanning Trees.mp4

00:00
382 – Prims Minimum Cost Spanning Tree.mp4

00:00
383 – Prims Program.mp4

00:00
384 – Lets Code Prims using.mp4

00:00
385 – Kruskals Minimum Cost Spanning Tree.mp4

00:00
386 – Disjoint Subsets.mp4

00:00
387 – Kruskals Program.mp4

00:00
388 – Lets Code Krusklas Program.mp4

00:00
Section Quiz

23 – Asymptotic Notations

Add this certificate to your resume to demonstrate your skills & increase your chances of getting noticed.

Student Ratings & Reviews

5.0

Total 2 Ratings

2 Ratings

0 Rating

Laiba Asim

3 months ago

This course is a goldmine of knowledge! The instructor's expertise shines through in every module. Clear explanations, practical examples make learning a breeze. I highly recommend it to anyone looking to master the DSA

Soban Ahmad

4 months ago

great!

About Course