Главная
Study mode:
on
1
1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation
2
1.2 Array Operations - Traversal, Insertion | full explanation with C program | data structure
3
1.3 Array Operations | deletion from array | full explanation with code | data structure
4
1.4 Pointers and arrays | Data structure
5
1.5 Introduction to Two Dimensional (2D) arrays | Implementation of 2D arrays |Memory representation
6
1.6 Pointers and 2-D Arrays | Two dimensional array | data structure
7
2.1 Introduction to linked list | Need of linked list | data structures
8
2.2 Types of linked list in data structures
9
2.3 Arrays vs Linked List | Data structures
10
2.4 Linked List implementation in C/C++ | creation and display | data structures
11
2.5 Insert a node in Singly Linked List(at beginning,end,specified position)with code|data structure
12
2.6 Delete a node from linked list (from beginning, end, specified position) | Data Structure
13
2.7 Find length of linked list- Iterative approach | data structures
14
2.8 Reverse a linked list - Iterative method | data structure
15
2.9 Introduction to Doubly Linked List - Data structures
16
2.10 Implementation of Doubly Linked List - Data Structures
17
2.11 Insertion in Doubly Linked List(beginning, end, specific position) - Data Structures
18
2.12 Deletion from doubly linked list (from beginning,end,specific position) | data structures
19
2.13 Reverse a doubly linked list | data structures
20
2.14 Circular linked list in data structure - Creation and display
21
2.15 Implementation of Circular linked list | data structure
22
2.16 Circular linked list - Insertion | data structure
23
2.17 Circular linked list - deletion (from beginning, end, given position) | data structures
24
2.18 Reverse a circular linked list | data structure
25
2.19 Doubly Circular Linked List - Creation and Display | Data Structures
26
2.20 Doubly Circular linked list - Insertion | data structure
27
2.21 Doubly circular linked list - Deletion | data structure
28
3.1 Stack in data structure | Introduction to stack | data structures
29
3.2 Implementation of stack using Array | data structure
30
3.3 Stack implementation using linked list | data structures
31
3.4 Infix Prefix and Postfix expressions | Data structures
32
3.5 Infix to Postfix conversion rules using STACK | Data structures
33
3.6 Infix to Postfix using stack | Data structures
34
3.7 Infix to Postfix conversion using Stack | Data structures and algorithms
35
3.8 infix to prefix using stack | Data structures
36
3.9 Evaluation of Prefix and Postfix expressions using stack | Data structures
37
3.10 Postfix Expression evaluation using Stack | Data structures and algorithms
38
3.11 prefix to infix conversion | postfix to infix conversion | example (Data structure)
39
3.12 Expression trees | Binary Expression Tree | Data structures
40
3.13 Expression Tree from postfix | Data structures
41
4.1 Queue in data structure | Introduction to queues | data structures
42
4.2 Implementation of queue using Arrays | data structures
43
4.3 Queue implementation using linked list | data structure
44
4.4 Circular queue in data structure | circular queue using array | data structures
45
4.5 Circular queue in data structure | Circular queue using linked list | data structures
46
4.6 Implement Queue Using Stack | Data Structures
47
4.7 Deque in data structure | introduction to deque - Double Ended Queue
48
4.8 Implementation of DEQUE using circular array | Data structures
49
5.1 Tree in data structure | Introduction to trees | Data structures
50
5.2 Binary Tree and its Types | Data Structures
51
5.3 Binary Tree Implementation | Data Structures
52
5.4 Binary Tree Representation |Array representation of binary tree | Data Structure
53
5.5 Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms
54
5.6 Binary Tree traversal : Preorder, Inorder, Postorder
55
5.7 Construct Binary Tree from Preorder and Inorder traversal with example | Data structures
56
5.8 Construct Binary Tree from Postorder and Inorder with example | Data structures
57
5.9 Construct Binary Tree from Preorder and Postorder traversal | Data structure
58
5.10 Binary Search Trees (BST) - Insertion and Deletion Explained
59
5.11 Construct Binary Search Tree(BST) from Preorder( example) |Data structures
60
5.12 Construct a Binary Search Tree(BST) from given Postorder traversal | Data structures
61
5.13 AVL tree - Insertion, Rotations(LL, RR, LR, RL) with example | data structure
62
5.14 AVL tree Insertion | with solved example | Data structures
63
5.15 AVL Tree Deletion in Data structures | AVL tree deletion example
64
5.16 Red Black tree | Introduction to Red Black trees | Data structure
65
5.17 Red Black Tree Insertion
66
5.18 Red Black Tree deletion | Data structure
67
5.19 Splay Tree Introduction | Data structure
68
5.20 Splay Tree Insertion | Data structure
69
5.21 Splay Trees deletion | Bottom-up Splaying | Data structure
70
5.22 Splay Tree Deletion | Top Down Splaying | Data Structure
71
5.23 Introduction to B-Trees | Data structures
72
5.24 Insertion of elements in B-tree of order 3 | Data structures and algorithms
73
5.25 Insertion of elements in B-Tree of Order 5 | Data structures and algorithms
74
5.26 Insertion in B-Tree of Order 5 with Given Alphabets | Data structures and algorithms
75
5.27 Insertion in B-Tree of Order 4 (Data Structure)
76
5.28 B tree deletion in data structures
77
5.29 B+ tree insertion | B+ tree creation example | Data structure
78
5.30 B+ tree deletion| with example |Data structure
79
5.31 B+ tree insertion | create b+ tree of order 5 | Data structures
80
6.1 Graph representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List
81
6.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures
82
6.3 Types of edges in DFS | Edge classification | Data Structures and Algorithms
83
6.4 Minimum spanning tree | Data structures
84
6.5 Prim's Algorithm for Minimum Spanning Tree | Data structures
85
6.6 Kruskals Algorithm for Minimum Spanning Tree- Greedy method | Data structures
86
6.7 UGC NET(computer science) Practice question with solution on Minimum spanning Tree
87
6.8 Detect Cycle in Directed Graph |Data Structures and Algorithms
88
6.9 Detect Cycle in Undirected Graph | Data Structures and Algorithms
89
6.10 Topological Sorting (with Examples) | How to find all topological orderings of a Graph
90
6.11 Connected Components: how to find connected components in graph | Graph Theory
91
6.12 Finding All Bridges(cut edge) in a Graph | Data structures and algorithms
92
6.13 Dijkstra Algorithm- single source shortest path| With example | Greedy Method
93
6.14 Bellman Ford Algorithm-Single Source Shortest Path | Dynamic Programming
94
6.15 Floyd Warshall Algorithm All Pair Shortest Path algorithm | data structures and algorithms
95
7.1 Linear Search Algorithm with example | linear search in C | Data structures
96
7.2 What is binary search | Binary Search Algorithm with example | Data structures
97
7.3 Bubble Sort Algorithm| Data Structures
98
7.4 Insertion Sort Algorithm | Data Structure
99
7.5 Selection Sort Algorithm | Data Structure
100
7.6 Quick Sort Algorithm | Sorting Algorithm | Quick Sort Algorithm Explained
101
7.7 Merge Sort Algorithm | Sorting Algorithms| Merge Sort in Data structure
102
7.8 Max Heap Insertion and Deletion | Heap Tree Insertion and Deletion with example| Data Structure
103
7.9 Heap Sort | Heapify Method | Build Max Heap Algorithm
104
7.10 Radix Sort/Bucket Sort Explained- Easiest Way with Examples - Sorting Algorithm
105
7.11 Shell Sort algorithm | sorting algorithms | Full explanation with code | data structures
106
7.12 Counting Sort algorithm (analysis and code)- Easiest explanation | data structure
107
7.13 Radix Sort - Easiest explanation with code | sorting algorithms | data structures
108
8.1 Hashing techniques to resolve collision| Separate chaining and Linear Probing | Data structure
109
8.2 Hashing - Quadratic Probing | Collision Resolution Technique | Data structures and algorithms
110
8.3 Hashing: Double Hashing | Collision Resolution technique | Data Structures and algorithms
111
9.1 Huffman coding example -Greedy Method |Data Structures
112
9.2 Huffman coding example with probabilities-UGC NET previous year questions
Description:
Dive into a comprehensive course on data structures and algorithms, covering essential topics from arrays and linked lists to advanced tree structures and graph algorithms. Learn implementation techniques for various data structures, including stacks, queues, and trees. Explore sorting and searching algorithms, hashing techniques, and advanced concepts like AVL trees, Red-Black trees, and B-trees. Master graph traversal methods, minimum spanning tree algorithms, and shortest path algorithms. Gain practical knowledge through C/C++ programming examples and solve real-world problems using efficient data structures and algorithms.
Data Structures and Algorithms
Add to list
1 of 112