Course Curriculum
Total learning: 82 lessons Time: 100 weeks
- 1. Arrays 12
- Why arrays are required?Lecture1.1
- Arrays Introduction and One Dimensional ArraysLecture1.2
- Code : One Dimensional Arrays ImplementationLecture1.3
- Two Dimensional Arrays IntroductionLecture1.4
- Row Major Order – 1Lecture1.5
- Row Major Order – 2Lecture1.6
- Code : Two Dimentional Array – Row Major OrderLecture1.7
- Column Major Order – 1Lecture1.8
- Column Major Order – 2Lecture1.9
- Lower Triangular MatrixLecture1.10
- Tridiagonal MatrixLecture1.11
- Toeplitz MatrixLecture1.12
- 2. Stacks 14
- Code : Stacks Implementation using Arrays : Push(), Pop(), TopOfStack().Lecture2.1
- Associativity and PrecedenceLecture2.2
- Converting to Prefix and Postfix notation from InfixLecture2.3
- Writing Recursive CodeLecture2.4
- Evaluation of Recursive code by using Recursive TreeLecture2.5
- Example 1 : Recursive code Evaluation by using Recursive TreeLecture2.6
- Constructing Recursive TreeLecture2.7
- Example 2 : Recursive code Evaluation by using Recursive TreeLecture2.8
- Printing Array Elements using RecursionLecture2.9
- Finding Time Complexity from Recursive Equation by using Substitution MethodLecture2.10
- Recursive code for Multiplication and DivisionLecture2.11
- Time Complexity for Fibonacci Series using Recursive TreeLecture2.12
- Finding Time Complexity from Recursive Equation by using Substitution MethodLecture2.13
- Finding Time Complexity from Recursive Equation by using Substitution MethodLecture2.14
- 3. Queues 5
- Enqueue OperationLecture3.1
- Dequeue OperationLecture3.2
- Drawbacks in Normal Queues.Lecture3.3
- Circular Enqueue OperationLecture3.4
- Circular Dequeue OperationLecture3.5
- 4. Linked Lists 22
- Single Linked List Introduction and Structure CreationLecture4.1
- Single Linked List : Node Creation Physically in MemoryLecture4.2
- Single Linked List : Insertion – BeginningLecture4.3
- Single Linked List : Insertion – EndingLecture4.4
- Single Linked List : Insertion – MiddleLecture4.5
- Single Linked List : Deletion – Beginning and EndingLecture4.6
- Single Linked List : Deletion – MiddleLecture4.7
- Single Linked List : TraversingLecture4.8
- Single Linked List : ReversingLecture4.9
- Question 1 : Single Linked ListLecture4.10
- Double Linked List : Introduction and Node Definition.Lecture4.11
- Double Linked List : Node CreationLecture4.12
- Double Linked List : Insertion – BeginningLecture4.13
- Double Linked List : Insertion – EndingLecture4.14
- Double Linked List : Insertion – MiddleLecture4.15
- Double Linked List : Deletion – BeginningLecture4.16
- Double Linked List : Deletion – EndingLecture4.17
- Double Linked List : Deletion – MiddleLecture4.18
- Stack Implementation using Linked ListLecture4.19
- Queue Implementation using Linked ListLecture4.20
- Linked Lists nodes count – with loopsLecture4.21
- Linked Lists nodes count – with RecursionLecture4.22
- 5. Binary Trees 9
- Binary Trees : IntroductionLecture5.1
- Binary Trees : Traversing BasicLecture5.2
- Binary Trees : Traversing Technique – PREorder, INorder, POSTorder.Lecture5.3
- Binary Trees : Traversing Techniques – PREorder Recursive CodeLecture5.4
- Binary Trees : Traversing Techniques – INorder and POSTorder Recursive CodesLecture5.5
- Binary Trees : Creating Binary Trees from PREorder and INorder.Lecture5.6
- Binary Trees : Creating Binary Trees from POSTorder and INorder.Lecture5.7
- Binary Trees : Arithmetic Expression TreesLecture5.8
- Binary Trees : Arithmetic Expression Trees – ExampleLecture5.9
- 5.1 Binary Search Trees 3
- Binary Trees : DrawbacksLecture6.1
- Binary Search Trees : IntroductionLecture6.2
- Insertion on Binary Search TreesLecture6.3
- 5.2 Heaps 4
- Introduction and Definition of Heaps (Max Heap and Min Heap).Lecture7.1
- Max Heap Creation (Insertion Operation).Lecture7.2
- Heap Tree Creation Time Complexity.Lecture7.3
- Heap Tree representation by using ArraysLecture7.4
- 6. AVL Trees 9
- 6.1 Why AVL Trees are required?Lecture8.1
- What is AVL Trees & Introduction.Lecture8.2
- ImbalanceLecture8.3
- LL ImbalanceLecture8.4
- RR ImbalanceLecture8.5
- LR ImbalanceLecture8.6
- RL ImbalanceLecture8.7
- AVL Tree Creation (Insertion) – 1Lecture8.8
- AVL Tree Creation (Insertion) – 2Lecture8.9
- 6.1 2ary Tree, Full Binary Tree, Complete Binary Tree - Properties. 1
- 7. graphs 3
This content is protected, please login and enroll course to view this content!