diff --git a/semester4/dmdb/data-modelling-databases-summary.pdf b/semester4/dmdb/data-modelling-databases-summary.pdf
index 376e786..10797c4 100644
Binary files a/semester4/dmdb/data-modelling-databases-summary.pdf and b/semester4/dmdb/data-modelling-databases-summary.pdf differ
diff --git a/semester4/dmdb/parts/02_theory-background/01_normal-forms/05_decomposition-algorithm.tex b/semester4/dmdb/parts/02_theory-background/01_normal-forms/05_decomposition-algorithm.tex
index 4e859cb..9304abb 100644
--- a/semester4/dmdb/parts/02_theory-background/01_normal-forms/05_decomposition-algorithm.tex
+++ b/semester4/dmdb/parts/02_theory-background/01_normal-forms/05_decomposition-algorithm.tex
@@ -1,3 +1,4 @@
+\newpage
 \subsubsection{BCNF Decomposition Algorithm}
 \begin{algorithm}
     \caption{Decomposition algorithm}
diff --git a/semester4/dmdb/parts/02_theory-background/01_normal-forms/07_overview.tex b/semester4/dmdb/parts/02_theory-background/01_normal-forms/07_overview.tex
index a9ce4f7..8663da5 100644
--- a/semester4/dmdb/parts/02_theory-background/01_normal-forms/07_overview.tex
+++ b/semester4/dmdb/parts/02_theory-background/01_normal-forms/07_overview.tex
@@ -14,5 +14,6 @@ also known as \textit{key attributes}
               Every Non-trivial FD begins either with superkey or ends with prime attribute {\scriptsize (Attributes depend only on candidate keys)}
                                         & \cross     & \cross     & \cross     & \checkmark & \checkmark \\
               Every non-trivial FD begins with a superkey
-                                        & \cross     & \cross     & \cross     & \checkmark & \checkmark \\
+                                        & \cross     & \cross     & \cross     & \cross     & \checkmark \\
 \end{tables}
+This means that a relation in BNCF is free of redundancies based on functional dependencies.