--- a/cws/cw04.tex	Sat Nov 02 19:07:19 2019 +0000
+++ b/cws/cw04.tex	Sat Nov 02 21:23:42 2019 +0000
@@ -94,7 +94,7 @@
 % BF IDE
 % https://www.microsoft.com/en-us/p/brainf-ck/9nblgggzhvq5
   
-\section*{Coursework 9 (Scala)}
+\section*{Part 9 (Scala)}
 
 \mbox{}\hfill\textit{``[Google’s MapReduce] abstraction is inspired by the}\\
 \mbox{}\hfill\textit{map and reduce primitives present in Lisp and many}\\
@@ -103,7 +103,7 @@
 \bigskip\medskip
 
 \noindent
-This coursework is about the shunting yard algorithm by Dijkstra and a
+This part is about the shunting yard algorithm by Dijkstra and a
 regular expression matcher by Brzozowski. The preliminary part is due on
 \cwNINE{} at 4pm; the core, more advanced part, is due on \cwNINEa{}
 at 4pm. The preliminary part is about the Shunting Yard Algorithm that