Mastering Data Structures & Algorithms using C and C++
- Descrição
- Currículo
- FAQ
- Revisões
You may be new to Data Structure or you have already Studied and Implemented Data Structures but still you feel you need to learn more about Data Structure in detail so that it helps you solve challenging problems and used Data Structure efficiently.
This 53 hours of course covers each topic in greater details, every topic is covered on Whiteboard which will improve your Problem Solving and Analytical Skills. Every Data Structure is discussed, analysed and implemented with a Practical line-by-line coding.
Source code for all Programs is available for you to download
About Instructor
I am the Instructor of this course, I have been teaching this course to university students for a long period of time, I know the pulse of students very well, I know how to present the topic so that it’s easy to grasp for students.
I know how to use White board to explain the topic and also to make it memorable. Remembering the thing and using them in right place is more important than just understanding the topic.
After Completing Course
After completing this course you will be confident enough to take up any challenging problem in coding using Data Structures.
Course Contents
1. Recursion
2. Arrays Representation
3. Array ADT
4. Linked List
5. Stack
6. Queues
7. Trees
8. Binary Search Tree
9. AVL Trees
10. Graphs
11. Hashing Technique
-
3
Arrays Basics -
4
Practice : Arrays Basics
-
5
Structures
-
6
Practice : Structures
-
7
Pointers
-
8
Practice : Pointers
-
9
Reference in C++
-
10
Practice : Reference
-
11
Pointer to Structure
-
12
Practice : Pointer to Structure
-
13
Functions
-
14
Practice : Functions
-
15
Parameter Passing Methods
-
16
Practice : Parameter Passing Methods
-
17
Array as Parameter
-
18
Practice : Array as Parameter
-
19
Structure as Parameter
-
20
Practice : Structure as Parameter
-
21
Structures and Functions (Must Watch)
-
22
Converting a C program to a C++ class (Must Watch)
-
23
Practice : Monolithic Program
-
24
Practice : Modular Program
-
25
Practice : Structure and Functions
-
26
Practice : Object-Oriented Program
-
27
C++ Class and Constructor
-
28
Practice : C++ Class
-
29
Template classes
-
30
Practice : Template Class
-
39
Introduction
Learn What are Data Structures.
Comparing
1. Data Structure
2. Database
3. Datawarehouse
4. Big Data
-
40
Stack vs Heap Memory
Learn How program uses Main Memory. How program uses sections of Memory
-
41
Stack vs Heap. Continued...
Learn How function uses Stack, how memory is allocated when the function is called.
Learn how Heap is used with the help of Pointers
-
42
Physical vs Logical Data Structures
Difference between Physical and Logical Data Structures
Physical : Array and Linked List
Logical : Stack,Queues, Trees, Graphs, Hashtables
-
43
ADT
Learn what does it mean by Abstract Datatypes
-
44
Time and Space Complexity
Learn How to Analyse Time and Space of any Algorithm on Data Structures, based on working of Algorithm
-
45
Time and Space Complexity from Code
Learn How to Analyse based on Code of Algorithm
-
46
How Recursion Works ( Tracing )
Learn how to trace a Recursion
-
47
Generalising Recursion
General form of Recursion and its phases
1. Ascending Phase
2. Descending Phase
-
48
How Recursion uses Stack
Learn how Recursion uses Stack
-
49
Recurrence Relation - Time Complexity of Recursion
Learn how to find the Time complexity of Recursion using Recurrence Relation
-
50
Lets Code Recursion
-
51
Static and Global Variables in Recursion
Learn how Static and Global variables are used in Recursion
-
52
Let's Code Static and Global in Recursion
-
53
Tail Recursion
Learn What does it mean by Tail Recursion, a recursion processing at calling time
-
54
Head Recursion
Learn what does it mean by Head Recursion, a recursion processing at returning time
-
55
Tree Recursion
Learn Tree Recursion, a Recursion calling itself more than one time
-
56
Let's Code Tree Recursion
-
57
Indirect Recursion
Learn Indirect Recursion. two or more functions calling each other recursively.
-
58
Let's Code Indirect Recursion
-
59
Nested Recursion
Learn Nested Recursion. a Function call is passed as parameter to itself.
-
60
Let's Code Nested Recursion
-
61
Sum of Natural Number using Recursion
Finding Sum of first n natural numbers using Recursion and Iteration
-
62
Let's Code Sum of N using Recursion
-
63
Factorial using Recursion
Finding Factorial using Recursion.
-
64
Let's Code Factorial using Recursion
-
65
Power using Recursion
Finding Power using Recursion and computing using less number of multiplications
-
66
Let's Code Power Recursion
-
67
Taylor Series using Recursion
Recursive function for Taylor Series using Static variables
-
68
Let's Code Taylor Series using Recursion
-
69
Taylor Series using Horner's Rule
Apply Horner's Rule to reduce number of multiplications in Taylor Series.
-
70
Let's Code Taylor Series Horner's Rule - Recursion
-
71
Let's Code Taylor Series Iterative
-
72
Fibonacci Series using Recursion - Memoization
Learn about Fibonacci Series.
1. Iterative method for Fibonacci Series.
2. Recursive Method.
3. Using Memoization
-
73
Let's Code Fibonacci
-
74
nCr using Recursion
Learn how to devise a Recursive function for nCr formula using Pascals Triangle
-
75
Let's Code nCr using Recursion
-
76
Tower of Hanoi Problem
Devising a Recursive function for Tower of Hanoi
-
77
Let's Code Tower of Hanoi
-
78
Recursion -
79
Quiz 1 Solutions
