cws/cw02.tex
changeset 276 52faee6d0be2
parent 268 e43f7e92ba26
child 284 9a04eb6a2291
--- a/cws/cw02.tex	Tue Aug 13 10:23:20 2019 +0100
+++ b/cws/cw02.tex	Fri Aug 16 06:51:06 2019 +0100
@@ -11,7 +11,7 @@
 
 \mbox{}\hfill\textit{``What one programmer can do in one month,}\\
 \mbox{}\hfill\textit{two programmers can do in two months.''}\smallskip\\
-\mbox{}\hfill\textit{ --- Frederick P.~Brooks (author of The Mythical Man-Month)}\bigskip
+\mbox{}\hfill\textit{ --- Frederick P.~Brooks (author of The Mythical Man-Month)}\bigskip\medskip
 
 \noindent
 This coursework is worth 10\%. The basic part is due
@@ -71,7 +71,7 @@
 integers, \texttt{.max} calculates the maximum of a list.\bigskip
 
 \noindent
-\textbf{For Part 2 + 3:} use \texttt{.split(",").toList} for splitting
+\textbf{For Part 2:} use \texttt{.split(",").toList} for splitting
 strings according to commas (similarly $\backslash$\texttt{n}),
 \texttt{.getOrElse(..,..)} allows to querry a Map, but also gives a
 default value if the Map is not defined, a Map can be `updated' by
@@ -102,9 +102,8 @@
 \begin{itemize}
 \item[(1)] Implement a function that `cleans' a string by finding all
   (proper) words in this string. For this use the regular expression
-  \texttt{$\backslash$w+} for recognising word characters and the
-  library function \texttt{findAllIn}. The function should return a
-  document (a list of
+  \texttt{\textbackslash{}w+} for recognising words and the library function
+  \texttt{findAllIn}. The function should return a document (a list of
   strings).\\
   \mbox{}\hfill [1 Mark]