Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Data Structures & Algorithms
Data Structure And Algorithms
What is Data Structure
Introduction to Data Structure (57:00)
Data Structure and Types of Data Structure, Need of Data Structure (53:13)
Need of DS ,Characteristics of DS , Basic Operations of DS
Introduction to Algorithms
Introduction to Algorithms (50:26)
Analysis of Algorithms, Time Complexity & Space Complexity
Analysis of Algorithms, Time Complexity & Space Complexity (50:34)
Arrays
Introduction to Array, Types of Array, Representation of Array in Memory (55:56)
Representation of 2-D Array (55:53)
Operation of An Array (43:32)
Algorithm for Insertion in Arrays (45:45)
Element Insertion in Arrays (34:31)
Deletion Of An Element From An Array (40:45)
Introduction to Array, Types of Array, Representation of Array in Memory (31:10)
Searching Techniques
Searching in Arrays, Types of Search , Introduction to Linear Search, Algorithm and Program for Linear Search (40:59)
Intoduction to Binary Search, Algorithm and Program for Binary Search (48:31)
Sorting Techniques
Introduction to Sorting (Algorithm and Program of Selection Sort ) (51:19)
Basic of Bubble Sort (Algorithm and Program of Bubble Sort) (39:42)
Introduction to Insertion Sort (Definition, Example And Time Complexity of Insertion Sort and Algorithm ) (41:12)
Program for Insertion Sort And Introduction of Quick Sort with Example (43:18)
Introduction to Merge Sort , Examples and Algorithm (39:55)
Program for Merge Sort (43:10)
Introduction to Radix Sort with Example and Algorithm of Radix Sort (33:24)
Program for Radix Sort and Introduction to Bucket Sort with Example , Algorithm and Program. (48:14)
Introduction to Shell Sort and Algorithm of ShellSort (44:11)
Program For Shell Sort (17:49)
Algorithm and Program for Quick Sort (37:58)
Linked List
Introduction of Linked List and Need of Linked List (32:21)
Memory Allocation(Dynamic Vs. Static ) and Types of Linked List (46:02)
Basic Operation of Linked List and Algorithm and Program For Insertion of An Element to Begin The Linked List (40:33)
Algorithm and Program for Insertion of An Element To End The Linked List (33:39)
Insert Node at Given Position (50:10)
Algorithm and program for Delete Node from First Node in Linked List (42:15)
Deletion of Last Node of Linked List (48:37)
Deletion of Middle Node Between Linked List (46:53)
Deletion of All Nodes in Linked List (30:32)
Introduction of Doubly Linked List (59:36)
Insertion of Doubly LInked List (Algorithm) (32:09)
Insertion of Doubly LInked List (Program) (43:17)
Deletion of Doubly Linked List (Algorithm) (52:00)
Deletion of Doubly Linked List (Program) (47:38)
Reverse of Doubly Linked List (Algorithm and Program) (41:22)
Introduction of Circular Linked List (37:44)
Algorithm For Circular Linked List Part 1 (43:59)
Algorithm for Circular Linked List Part 2 (39:45)
Program for Insertion in Circular Linked List (23:01)
Program for Deletion and Traversing in Circular Linked List (23:33)
Algorithm for Circular Doubly Linked List (37:23)
Program for Circular Doubly Linked List (Insertion and Deletion ) (45:15)
Program for Circular Doubly Linked List (Searching, Updating , Display) (23:36)
Stack
Introduction to Stack (31:22)
Implementation and Application of Stack (40:33)
Program for Stack Implementation by Array (33:57)
Program for Stack Implementation by Linked List (40:45)
Application of Stack Infix, Postfix, Prefix (28:01)
Queue
Queue 01-Circular Queue 01 Introduction of Queue, Application, Types and Implementation of Queue (47:10)
Queue 02-Linked List Implementation of Queue (36:54)
Queue 03-Introduction of Circular Queue , Operation on Circular Queue and Algorithm and Source Code (45:02)
Queue 04-Implementation of Circular Queue using Linked List (37:30)
Queue 05-Introduction and Implementation of Deque (40:28)
Queue 06-Introduction of Priority Queue and Implementation of Priority Queue (42:06)
Queue 07-Source Code and Implementation of Priority Queue (21:57)
Tree
Tree 01-Introduction of Tree and Terminologies of Tree (44:32)
Tree 02-Application of Tree (44:34)
Tree 03-Implementation of Tree and Source Code (40:38)
Tree 04-Introduction and Implementation of Full Binary Tree and Perfect Binary Tree (35:59)
Tree 05-Introduction and Implementation of Complete Binary Tree and Balanced Binary Tree (38:17)
Tree 06-Introduction and Implementation of BST (29:45)
Tree 07-Introduction of AVL Tree (32:39)
Tree-8-Implementation of AVL Tree (26:33)
Tree-9 Introduction and Implementation of Red and Black Tree (29:14)
Application of Stack Infix, Postfix, Prefix
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock