Binary file cws/cw03.pdf has changed

--- a/cws/cw03.tex	Mon Nov 04 11:48:37 2019 +0000
+++ b/cws/cw03.tex	Mon Nov 04 13:28:05 2019 +0000
@@ -28,7 +28,7 @@
 \noindent
 This part is about searching and backtracking. You are asked to
 implement Scala programs that solve various versions of the
-\textit{Knight's Tour Problem} on a chessboard. The preliminary part is
+\textit{Knight's Tour Problem} on a chessboard. The preliminary part (4\%) is
 due on  \cwEIGHT{} at 4pm; the core part is due on \cwEIGHTa{} at 4pm.
 Note the core, more advanced, part might include material you have not
 yet seen in the first three lectures. \bigskip

Binary file cws/cw04.pdf has changed

--- a/cws/cw04.tex	Mon Nov 04 11:48:37 2019 +0000
+++ b/cws/cw04.tex	Mon Nov 04 13:28:05 2019 +0000
@@ -104,7 +104,7 @@
 
 \noindent
 This part is about the shunting yard algorithm by Dijkstra and a
-regular expression matcher by Brzozowski. The preliminary part is due on
+regular expression matcher by Brzozowski. The preliminary part (4\%) 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
 transforms the usual infix notation of arithmetic expressions into the