## Normalization In DBMS : 1NF, 2Nf, 3NF, BCNF

Normalization In DBMS In this article we are going to discuss about Normalization De Normalization First Normal Form (1NF) Second Normal Form (2NF) Third Normal Form (3NF) Fourth Normal Form…

Skip to content
##
Normalization In DBMS : 1NF, 2Nf, 3NF, BCNF

##
Algorithms and Data Structures Tutorial

##
Branch and bound | FIFO and LIFO Branch and bound

##
Sum of Subsets Problem | Backtracking

##
Algorithms Notes

##
n queen problem | Backtracking

##
Backtracking | Algorithm for Backtracking

##
All Pairs Shortest Path Problem | Floyd Warshall Algorithm

##
0/1 knapsack problem | Dynamic Programming Application

##
Matrix chain multiplication | Algorithm

Normalization In DBMS In this article we are going to discuss about Normalization De Normalization First Normal Form (1NF) Second Normal Form (2NF) Third Normal Form (3NF) Fourth Normal Form…

Continue Reading
Normalization In DBMS : 1NF, 2Nf, 3NF, BCNF

Algorithms and Data Structures Tutorial Prerequisites In order to under the concept of Algorithms and Data Structures Tutorial,reader must have a basic concept of C language. Even though you don't…

Continue Reading
Algorithms and Data Structures Tutorial

Branch and bound Branch and bound is a general algorithm (or systematic method) for finding an optimal solution to various optimization problems, especially in discrete and combinatorial optimization. The Branch…

Continue Reading
Branch and bound | FIFO and LIFO Branch and bound

sum of subsets problem sum of subsets problem is nothing but Suppose we are given n distinct positive numbers and we desire to find all combinations of these numbers whose…

Continue Reading
Sum of Subsets Problem | Backtracking

Algorithms Notes Algorithms Notes Introduction to Algorithm as Technology Time complexity And Space complexity Performance Analysis Amortized Analysis | Techniques used in Amortized Analysis Asymptotic Notation | Big oh…

Continue Reading
Algorithms Notes

n queen problem A classic chess puzzle – n queen problem is Place 8 queen pieces on a chess board so that none of them can attack one another …

Continue Reading
n queen problem | Backtracking

Backtracking Backtracking is an algorithmic technique for recursively solving problems by trying to build a solution incrementally, one piece at a time, removing the solutions that fail to meet the…

Continue Reading
Backtracking | Algorithm for Backtracking

All Pairs Shortest Path Problem Let G be a directed graph with n vertices and cost be its adjacency matrix The problem is to determine a matrix A such that…

Continue Reading
All Pairs Shortest Path Problem | Floyd Warshall Algorithm

0/1 knapsack problem An object is either included or not included in the knapsack. i.e., xi = 0/1, 1 ≤ i≤ n Thus the problem can be stated as: …

Continue Reading
0/1 knapsack problem | Dynamic Programming Application

Matrix chain multiplication Matrix chain multiplication is nothing but it is a sequence or chain A1, A2, …, An of n matrices to be multiplied. i.e, we want to compute…

Continue Reading
Matrix chain multiplication | Algorithm