--- a/cws/core_cw03.tex	Mon Nov 10 16:24:46 2025 +0000
+++ b/cws/core_cw03.tex	Thu Nov 13 17:44:58 2025 +0000
@@ -16,7 +16,7 @@
 % BF IDE
 % https://www.microsoft.com/en-us/p/brainf-ck/9nblgggzhvq5
   
-\section*{Core Part 3 (Scala, 3 Marks)}
+\section*{Core Part 3 (Scala, 2 Marks)}
 
 \mbox{}\hfill\textit{``[Google’s MapReduce] abstraction is inspired by the}\\
 \mbox{}\hfill\textit{map and reduce primitives present in Lisp and many}\\
@@ -62,7 +62,7 @@
 \bigskip
 
 
-\subsection*{Core Part (3 Marks, files postfix.scala, postfix2.scala)}
+\subsection*{Core Part (2 Marks, files postfix.scala, postfix2.scala)}
 
 The \textit{Shunting Yard Algorithm} has been developed by Edsger Dijkstra,
 an influential computer scientist who developed many well-known
@@ -159,7 +159,7 @@
   as argument and evaluates it generating an integer as result. It uses a
   stack to evaluate the postfix expression. The operators $+$, $-$, $*$
   are as usual; $/$ is division on integers, for example $7 / 3 = 2$.
-  \hfill[1 Mark]
+  \hfill[0.5 Marks]
 \end{itemize}
 
 \subsubsection*{Task (file postfix2.scala)}
@@ -171,7 +171,7 @@
   other operators are left-associative.  Left-associative operators
   are popped off if the precedence is bigger or equal, while
   right-associative operators are only popped off if the precedence is
-  bigger.\hfill[1 Marks]
+  bigger.\hfill[0.5 Marks]
 \end{itemize}
 
 \end{document}