This course was created with the
course builder. Create your online course today.
Start now
Create your course
with
Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Complete Data Structure and Algorithm - DSA Training by Mr. Vimal Daga
DSA
Session 1 - 25th Nov - Introduction-Data Structure and Algorithm (DSA)|hard disk|RAM |CPU executes instructions|Asymptotic analysis| (115:43)
Summary Session 1
Session 2 - 29th Nov - Algorithms | Performance | CPU Time| Time Complexity | Implement Algorithms | Big O(Constant) | Big O(Linear) | Function Parameter | Asymtotic Analysis (101:48)
Summary Session 2
Session 3 - 30th Nov - Unit Time | Arithmetic Progression | Approach to achieve Time Complexity | Search Algorithm | Search Element | Pseudo Code | Best Case(Lucky) Scenario | Worst Case Scenario | Linear Search or Sequencial Search (136:28)
Session 3 - Summary
Session 4 - 1st Dec - Time Complexity | Asymptotic Analysis | Why neglect the constant? | Linear Search | Create an Algorithm | Inputs and Outputs of Algorithm | Success Code | Failure Code | Best Case Scenario | Worst Case Scenario (98:41)
Session 4 - Summary
Session 5 - 13th Dec - Linear Search Algorithm | Best Case Scenario | Worst Case Scenario | Pre- created Algorithms | Unordered Array of data | Exit Code | Return Keyword | Garbage Value| Upperbound Value (109:09)
Session 5 - Summary
Session 6 - 14th Dec - Linear Search | Traversal | Length of the data | Stack Memory | Pointers | Big O(n) | Big O(1) | Best Case Scenario | Worst Case Scenario (120:41)
Session 6 - Summary
Session 7 - 20th Dec - Compile time | Run time | Static memory allocation | Dynamic memory | Stack memory | Heap memory |Organizing data | Array | Data structure | Continuous and Non-continuous way | Linked List | Demo of C programming language | printf function | scanf function | studio.h library | Pointer | Time complexity for reading of array | Big O notation (98:46)
Session 7 - Summary
Session 8 - 21st Dec - Heap Memory | Stack Memory | Mallock Function | Dereferencing | Static Memory Allocation | Dynamic Memory Allocation | Compile Time | Allocation at Run Time | Stack Frame | Dynamic Array (126:37)
Session 8 - Summary
Session 9 - 22nd Dec - Access data value after function finished | Pointer to pointer or Double pointer | Use of * and ** in Double pointer | Use case of double pointer | Allocate heap memory using function | Allocation heap memory for array in C++ | De-allocation heap memory for array in C++ (126:15)
Session 9- Summary
Session 10 - 29th Dec - Member Access Operator | Static array | Dynamic array | Algorithm for extending dynamic array (117:44)
Session 10 - Summary
Session 11 - 30th Dec - Class Template | More than one argument to templates | Create Dynamic array in heap memory (126:40)
Session 11 - Summary
Session 12 - 3rd Jan - Iteration | Recursion | Stack Memory | stackoverflow | Direct recursion | Indirect recursion | Find factorial using recursion | Base Condition (130:25)
Session 12 - Summary
Session 13 - 4th Jan - " Space Complexity | Iteration | Recursion | Types of Recursion | Tail Recursion | TCO (Tail Call Optimization) | Top Down Approach | Recursion | Recursion Relationship | Recursive Call | Worst Case Scenario | Stack Memory | Base Case" (125:35)
Session 13 - Summary
Session 14 - 5th Jan- "Signatures | Recursive Call | Head or Non- Tail Recursion | Tail Recursion | Iteration | Recursion | Automatic Optimization | Stack Overflow | TCO ( Tail Call Optimization)| Demonstration of TCO" (137:15)
Session 14 - Summary
Session 15 - 10th Jan - Natural Numbers | Fibonacci Series | Tail Recursion (122:23)
Session 15- Summary
Session 16 - 12th Jan - "STL (Standard Template Library) |Time Complexity | Extend Array | Append Data | CPU Time | POP | Vector | Capacity Function | push_back | Size Function " (116:20)
Session 16 - Summary
Session 17 - 17th Jan- Create dynamic array | Vector | Traversal Operation | Iterator Class | push_back keyword | itr object | foreach loop | Challenges in array (102:49)
Session 17 - Summary
Session 18 - 18th Jan - Limitation of Array| OutOfMemory Exception | Continuous way | Non-continuous way | Linked List | Node | Self-referencing class (131:59)
Session 18 - Summary
Session 19 - 19th Jan - Linked List | Head Node| Last Node | Create Node | Updating Memory Address of a node | Linked List Variables | Insertion Operation in linked list | Traverse into linked list using loop (112:44)
Session 19 - Summary
Session 20 - 31st Jan - Create Linked List Using Constructor | Read Operation | Length Operation | Abstract Data Type(ADT)| Destructor | Delete Linked List Using Destructo (118:28)
Summary - Session 20
Session 21 - 7th Feb- Insertion Operation on Array | Time Complexity of Insertion Operation on Array | Insertion Operation on Linked List | Time Complexity (Best Case Scenario) of Insertion Operation on Linked List | Time Complexity (Worst Case Scenario) of Insertion Operation on Linked List (106:34)
Summary - Session 21
Session 22 - 8th Feb - LINKED LIST | GET | SET | UPDATE | ARROW OPERATOR | ITERATION | CONSTRUCTOR | DESTRUCTOR | ACCESSING THE DATA | Best Case and Worst Case scenarios | Head node | Tail node (103:38)
Session 22 - Summary
Session 23 - 9th Feb - Singly linked list using STL | forward_list library | Doubly Linked List | Create Node in Doubly Linked List (80:10)
Summary - Session 23
Session 24 - 10th Feb - Create Doubly Linked List | Insert Operation | Forward Display Operation | Reverse Display Operation | isEmpty method (104:46)
Summary - Session 24
Session 25 14th Feb - push back operation | push front operation | Time complexity of push back & front method | peek operation | Time complexity of peek operation | pop operation | Time complexity of pop operation (114:27)
Session 25 - Summary
Session 26 - 15th Feb - FIFO(First In First Out) | Queue Data Structure | Push Operation in Queue | Pop Operation in Queue (63:50)
Summary - Session 26
Session 27 - 16th Feb - Queue : Using Doubly Linked List | Enqueue | Time Complexity of enqueue method | Dequeue | Time Complexity of dequeue method | Display Method | Time Complexity of display method | isEmpty method | Time Complexity of isEmpty method (95:48)
Summary - Session 27
Session 28 - 17th Feb_Revision (120:28)
Session 29 - 21st Feb_Revision (93:08)
Session 30 - 23rd Feb-stack data structures|Time complexity | space complexity |queue |array|list|pop operation|puch back |pop back |activation record |LIFO| (97:01)
Session 31 - 24th Feb - Balanced Brackets Problem | Create string using STL | capacity method | length method | pop_back method | push_back method | traversing using iterator | getline method | Different between cin and getline (114:12)
Session 31 - Summary
Session 32 - 28th Feb_Revision (87:50)
Session 33 - 1st Mar - Create stack using STL | push Method | pop method | top method | empty method | Balanced Brackets Problem (76:02)
Session 33 - Summary
Session 34_1 - 2nd March_Revision (47:23)
Session 34 - 3rd March - Tree Data Structure | Root Node | Edge | Siblings | Vertices | Leaf Node | Parent Node | Child Node | Sub Tree | Degree of the node | Binary Node (71:37)
Session 34 - Summary
Session 35 - 14th March - Binary Tree | Degree of the Node | Create a Tree using Singly Linked List | Create a Tree using Doubly Linked List | Left Child | Right Child (121:23)
Session 35 - Summary
Session 36 - 11th April - Pseudocode for creating a binary tree using a queue (109:13)
Session 36 - Summary
Session 37 - 12th April - CPP Code for creating a binary tree using a queue (118:54)
Session 38 - 13th April_Revision (65:13)
Session 39 - 18th April - Formula for maximum number of nodes in any level | nullptr | isFull() method in Queue | isEmpty() method in Queue | root node creation in Tree (101:47)
Session 37,39 - Summary
Session 40 - 19th April - Create Binary tree using a queue data structure | CreateTree() method | Create lchild | Create rchild (92:37)
Session 40 - Summary
Session 41 - 20th April - Linear Data Structures | Non-linear Data Structures | Breadth-First Traversal | Depth-First Traversal | Level Order Tree Traversal | Inorder Traversal | Preorder Traversal | Postorder Traversal (100:29)
Session 41 - Summary
Session 42 - 25th April - In-order traversal of a Tree Using Recursion | Pre-order traversal of a Tree Using Recursion | Post-order traversal of a Tree Using Recursion (101:35)
Session 42 - Summary
Session 43 - 27th April - Benefits of Level Order Traversal | Level Order Traversal Using Queue | Process of a queue in level order traversing | C++ Code for Level Order Traversal Using Queue (89:20)
Session 43 - Summary
Session 44 - 2nd May-Revision Session (91:09)
Session 45 - 3rd May - Drawbacks of Linear Search | Advantages of Binary Search | Drawbacks of Binary Search | Binary Search Tree (BST) | Why do we need BST | Standard rule for a BST | Time Complexity of Binary Tree | Time Complexity of Binary Search Tree (94:51)
Session 45 - Summary
Session 46 - 4th May - C++ code for the creation of BST | CreateNode() Function | Insert() Function | Use of Inorder in BST | InOrder() Function (103:51)
Session 46 - Summary
Session 47_1 - 9th May-Revision Session (81:09)
Session 47 - 10th May-BST tree | Unbalanced tree | right-skewedtree | skewed binary tree | Left-Skewed Binary Tree | Right-Skewed Binary Tree | height of a tree | balanced binarytree | balance factor | Code for calculating the height of a binarytree (86:11)
Session 47 - Summary
DSA Session - 6th July-Revision Session (94:28)
Practice Set
Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Set 9
Set 10
Set 11
Set 12
Extra Sessions
Scalable algo | binary search | Working of RAM (119:10)
Discussion on time complexity of Searching algos | Sorting techniques | Bubble sort | complexity analysis | nested loops (90:57)
Bubble sort algo | bubble sort best-case and worst-case scenerio | real use-case of Bubble sort | Bubble sort time complexity (80:49)
Merge Sort | complexity of Merge Sort Algo | Where is Merge sort required (149:29)
Merge sort and it's steps | length of array | time complexity of Split array algorithm | time complexity of 2-way merging algorithm | | time complexity of merge sort | solution of two sum problem | time complexity of two sum problem after solving with merge sort (120:16)
Session 4 - 1st Dec - Time Complexity | Asymptotic Analysis | Why neglect the constant? | Linear Search | Create an Algorithm | Inputs and Outputs of Algorithm | Success Code | Failure Code | Best Case Scenario | Worst Case Scenario
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock