Data Structures and Algorithms
5.0
(2)
31 learners
What you'll learn
This course includes
- 46.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 120 lessons • 46.5 hours of video
Data Structures and Algorithms
120 lessons
• 46.5 hours
Data Structures and Algorithms
120 lessons
• 46.5 hours
- Introduction to Data Structure and Algorithm?46:26
- Time and Space Complexity | DSA | Jenny's Lectures01:21:37
- 1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation22:38
- 1.2 Array Operations - Traversal, Insertion | Explanation with C Program | DSA Course28:51
- 1.3 Array Operations | Deletion from Array | Explanation with Code | Data Structure14:59
- 1.4 Pointers and Arrays | Data structure Tutorials25:05
- 1.5 Introduction to Two Dimensional (2D) Arrays | Implementation of 2D Arrays |Memory representation37:44
- 1.6 Pointers and 2-D Arrays | Two dimensional Array | Data Structures & Algorithm Tutorials24:49
- 3 LeetCode Questions That EVERY Interview Asks | Arrays in DSA01:14:01
- 2.1 Introduction to Linked List | Need of Linked List | DSA Tutorials22:11
- 2.2 Types of Linked List in Data Structures | DSA Full Course13:15
- 2.3 Arrays vs Linked List | Data structures21:20
- 2.4 Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials29:01
- 2.5 Insertion of a Node in Linked List(at Beginning,End,Specified Position)with Code | DSA Tutorials27:07
- 2.6 Deletion of a node from Linked List (from beginning, end, specified position) | DSA Tutorials25:54
- 2.7 Find length of Linked List- Iterative approach | DSA Tutorials05:56
- 2.8 Reverse a Linked List - Iterative Method | Data Structure Tutorials18:44
- 2.9 Introduction to Doubly Linked List in Data structures | DSA Tutorials08:54
- 2.10 Implementation of Doubly Linked List - Data Structures21:14
- 2.11 Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures35:15
- 2.12 Deletion from Doubly Linked List (beginning,end,specific position) | Data Structures Tutorials22:05
- 2.13 Reverse a Doubly Linked List | Data Structures & Algorithm Tutorials19:34
- 2.14 Circular Linked List in Data Structure | Creation and Display | DSA Course21:30
- 2.15 Implementation of Circular linked list in C | Data Structure Tutorials27:49
- 2.16 Insertion in Circular Linked List | Data Structure Tutorials19:45
- 2.17 Deletion of a Node from Circular Linked List(beginning, end, given position) | DSA Tutorials23:58
- 2.18 Reverse a Circular Linked List | Data Structure Tutorials17:32
- 2.19 Implementation of Doubly Circular Linked List| Creation and Display | Data Structures20:27
- 2.20 Insertion in Doubly Circular Linked List | Data Structure & Algorithm Tutorials25:49
- 2.21 Deletion from Doubly Circular Linked List | Data Structure & Algorithm Course21:17
- 3.1 Stack in Data Structure | Introduction to Stack | Data Structures Tutorials17:40
- 3.2 Implementation of Stack using Array | Data Structure and Algorithm Tutorials17:27
- 3.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials27:01
- 3.4 Infix Prefix and Postfix expressions | Data Structures Tutorials14:14
- 3.5 Infix to Postfix Conversion Rules using Stack | Data structures Tutorials12:33
- 3.6 Infix to Postfix using Stack | Data Structure and Algorithm20:10
- 3.7 Infix to Postfix conversion using Stack | Data structures and algorithms15:57
- 3.8 Infix to Prefix using Stack | Data Structures Tutorials24:05
- 3.9 Evaluation of Prefix and Postfix expressions using Stack | Data Structures21:03
- 3.10 Postfix Expression Evaluation using Stack | Data Structures and Algorithms11:02
- 3.11 Prefix to Infix Conversion | Postfix to Infix Conversion | Data structure Tutorials10:27
- 3.12 Expression Trees | Binary Expression Tree | Data Structures Tutorials13:17
- 3.13 Expression Tree from Postfix | Data Structures Tutorials10:05
- 4.1 Queue in Data Structure | Introduction to Queue | Data Structures Tutorials20:19
- 4.2 Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials23:06
- 4.3 Queue Implementation using Linked List in C | Data Structure Tutorials19:47
- 4.4 Circular Queue in Data Structure | Circular Queue using Arrays in C | DSA Tutorials24:19
- 4.5 Circular Queue in Data Structure | Circular Queue using Linked List | DSA Tutorials28:56
- 4.6 Implement Queue using Stack in C| Data Structures Tutorials29:06
- 4.7 DEQUE in Data Structure | Introduction to DEQue - Double Ended Queue12:45
- 4.8 Implementation of DEQUE using Circular Array | Data Structures Tutorials36:37
- 5.1 Tree in Data Structure | Introduction to Trees | Data Structures Tutorials29:17
- 5.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials24:11
- 5.3 Binary Tree Implementation in C Program | Data Structures Tutorials24:37
- 5.4 Binary Tree Representation |Array representation of Binary Tree | Data Structure17:50
- 5.5 Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms11:07
- 5.6 Binary Tree traversal | Preorder, Inorder, Postorder | Data Structures Tutorials20:13
- 5.7 Construct Binary Tree from Preorder and Inorder Traversal | Example | Data Structures Tutorials09:45
- 5.8 Construct Binary Tree from Postorder and Inorder with example | Data structures Course07:34
- 5.9 Construct Binary Tree from Preorder and Postorder traversal | Data Structure Tutorials19:00
- 5.10 Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course16:41
- 5.11 Construct Binary Search Tree(BST) from Preorder example |Data Structures & Algorithm08:58
- 5.12 Construct Binary Search Tree(BST) from Postorder Traversal | Data structures11:27
- 5.13 AVL Tree - Insertion, Rotations(LL, RR, LR, RL) with Example | Data Structure Tutorials24:30
- 5.14 AVL Tree Insertion | with Solved Example | Data Structures & Algorithm Tutorials26:25
- 5.15 AVL Tree Deletion in Data structures | with Example | DSA Tutorials15:02
- 5.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials33:00
- 5.17 Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials27:41
- 5.18 Red Black Tree Deletion | DSA Tutorials for Beginners01:03:05
- 5.19 Splay Tree Introduction | Data structure & Algorithm28:32
- 5.20 Splay Tree Insertion | Data structure34:26
- 5.21 Splay Trees Deletion | Bottom-up Splaying | Data Structure & Algorithm13:24
- 5.22 Splay Tree Deletion | Top Down Splaying | Data Structure & Algorithm20:44
- 5.23 Introduction to B-Trees | Data Structures & Algorithm Tutorials09:43
- 5.24 Insertion in B-tree of Order 3 | B-Tree Example | Data structures and algorithms09:51
- 5.25 Insertion in B-Tree of Order 5 | Data structures and algorithms Tutorials15:57
- 5.26 Insertion in B-Tree of Order 5 with Given Alphabets | Data structures and algorithms17:40
- 5.27 Insertion in B-Tree of Order 4 (Data Structure)15:23
- 5.28 B-Tree Deletion in Data Structures | DSA Tutorials28:04
- 5.29 B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials18:37
- 5.30 B+ Tree Deletion| with example |Data structure & Algorithm Tutorials16:16
- 5.31 B+ Tree Insertion | Create B+ Tree of Order 5 | Data Structures Tutorials11:56
- 6.1 Graph Representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List12:12
- 6.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures20:27
- 6.3 Types of Edges in DFS | Edge Classification | Data Structures and Algorithms25:53
- 6.4 Minimum Spanning Tree | Properties of MST | Data Structures Tutorials15:58
- 6.5 Prim's Algorithm for Minimum Spanning Tree | Data Structures Tutorials10:22
- 6.6 Kruskals Algorithm for Minimum Spanning Tree- Greedy method | Data structures09:11
- 6.7 Minimum spanning Tree(MST) | UGC NET(Computer Science) Practice Question with Solution07:33
- 6.8 Cycle detection in Directed Graph |Data Structures and Algorithms Tutorials10:36
- 6.9 Detect Cycle in Undirected Graph | Data Structures and Algorithms06:35
- 6.10 Topological Sorting (with Examples) | How to find all Topological Orderings of a Graph14:18
- 6.11 Connected Components |How to find Connected Components in Graph | Graph Theory20:37
- 6.12 Bridges(Cut Edge) in a Graph | Find All Bridges in a Graph | Graph Theory20:54
- 6.13 Dijkstra Algorithm | Single Source Shortest Path| Greedy Method34:36
- 6.14 Bellman Ford Algorithm-Single Source Shortest Path | Dynamic Programming15:43
- 6.15 Floyd Warshall Algorithm All Pair Shortest Path algorithm | Data Structures and Algorithms31:23
- 7.1 Linear Search Algorithm | Linear Search in C | Data Structures Tutorials15:09
- 7.2 What is Binary Search | Binary Search Algorithm with example | Data Structures Tutorials23:30
- Binary Search Introduction | Theory + Code | Order Agnostic Binary Search01:02:00
- Binary Search Interview Questions | Search Insert Position | First and Last Position of Element01:56:51
- 7.3 Bubble Sort Algorithm| Data Structures Tutorials35:36
- 7.4 Insertion Sort Algorithm |Explanation with C Program| Data Structure Tutorials28:13
- 7.5 Selection Sort in Data Structure | Selection Sort Algorithm with C Program17:49
- 7.6 Quick Sort in Data Structure | Sorting Algorithm | DSA Full Course24:43
- 7.7 Merge Sort in Data Structure | Sorting Algorithms| DSA Full Course35:28
- 7.8 Max Heap Insertion and Deletion | Heap Tree Insertion and Deletion with example| Data Structure34:28
- 7.9 Heap Sort | Heapify Method | Build Max Heap Algorithm | Sorting Algorithms46:03
- 7.10 Radix Sort/Bucket Sort in Data Structure | Sorting Algorithm11:51
- 7.11 Shell Sort | Sorting Algorithms | Full explanation with Code | DSA Course34:07
- 7.12 Counting Sort (Analysis and Code) | Easiest Explanation | Data Structure Tutorials31:40
- 7.13 Radix Sort - Easiest explanation with Code | Sorting Algorithms | Data Structures Tutorials34:13
- 8.1 Hashing Techniques to Resolve Collision| Separate Chaining and Linear Probing | Data structure25:51
- 8.2 Hashing - Quadratic Probing | Collision Resolution Technique | Data structures and algorithms15:58
- 8.3 Double Hashing | Collision Resolution Technique | Data Structures and algorithms26:52
- 9.1 Huffman Coding -Greedy Method |Data Structures Tutorials34:05
- 9.2 Huffman Coding with Probabilities | UGC NET Previous Year Question15:23
- Complete DSA and Java Course for Placement | Early Bird Offer Inside #coding #java #dsa01:01
- Exclusive | Only 3 Days are left !!06:52
- Introduction to Dynamic Programming | Greedy vs DP29:20
