DATA STRUCTURES
5.0
(1)
24 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 • 67 lessons • 46.5 hours of video
DATA STRUCTURES
67 lessons
• 46.5 hours
DATA STRUCTURES
67 lessons
• 46.5 hours
- DS_1-Introduction to Data Structures | Must-Know for Every CS Student | DSA using C 08:29
- DS_2-Arrays in Data Structures | Advantages & Limitations Explained | DSA using C 13:05
- DS_3-Single Linked List in C | Creation and Display Explained Step-by-Step | DSA using C 42:19
- DS_4-Single Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C 23:17
- DS_5-Single Linked List in C | Deletion from Beginning, End & Specific Position | DSA using C 21:32
- DS_6-Single Linked List in C | Count Nodes & Reverse the List Easily | DSA using C 21:31
- DS_7-Singly Linked List | Advantages & Disadvantages Explained Clearly | DSA using C 10:44
- DS_8-Circular Linked List in C | Create and Display Explained Step-by-Step | DSA using C 19:42
- DS_9-Circular Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C 22:34
- DS_10-Circular Linked List in C | Deletion from Beginning, End & Any Position | DSA using C 20:08
- DS_11-Doubly Linked List in C | Create and Display Explained Step-by-Step | DSA using C 21:26
- DS_12-Doubly Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C 18:57
- DS_13-Doubly Linked List in C | Deletion from Beginning, End & Specific Position | DSA using C 20:54
- DS_14-Stack Using Arrays in C | Implementation Explained Step-by-Step | DSA using C 26:23
- DS_15-Queue Using Arrays in C | Step-by-Step Implementation Tutorial | DSA using C 28:10
- DS_16-Stack Using Linked List in C | Step-by-Step Implementation | DSA using C 23:16
- DS_17-Queue Using Linked List | Linked List Based Enqueue & Dequeue | DSA using C 21:26
- DS_18-Infix to Postfix Conversion | Stack Application in Data Structures | DSA using C 27:33
- DS_19-Infix to Postfix Conversion Examples | Stack Application in Data Structures | DSA using C 24:17
- DS_20-Evaluation of Postfix Expression | Stack Application in C Programming | DSA using C 19:21
- DS_21-Check Balanced Parentheses Using Stack | Data Structures in C | DSA using C 25:56
- C_38,DS_22-Linear Search in C | Step-by-Step with Example | DSA using C 10:15
- C_39,DS_23- Binary Search Algorithm Explained in C | Step-by-Step with Example | DSA using C 31:10
- C_40,DS_24-Bubble Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 24:47
- C_41,DS_25- Insertion Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 45:58
- DS_26-Selection Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 38:26
- D_27-Merge Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 14:03
- D_28-Heap Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 21:02
- DS_29-Quick Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 33:40
- DS_30-Radix Sort & Bucket Sort in C | Step-by-Step with Example | DSA using C 21:15
- DS_31Shell Sort Algorithm | Step-by-Step Explanation with Example | DSA using C 28:04
- DS_32-Tree Terminology in Data Structures | Root, Leaf, Edge, Level & More Explained | DSA using C 30:12
- DS_33-Binary Trees in Data Structures | Types of Binary Trees Explained | DSA using C 27:00
- DS_34-Binary Tree Representation in C | How Binary Trees Are Represented | DSA using C 17:12
- DS_35-Binary Tree Traversals Explained | Inorder, Preorder, Postorder with ExampleN | DSA using C 22:56
- DS_36-Build an Expression Tree | Data Structures Simplified | DSA using C 21:44
- DS_37-Binary Tree Construction Using Inorder and Preorder Traversals | DSA using C 09:01
- DS_38-Binary Tree Construction Using Inorder and Postorder | Step-by-Step in C | DSA using C 12:21
- DS_39-Binary Search Tree (BST) in C | Full Operations Explained | DSA using C 14:32
- DS_40-Binary Search Tree (BST) Construction & Insertion | Step-by-Step in C | DSA using C 16:23
- DS_41-Binary Search Tree Deletion | Step-by-Step Logic with Examples | DSA using C 28:02
- DS_42-Find Element in BST | Binary Search Tree Search Operation | DSA using C 20:14
- DS_43-Minimum Element in Binary Search Tree | Step-by-Step in C | DSA using C 09:17
- DS_44-Maximum Value in Binary Search Tree | Step-by-Step in C | DSA using C 07:29
- AVL TREE - DATA STRUCTURES 17:06
- ROTATIONS IN AVL TREES - DATA STRUCTURES 20:55
- AVL TREE CONSTRUCTION | ELEMENT INSERTION - DATA STRUCTURES 22:15
- GRAPH TERMINOLOGY & TYPES OF GRAPHS - DATA STRUCTURES 19:10
- REPRESENTATION OF GRAPHS - DATA STRUCTURES 10:16
- DEPTH FIRST SEARCH(DFS) | GRAPH TRAVERSALS - DATA STRUCTURES 13:43
- BREADTH FIRST SEARCH(BFS) | GRAPH TRAVERSALS - DATA STRUCTURES 12:01
- INTRODUCTION TO SPANNING TREE AND MINIMUM COST SPANNING TREE IN DATA STRUCTURES || DATA STRUCTURES 13:34
- PRIM'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || DATA STRUCTURES 17:49
- EXAMPLE TO FIND MINIMUM COST SPANNING TREE USING PRIM'S ALGORITHM || PRIM'S ALGORITHM EXAMPLE 17:01
- KRUSKAL'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || DATA STRUCTURES 11:10
- Linear Data Structures Using C 💻 || Course for Beginners || Arrays, Lists, Stacks, Queues Explained 11:34:04
- Non-Linear Data Structures Using C || Trees & Graphs Explained || Full DSA Course | Easy Explanation 06:23:36
- Top 5 Free Websites for Practice Coding || Practice Coding || Learn Coding from Free Websites 13:50
- Coding on Your Smart TV: Execute C, C++, Java, Python Programs || Execute Programs on SmartTV 10:22
- Introduction to HASHING in Data Structures || Hash Functions,Hash Table, Hash Keys,Hash Values in DS 10:30
- COLLISION HANDLING TECHNIQUES || SEPERATE CHAINING || OPEN AND CLOSED HASHING || HASHING IN DS 14:50
- LINEAR PROBING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS 13:08
- DOUBLE HASHING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS 11:23
- QUADRATIC PROBING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS 10:45
- Hash Functions in Data Structures || Division Method || Mid Square || Folding Method || DS 16:19
- REHASHING IN DATA STRUCTURES || HASHING IN DS 10:19
- Linear Data Structures and Algorithms in Python - 8 Hour Deep Dive with Code || DSA using Python 07:46:12
Take this course with you
Download the app to continue lessons from your phone anytime.
