Data Structures and Algorithms Course in Hindi
5.0
(0)
8 learners
What you'll learn
This course includes
- 31.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 92 lessons • 31.5 hours of video
Data Structures and Algorithms Course in Hindi
92 lessons
• 31.5 hours
Data Structures and Algorithms Course in Hindi
92 lessons
• 31.5 hours
- Introduction to Data Structures & Algorithms 31:43
- Time Complexity and Big O Notation (with notes) 32:52
- Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes) 33:42
- Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes) 39:48
- How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes) 46:17
- Arrays and Abstract Data Type in Data Structure (With Notes) 25:25
- Array as An Abstract Data Type in Data Structures(With Notes) 21:55
- Implementing Array as an Abstract Data Type in C Language 36:13
- Operations on Arrays in Data Structures: Traversal, Insertion, Deletion and Searching 28:45
- Coding Insertion Operation in Array in Data Structures in C language 16:34
- Coding Deletion Operation in Array Using C Language (With Notes) 17:35
- Linear Vs Binary Search + Code in C Language (With Notes) 35:12
- Introduction to Linked List in Data Structures (With Notes) 25:01
- Linked List Data Structure: Creation and Traversal in C Language 23:47
- Insertion of a Node in a Linked List Data Structure 18:41
- Insertion in a Linked List in C Language 24:25
- Deletion in a Linked List | Deleting a node from Linked List Data Structure 17:18
- Delete a Node from Linked List (C Code For Deletion From Beginning, End, Specified Position & Key) 23:51
- Circular Linked List and Operations in Data Structures (With Notes) 16:41
- Circular Linked Lists: Operations in C Language 20:37
- Doubly Linked Lists Explained With Code in C Language 13:12
- Introduction to Stack in Data Structures 19:55
- Implementing Stack Using Array in Data Structures 21:43
- C Code For Implementing Stack Using Array in Data Structures 16:25
- Push, Pop and Other Operations in Stack Implemented Using an Array 24:18
- Coding Push(), Pop(), isEmpty() and isFull() Operations in Stack Using an Array| C Code For Stack 26:04
- Peek Operation in Stack Using Arrays (With C Code & Explanation) 21:22
- stackTop, stackBottom & Time Complexity of Operations in Stack Using Arrays 12:56
- How to Implement Stack Using Linked List? 12:01
- Implementing all the Stack Operations using Linked List (With Code in C) 30:42
- peek(), stackTop() and Other Operations on Stack Using Linked List (with C Code) 15:05
- Parenthesis Matching Problem Using Stack Data Structure (Applications of Stack) 18:37
- Parenthesis Checking Using Stack in C Language 20:29
- Multiple Parenthesis Matching Using Stack with C Code 20:25
- Infix, Prefix and Postfix Expressions 26:54
- Infix To Postfix Using Stack 16:35
- Coding Infix to Postfix in C using Stack 28:03
- Queue Data Structure in Hindi 10:52
- Queue Implementation: Array Implementation of Queue in Data Structure 18:20
- Array implementation of Queue and its Operations in Data Structure 16:44
- C Code For Queue and its Operations Using Arrays in Data Structure 14:19
- Introduction to Circular Queue in Data Structures 24:25
- enqueue(), dequeue() & other Operations on Circular Queue 14:46
- C Code For Circular Queue & Operations on Circular Queue in Hindi 20:50
- Queue Using Linked Lists 26:30
- Implementing Queue Using Linked List in C Language (With Code) 16:04
- Double-Ended Queue in Data Structure (DE-Queue Explained)🔥 14:58
- Introduction to Sorting Algorithms 09:49
- Criteria For Analysis of Sorting Algorithms 19:10
- Bubble Sort Algorithm in Hindi 32:22
- Bubble Sort Program in C 22:43
- Insertion Sort Algorithm in Hindi 32:17
- Insertion Sort in C Language (With Explanation) 29:45
- Selection Sort Algorithm 24:55
- Selection Sort Program in C 15:27
- QuickSort Algorithm in Hindi (With Code in C) 52:29
- Analysis of QuickSort Sorting Algorithm 20:14
- MergeSort Sorting Algorithm in Hindi 35:34
- MergeSort Source Code in C (Helpful Explanation) 22:35
- Count Sort Algorithm 27:05
- Introduction to Trees 17:10
- What is a Binary Tree? 10:06
- Types of Binary Trees 20:26
- Representation of a Binary Tree 20:08
- Linked Representation Of Binary Tree in C 17:14
- Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals) 13:27
- Preorder Traversal in a Binary Tree (With C Code) 11:24
- PostOrder Traversal in a Binary Tree (With C Code) 10:54
- InOrder Traversal in a Binary Tree (With C Code) 13:41
- *Best* Trick To Find PreOrder, InOrder & PostOrder Traversal 13:38
- Binary Search Trees: Introduction & Properties 14:28
- Checking if a binary tree is a binary search tree or not! 16:25
- Searching in a Binary Search Trees (Search Operation) 16:55
- C Code For Searching in a BST 07:39
- Iterative Search in a Binary Search Tree 07:14
- Insertion in a Binary Search Tree 17:42
- Deletion in a Binary Search Tree 22:42
- C Code For Deletion in a Binary Search Tree 22:31
- AVL Trees - Introduction 11:26
- Insertion and Rotation in AVL Tree 18:26
- AVL Trees - LL LR RL and RR rotations 22:46
- C Code For AVL Tree Insertion & Rotation (LL, RR, LR & RL Rotation) 31:29
- Introduction to Graphs | Graph Data Structure 18:01
- Representation of Graphs - Adjacency List, Adjacency Matrix & Other Representations 20:45
- Graph traversal & Graph traversal algorithms 10:19
- Breadth First Search (BFS) Graph Traversal in Data Structures 19:00
- BFS Implementation in C | C Code For Breadth First Search 12:03
- Depth First Search (DFS) Graph Traversal in Data Structures 10:52
- DFS Implementation in C | C Code For Depth First Search 06:07
- Spanning Trees & maximum no of possible spanning trees for complete graphs 17:49
- Calculating Spanning tree Cost & Minimum Spanning Tree 15:52
- Prims Minimum Spanning Tree Algorithm (Step by Step with examples) 19:40
Take this course with you
Download the app to continue lessons from your phone anytime.
