Data Structure Lectures in Hindi
5.0
(1)
13 learners
What you'll learn
This course includes
- 28 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 83 lessons • 28 hours of video
Data Structure Lectures in Hindi
83 lessons
• 19.5 hours
Data Structure Lectures in Hindi
83 lessons
• 19.5 hours
- DSUC1: Introduction to Data Structure | Basic Terminology of DS | Elementary Data Organization 15:29
- DSUC2:Classification of Data Structure | Linear and Non-Linear | Primitive vs Non-Primitive DS 13:16
- DSUC3: Operations on Data Structures | Abstract data type (ADT) | Built in Data Types in C 10:53
- DSUC4 Time Space trade off with Example in Data Structure | Space Time Trade Off 13:25
- DSUC5: Arrays Definition, Single and Multidimensional Arrays in Data Structure 15:07
- DSUC6: Address Calculation in One Dimension Array|Single Dimensional (1 D) Array Memory Calculation 14:18
- DSUC7: Two Dimensional Array in Data Structure | Memory Representation of 2D Array 15:52
- DSUC8: Row Major and Column Major Representation of Two Dimensional Array|Calculate Address 2D Array 15:23
- DSUC9: How to Calculate Row Major and Column Major Address in Two Dimentional Array 2D Array 07:55
- DSUC10: Three Dimensional Array in Data Structure | Memory Representation of 3D Array 14:32
- DSUC11:Row Major & Column Major formula for 3d Array | How to Find Address of an Element in 3d Array 22:00
- DSUC12: how to calculate address in three dimensional array | Row and Column Mejor Solved Example 10:12
- DSUC13: Multidimensional Array Representation in Memory | n dimensional array in data structure 10:52
- DSUC14: Applications of Array in data structure| Sparse matrix and its representation 05:52
- DSUC15: What is Sparse Matrix | Sparse matrices array and linked list representations 11:20
- DSUC16: Operations on Linear Array in Data Structure | Travarsal an array | Traversing Linear Array 13:49
- DSUC17: Insertion Operations on Linear Array in Data Structure | Inserting Element in the Array 13:23
- DSUC18: Deletion Operations on Linear Array in Data Structure | Deletion Element in the Array 11:25
- DSUC19: Bubble Sort Algorithm in Data Structure | Bubble Sorting Analysis Complexity 25:13
- DSUC20: Linear Search Algorithms in Data Structures With Example | Linear Search in C 17:09
- DSUC21: Binary Search Algorithm | Binary Search C Program | Time Complexity | Data Structure 23:40
- DSUC22: Linked list in Data Structure | Introduction to Linked List | Memory Representation 13:53
- DSUC 23: Pointer Implementation of Singly Linked Lists | Linked list program in C 12:43
- DSUC24: Difference between Linked List and Arrays | Arrays Vs Linked Lists | Data Structures 13:29
- DSUC25: Types of Linked List - Singly Linked, Doubly Linked , Circular Linked List | Data Structure 12:44
- DSUC26: Linked List Operations:Traverse,Insert, Delete|How to Traverse a Linked List|Data Structure 11:46
- DSUC27: Inserting a New Node in a Linked List | C Program to Insertion Element in Linked List 17:43
- DSUC28: Delete Node From Singly Linked List | Deletion from Linked List in Data Structure 10:20
- DSUC29: Doubly Linked List |Travarsal ,Insertion and Deletion in doubly Linked List|Data Structure 18:18
- DSUC30: Circular Linked List Operations | Insertion, Deletion, and Traversal of the Circular List 16:35
- DSUC31: Polynomial Representation using Linked List | Polynomial Addition Using Linked List 14:41
- DSUC32: Generalized linked lists | What is the generalized list in a data structure |Representation 10:07
- DSUC33: Multivariable Polynomial Representation Using Generalized Linked List 12:13
- DSUC34: Stack in Data Structure | LIFO Principle of Stack| Applications of Stack | Feature of Stack 13:19
- DSUC35: Array Implementation of Stack in C | Stack Representation Using Array | PUSH POP Operation 09:22
- DSUC36: Linked List Implementation of Stack in C | Stack representation using linked list 10:38
- DSUC37: Arithmetic Expression | Polish Notation | Infix prefix , Postfix expression | Data structure 13:51
- DSUC38: Infix to Postfix Conversion Using Stack Algorithm| Infix to Postfix using stack | Example 14:41
- DSUC39: Infix to Postfix conversion using Stack | Infix to Postfix Conversion | Data Structure 15:58
- DSUC40: Infix to Prefix Conversion using Stack | Stack Application in Data Structure |Solved example 08:39
- DSUC41: Postfix to Infix using Stack | Postfix to Prefix Conversion using Stack | Data Structure 10:06
- DSUC42: Prefix to Infix Conversion Using Stack | prefix to postfix using stack | Data Structure 09:09
- DSUC43:Evaluation of Postfix Expression using Stack in Data Structure with Example|Postfix Evaluaton 08:04
- DSUC44: Recursion Implementation using Stack in Data Structure | Direct and Indirect recursion 07:45
- DSUC45:Types of Recursion Function | Tail Recursion | Non Tail Recursion Stack | Data Structure 10:02
- DSUC46: Recursive Algorithm for Factorial | Stack Implementation of Factorial | Data Structure 12:17
- DSUC47: Fibonacci Series Using Stack | Recursion Fibonacci Explained With Example | Data Structure 13:33
- DSUC48: Tower of Hanoi Algorithm | Tower of Hanoi Using Stack in Data Structure |TOH Using Recursion 24:15
- DSUC49: Introduction to Queues | What is Queue | Features of Queue | Applications of Queue 12:29
- DSUC50: Implementation of Queue Data Structure | Array Representation | Insertion and Deletion Algo 23:34
- DSUC51: Linked List Representation of Queue |Queue Implementation Using Linked List | Data structure 14:59
- DSUC52: Types of Queues in DS | Simple Queue | Circular Queue Insertion and Deletion Algorithm 19:47
- DSUC53: Priority Queue in Data Structure | Priority Queue using Linked List and Array Representation 14:52
- DSUC54: Double Ended Queue (Deque) | Deque Insertion and Deletion Algorithm | Data Structure 19:01
- DSUC55: Tree in Data Structure | Tree Properties | Basic Terminology of Tree in Hindi 28:15
- DSUC56: Binary Tree in Data Structure | Types of Binary Tree | Strictly Binary Tree 12:23
- DSUC57: Complete Binary Tree in Data Structure with Example | Perfect Binary Tree 15:36
- DSUC58: Balanced Binary Tree | ExtendedBinaryTree in Data Structure | 2 Tree 10:52
- DSUC59: Representation of Binary Tree in Memory | Linked Representation Using Linked List 16:59
- DSUC60: Sequential Representation of Binary Tree | Binary Tree Representation Using Array 16:15
- DSUC61: Traversing of Binary Tree in Data Structure | Inorder, Preorder and Postorder | Recursion 16:40
- DSUC62: Preorder Tree Traversal Using Stack| Preorder BinaryTree Traversal without Recursion 08:17
- DSUC63: Inorder Tree Traversal Using Stack| Inorder BinaryTree Traversal without Recursion 09:35
- DSUC64: PostorderTree Traversal Using Stack| Postorder BinaryTree Traversal without Recursion 07:39
- DSUC65: Constructing Binary Tree from given Tree Traversal | Binary Tree from Preorder and Inorder 13:10
- DSUC66: Constructing Binary Tree from given Tree Postorder and Inorder Traversal 08:53
- DSUC67: Constructing Binary Tree from given Tree Preorder and Postorder Traversal 12:27
- DSUC68: Binary Search Tree (BST) | Introduction | Advantages and disadvantages of BST 13:32
- DSUC69: Binary Search Tree Operations| Data Structure | Insertion and Deletion in Binary Search Tree 18:34
- DSUC70: Binary Search Tree Deletion in data Structure | Binary Search Tree Deletion of a Node 16:37
- DSUC71: AVL Trees in Data Structures| AVL Rotation | Left- Left | Right- Right | Left- Right 30:40
- DSUC72: AVL Tree Insertion Example Step by Step | AVL Tree Rotation 11:01
- DSUC73: AVL Tree Insertion Example-2 Step by Step | AVL Tree Rotation 14:39
- DSUC74: AVL Tree Deletion | Deleton in AVL Tree | R0 Rotation | R1 Rotation | R-1 Rotation 15:56
- DSUC75: AVL Tree Deletion Example Step by Step | Solved Example of AVL Tree Deletion 08:01
- DSUC76: Threaded Binary Tree | Threaded Binary Trees in Data Structure | Solved Example 21:23
- DSUC77: Graph in Data Structure | Introduction to Graphs | Graph Terminology , Degree, Path etc. 15:53
- DSUC78: Types of Graph in Data Structure | Complete Graph, Finite and Infinite Gaph etc 16:59
- DSUC79: Graph Representation in Data Structure | Sequential Representation of Graph 14:37
- DSUC80: Linked Representation of Graph in Data Structure | Adjacency List Representation 13:48
- DSUC81: Graph Traversing in Data Structure | Depth First Search | Breadth First Search | DFS and BFS 19:29
- DSUC82: Depth First Search | Breadth First Search | DFS and BFS Solved Example 12:02
- DSUC: Data Structure Important Questions for AKTU| AKTU Semester Exam | DS Question Bank 06:50
Take this course with you
Download the app to continue lessons from your phone anytime.
