diff --git a/year2/semester1/logseq-stuff/assets/MA284-Week11_1668603812290_0.edn b/year2/semester1/logseq-stuff/assets/MA284-Week11_1668603812290_0.edn
index 11baae5d..ab9a38bd 100644
--- a/year2/semester1/logseq-stuff/assets/MA284-Week11_1668603812290_0.edn
+++ b/year2/semester1/logseq-stuff/assets/MA284-Week11_1668603812290_0.edn
@@ -1 +1 @@
-{:highlights []}
\ No newline at end of file
+{:highlights [], :extra {:page 1}}
diff --git a/year2/semester1/logseq-stuff/pages/Matrices.md b/year2/semester1/logseq-stuff/pages/Matrices.md
index 6bc0bf73..888c03c3 100644
--- a/year2/semester1/logseq-stuff/pages/Matrices.md
+++ b/year2/semester1/logseq-stuff/pages/Matrices.md
@@ -8,6 +8,12 @@
 -
 - # Adjacency Matrices
 	- What is an **adjacency matrix**? #card
+	  card-last-interval:: -1
+	  card-repeats:: 1
+	  card-ease-factor:: 2.5
+	  card-next-schedule:: 2024-05-30T23:00:00.000Z
+	  card-last-reviewed:: 2024-05-30T00:17:42.413Z
+	  card-last-score:: 1
 		- If the graph has $n$ vertices, labelled $\{1,2,\cdots, n\}$, then the **adjacency matrix** is an $m \times n$ **binary** matrix, $A$, with entries
 			- $$a_{i,j} = 
 			  \begin{cases}
@@ -16,6 +22,12 @@
 			  \end{cases}$$
 			- ![image.png](../assets/image_1669209153547_0.png)
 	- ## Properties of the Adjacency Matrix #card
+	  card-last-interval:: -1
+	  card-repeats:: 1
+	  card-ease-factor:: 2.5
+	  card-next-schedule:: 2024-05-30T23:00:00.000Z
+	  card-last-reviewed:: 2024-05-30T00:17:59.125Z
+	  card-last-score:: 1
 		- The adjacency matrix of a graph is **symmetric**.
 		- If $B = A^k$, then $b_{i,j}$ is the number of paths of length $k$ from vertex $i$ to vertex $j$.
 		- We can work out if a graph is connected by looking at the eigenvalues of $A$.
@@ -34,6 +46,12 @@
 	- What is the **eccentricity of a vertex**?
 		- The **eccentricity of a vertex** is the greatest distance between that vertex & any other vertex in the graph.
 	- What is the **radius of a graph**? #card
+	  card-last-interval:: -1
+	  card-repeats:: 1
+	  card-ease-factor:: 2.5
+	  card-next-schedule:: 2024-05-30T23:00:00.000Z
+	  card-last-reviewed:: 2024-05-30T00:18:05.726Z
+	  card-last-score:: 1
 		- The **radius of a graph** is the minimum eccentricity of any vertex.
 	- What is the **diameter of a graph**?
 		- The **diameter of a graph** is the maximum eccentricity of any vertex.
diff --git a/year2/semester1/logseq-stuff/pages/contents.md b/year2/semester1/logseq-stuff/pages/contents.md
new file mode 100644
index 00000000..3cf20d57
--- /dev/null
+++ b/year2/semester1/logseq-stuff/pages/contents.md
@@ -0,0 +1 @@
+-
\ No newline at end of file
diff --git a/year2/semester1/logseq-stuff/pages/hls__MA284-Week11_1668603812290_0.md b/year2/semester1/logseq-stuff/pages/hls__MA284-Week11_1668603812290_0.md
new file mode 100644
index 00000000..e51b250d
--- /dev/null
+++ b/year2/semester1/logseq-stuff/pages/hls__MA284-Week11_1668603812290_0.md
@@ -0,0 +1,2 @@
+file:: [MA284-Week11_1668603812290_0.pdf](../assets/MA284-Week11_1668603812290_0.pdf)
+file-path:: ../assets/MA284-Week11_1668603812290_0.pdf
diff --git a/year2/semester2/CT2109/Assignments/Assignment-03/latex/CT2109-Assignment-03.pdf b/year2/semester2/CT2109/Assignments/Assignment-03/latex/CT2109-Assignment-03.pdf
index 4df81598..1ac20ca8 100644
Binary files a/year2/semester2/CT2109/Assignments/Assignment-03/latex/CT2109-Assignment-03.pdf and b/year2/semester2/CT2109/Assignments/Assignment-03/latex/CT2109-Assignment-03.pdf differ