Y Learning

design and analysis of algorithm

Dijkstra Algorithm

Dijkstra Algorithm

Krushkal's & Prim's Algorithm for Minimum Spanning Tree

Krushkal's & Prim's Algorithm for Minimum Spanning Tree

Recurrence - Substitution Method (Design and Analysis of Algorithm) - Part-2

Recurrence - Substitution Method (Design and Analysis of Algorithm) - Part-2

Matrix Chain Multiplication

Matrix Chain Multiplication

Huffman Coding

Knapsack Problem

Knapsack Problem

LCS

Heap Sort

Quick Sort

Merge Sort

Deletion in Linked List

Deletion in Linked List

Linked List

Insertion sort

Bubble Sort

Selection Sort

Recovery System

Recovery System

Concurrency Control

Concurrency Control

Transaction Processing

Transaction Processing

Fourth Normal Form(4NF) , Fifth Normal Form(5NF)

Fourth Normal Form(4NF) , Fifth Normal Form(5NF)

Boyce Codd Normal Form

Boyce Codd Normal Form

Third Normal Form (3NF)

Third Normal Form (3NF)

Second Normal Form

Second Normal Form

First Normal Form

First Normal Form

Lossless Join

Dependency Preserving Decomposition

Dependency Preserving Decomposition

Functional Dependency

Functional Dependency

DFS (Depth First Search)

DFS (Depth First Search)

BFS (Breadth First Search)

BFS (Breadth First Search)

Graph

Creating AVL Tree

Creating AVL Tree