diff --git a/slides/index.html b/slides/index.html
index fd849b3..0d419be 100644
--- a/slides/index.html
+++ b/slides/index.html
@@ -165,7 +165,7 @@ <h2 id="schedule-and-slides"><a name="introduction"></a>Schedule and Slides</h2>
 <tr class="even">
 <td></td>
 <td>Wed. Mar. 3</td>
-<td>Krukal’s Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4)</td>
+<td>Kruskal’s Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4)</td>
 <td><a href="./kruskal-find-union.pptx">ppt</a>, <a href="./kruskal-find-union.pdf">pdf</a></td>
 <td></td>
 <td></td>
diff --git a/slides/index.md b/slides/index.md
index 7e16e26..9f7454b 100644
--- a/slides/index.md
+++ b/slides/index.md
@@ -21,7 +21,7 @@ CS4102 - Algorithms
 | | Wed. Feb. 24 | Heap Sort, Strassen's algorithm <br/> (CLRS Ch. 6 & 4.2) |[pptx](./heapsort_strassen.pptx), [pdf](./heapsort_strassen.pdf) | | Module 1 HW Soft Deadline | Written Recurrence Relations (Recommended) |
 | | Fri. Feb. 26  | | | | | |
 | Graphs | Mon. Mar. 1 | Review of Graphs, BFS <br/> (CLRS Ch. 22.1-22.2) | [ppt](./graphs-BFS-recorded.pptx), [pdf](./graphs-BFS-recorded.pdf), [live](./graphs-BFS-live.pptx) | | | |
-| | Wed. Mar. 3 | Krukal's Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4) | [ppt](./kruskal-find-union.pptx), [pdf](./kruskal-find-union.pdf) | | | 1 Module one advanced HW (Recommended) |
+| | Wed. Mar. 3 | Kruskal's Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4) | [ppt](./kruskal-find-union.pptx), [pdf](./kruskal-find-union.pdf) | | | 1 Module one advanced HW (Recommended) |
 | | Fri. Mar. 5  | | | Quiz 1 | | |
 | | Mon. Mar. 8 | Depth-First Search <br/> (CLRS 22.3) | [pptx](./graphs-dfs.pptx), [pdf](./graphs-dfs.pdf) | | | |
 | | Wed. Mar. 10 | Topological Sorting and Strongly Connected Components <br/> (CLRS 22.4 & 22.5) | [pptx](./graphs-topoSort-connComponents.pptx), [pdf](./graphs-topoSort-connComponents.pdf)| | Module 1 HW Hard Deadline | Graphs Written (Recommended) |