11:26

Chained hashing with example | Q.9a | vtu model question paper 2024 solution | DSA | BCS304

23:16

Meld given min leftist trees | Q.10b | vtu model question paper 2024 solution | DSA | BCS304

15:00

Transform forest into binary tree | Q.8b | vtu model question paper 2024 solution | DSA | BCS304

15:37

Leftist tree | Q.9b | vtu model question paper 2024 solution | DSA | BCS304

19:19

Construct min winner tree | Q.7c | vtu model question paper 2024 solution | DSA | BCS304

15:00

Depth First Search Algorithm | Q.7a | vtu model question paper 2024 solution | DSA | BCS304

17:42

Construct Threaded Binary Tree | Q.6c | vtu model question paper 2024 solution | DSA | BCS304

13:00

Sparse Matrix Linked Representation | Q.5c | vtu model question paper 2024 solution | DSA | BCS304

20:00

Construct Binary Search Tree | Q.8a | vtu model question paper 2024 solution | DSA | BCS304

12:16

Construct Binary Tree | Q.7b | vtu model question paper 2024 solution | DSA | BCS304

15:43

Polynomial Addition using Linked List | Q.4b | vtu model question paper 2024 solution | DSA | BCS304

13:13

Preorder Inorder & Postorder Traversal | Q5a | vtu model question paper 2024 solution | DSA | BCS304

13:00

Evaluate postfix expression | Q.2c | vtu model question paper 2024 solution | DSA | BCS304

09:46

Data Structure Operations | Data Structure | L 3 | Data Structures & Applications

15:15

Classifications of Data Structures | Data Structure | L 2 | Data Structures & Applications

12:21

Introduction to Data Structures | Data Structure | L 1 | Data Structures & Applications

11:00

AVL Tree Deletion Example | Transform & Conquer | L 139 | Design & Analysis of Algorithm

13:00

AVL Tree Deletion with two child | Transform & Conquer | L 138 | Design & Analysis of Algorithm

11:01

AVL Tree Deletion with one child | Transform & Conquer | L 137 | Design & Analysis of Algorithm

11:01

AVL Tree Deletion with no child | Transform & Conquer | L 136 | Design & Analysis of Algorithm

15:00

AVL Tree Insertion Example | Transform & Conquer | L 135 | Design & Analysis of Algorithm

13:01

AVL Tree Insertion Example | Transform & Conquer | L 134 | Design & Analysis of Algorithm

14:29

AVL Tree Insertion & Rotation Example | Transform & Conquer | L 133 | Design & Analysis of Algorithm

17:18

AVL Tree Insertion and Rotation | Transform & Conquer | L 133 | Design & Analysis of Algorithm

11:04

AVL Tree Rotation - Double RL Rotation | Transform & Conquer | L132 | Design & Analysis of Algorithm

12:15

AVL Tree Rotation - Double LR Rotation | Transform & Conquer | L131 | Design & Analysis of Algorithm

12:01

Rotations in AVL Tree Single Rotation | Transform & conquer | L 130 | Design & Analysis of Algorithm

10:09

Introduction to AVL Tree | Transform & conquer | L 129 | Design & Analysis of Algorithm

16:49

Balanced Search Tree Introduction | Transform & conquer | L 128 | Design & Analysis of Algorithm

10:46

Transform & Conquer Technique Introduction | L 127 | Design & Analysis of Algorithm

13:13

Huffman Tree & Codes Example3 | Greedy Tech.| L 126 | Design & Analysis of Algorithm

15:00

Huffman Tree & Codes Example2 | Greedy Tech.| L 126 | Design & Analysis of Algorithm

12:12

Huffman Tree & Codes Example1 | Greedy Tech.| L 125 | Design & Analysis of Algorithm

10:35

Huffman Tree & Codes | Greedy Tech.| L 124 | Design & Analysis of Algorithm

10:02

Topological Sorting Source Removal Method | Dec & Conq Tech.| L 123 | Design & Analysis of Algorithm

10:06

Topological Sorting DFS Method | Decrease & Conquer Tech. | L 122 | Design & Analysis of Algorithm

08:10

Topological Sorting Source Removal Method | Dec & Conq Tech.| L 121 | Design & Analysis of Algorithm

11:41

Topological Sorting DFS Method | Decrease & Conquer Tech. | L 120 | Design & Analysis of Algorithm

12:09

Multiprogramming & Timesharing | Computer System Structure | Operating System | L 8

11:00

Multicore Systems, Clustered Systems | Computer System Architecture | Operating System | L 7

11:00

Single Processor and Multiprocessor Systems | Computer System Architecture | Operating System | L 6

11:01

Depth First Search Example 3 | Decrease & Conquer Tech. | L 119 | Design & Analysis of Algorithm

12:01

Depth First Search Example 2 | Decrease & Conquer Tech. | L 118 | Design & Analysis of Algorithm

16:02

Depth First Search Example 1 | Decrease & Conquer Tech. | L 117 | Design & Analysis of Algorithm

08:27

Depth First Search Introduction | Decrease & Conquer Tech. | L 116 | Design & Analysis of Algorithm

11:08

Breadth First Search Example 3 | Decrease & Conquer Tech. | L 115 | Design & Analysis of Algorithm

10:03

Breadth First Search Example 2 | Decrease & Conquer Tech. | L 114 | Design & Analysis of Algorithm

12:39

Breadth First Search Example 1 | Decrease & Conquer Tech. | L 113 | Design & Analysis of Algorithm

14:15

Breadth First Search Example 1 | Decrease & Conquer Tech. | L 112 | Design & Analysis of Algorithm

12:12

Breadth First Search Introduction | Decrease & Conquer Tech. | L111 | Design & Analysis of Algorithm

14:03

Graph Traversal - BFS and DFS | Decrease & Conquer Tech. | L110 | Design & Analysis of Algorithm

03:01

C Program to find area and perimeter of a rectangle | C #Program Learn Logic | Lec 16

02:42

C Program to print Odd or Even Number | C #Program Learn Logic | Lec 15

09:10

I/O Structure | Computer System Organization | Operating System | L 5

10:14

Storage Structure | Storage Hierarchy | Computer System Organization | Operating System | L 4

09:28

Computer System Operation | Computer System Organization | Operating System | L3

05:06

Role of Operating System | Viewpoints of Operating System | Operating System | L2

10:08

Introduction to Operating System | Operating System | L1

09:23

Insertion Sort Algorithm Analysis | Decrease & Conquer Tech. | L109 | Design & Analysis of Algorithm

08:19

Insertion Sort Example2 | Decrease & Conquer Tech. | L 108 | Design & Analysis of Algorithm