
diff -r ecd989eee8bd -r 59779ce322a6 cws/cw06.tex
--- a/cws/cw06.tex	Wed Mar 20 21:50:20 2019 +0000
+++ b/cws/cw06.tex	Sat Jun 22 08:39:52 2019 +0100
@@ -7,7 +7,7 @@
 
 \section*{Resit Exam}
 
-The Scala part of the exam is worth 30\%. It is about `jumps'
+The Scala part of the exam is worth 50\%. It is about `jumps'
 within lists.
 
 \IMPORTANTEXAM{}
@@ -109,7 +109,7 @@
   \end{center}  
 
 
-  \mbox{}\hfill[Marks: 8\%]
+  \mbox{}\hfill[Marks: 12\%]
  
 \item[(2)] Write a function \texttt{search} that tests whether there
   is a way to reach the end of a list.  This is not always the
@@ -125,7 +125,7 @@
   In case of the empty list, \texttt{search} should return true since the
   end of the list is already reached.
   
-  \mbox{}\hfill\mbox{[Marks: 10\%]}
+  \mbox{}\hfill\mbox{[Marks: 18\%]}
 
 \item[(3)] Write a function \texttt{jumps} that calculates the
   shortest sequence of steps needed to reach the end of a list. One
@@ -138,7 +138,7 @@
   \texttt{None}. In the special case of the empty list, \texttt{jumps}
   should return \texttt{None}
 
-  \mbox{}\hfill\mbox{[Marks: 12\%]}
+  \mbox{}\hfill\mbox{[Marks: 20\%]}
   
 \end{itemize}\bigskip
 




