--- a/coursework/cw01.tex	Mon Aug 24 15:03:55 2020 +0100
+++ b/coursework/cw01.tex	Mon Aug 31 16:57:15 2020 +0100
@@ -9,16 +9,19 @@
 \begin{document}
 \newcolumntype{C}[1]{>{\centering}m{#1}}
 
-\section*{Coursework 1 (Strand 1)}
+\section*{Coursework 1}
 
-This coursework is worth 4\% and is due on \cwONE{} at
-18:00. You are asked to implement a regular expression matcher
-and submit a document containing the answers for the questions
-below. You can do the implementation in any programming
-language you like, but you need to submit the source code with
-which you answered the questions, otherwise a mark of 0\% will
-be awarded. You can submit your answers in a txt-file or pdf.
-Code send as code.
+This coursework is worth 5\% and is due on \cwONE{} at 18:00. You are
+asked to implement a regular expression matcher and submit a document
+containing the answers for the questions below. You can do the
+implementation in any programming language you like, but you need to
+submit the source code with which you answered the questions,
+otherwise a mark of 0\% will be awarded. You can submit your answers
+in a txt-file or pdf.  Code send as code. Please package everything
+inside a zip-file that creates a directory with the name
+\[\texttt{YournameYourfamilyname}\]
+
+\noindent on my end. Thanks!
 
 
 
@@ -71,8 +74,12 @@
   That means do not treat the extended regular expressions
 by just translating them into the basic ones. See also Question 3,
 where you are asked to explicitly give the rules for \textit{nullable}
-and \textit{der} for the extended regular expressions. So something like
-$der\,c\,(r^+) \dn der\,c\,(r\cdot r^*)$ is \emph{not} allowed.\medskip
+and \textit{der} for the extended regular expressions. Something like
+
+\[der\,c\,(r^+) \dn der\,c\,(r\cdot r^*)\]
+
+\noindent is \emph{not} allowed as answer in Question 3 and \emph{not}
+allowed in your code.\medskip
 
 \noindent
 The meanings of the extended regular expressions are
@@ -116,9 +123,9 @@
 \subsection*{Question 2 (Unmarked)}
 
 Can you please list all programming languages in which you have
-already written programs (like spent at least a good working day
-fiddling with the program or programs)?  This is just for my
-curiosity to estimate what your background is.
+already written programs (include only instances where you have spent
+at least a good working day fiddling with a program)?  This is just
+for my curiosity to estimate what your background is.
 
 \subsection*{Question 3}
 
@@ -170,7 +177,7 @@
 
 \begin{center}
 \def\arraystretch{1.2}  
-\begin{tabular}{@{}r|m{6mm}|m{6mm}|m{6mm}|m{10mm}|m{10mm}|m{10mm}|m{10mm}|m{10mm}}
+\begin{tabular}{@{}r|m{3mm}|m{6mm}|m{6mm}|m{10mm}|m{6mm}|m{10mm}|m{10mm}|m{10mm}}
   string & $a^?$ & $\sim{}a$ & $a^{\{3\}}$ & $(a^?)^{\{3\}}$ & $a^{\{..3\}}$ &
      $(a^?)^{\{..3\}}$ & $a^{\{3..5\}}$ & $(a^?)^{\{3..5\}}$ \\\hline
   $[]$           &&&&&&& \\\hline 
@@ -294,7 +301,10 @@
 \subsection*{Question 7}
 
 Let $r_1$ be the regular expression $a\cdot a\cdot a$ and $r_2$ be
-$(a^{\{19,19\}}) \cdot (a^?)$.  Decide whether the following three
+$(a^{\{19,19\}}) \cdot (a^?)$.\medskip
+
+\noindent
+Decide whether the following three
 strings consisting of $a$s only can be matched by $(r_1^+)^+$.
 Similarly test them with $(r_2^+)^+$. Again answer in all six cases
 with yes or no. \medskip