Все публикации

Hypothesis Testing

Control Hazard - Pipeline || CO

How to Remember Write Through and write Back Cache Updation Policies || OS

Modes of Data transfer Interrupt I/O || CO

Modes of Data Transfer - Programmed I/O with Analogy || CO

Modes of DMA transfer : Burst Mode, Cycle stealing mode & Interleaving Mode || CO

DMA : Direct Memory Access with Analogy || CO

Equivalences involving Quantifiers || DM

Example of DFS Traversal using Adjacency List - Odia || DS

Concept of Virtual Memory || OS

Insertion to AVL tree - Introduction || DS

Broadcasting, Unicasting, Multicasting || CN

Insertion in AVL tree - LR imbalance || DS

Insertion in AVL tree - RL imbalance and examples at the End of the Video|| DS

Deletion in AVL tree - Imbalances and solutions || DS

Insertion in AVL tree : LL Imbalance - DS

Deletion in AVL tree - Introduction || DS

Insertion in AVL tree - RR imbalance

Boruvka's Algorithm - Odia

Prim's Algorithm - Odia

Master's Theorem (Subtraction and Division) to find Time complexity

AVL Tree / BST - Binary Search Tree

MultiStage Graph | DAA - ODIA

ROW AND COLUMN MAJOR ORDER OF ARRAY