
diff -r a06efd2e3117 -r 86a48bdf82d1 cws/main_cw02.tex
--- a/cws/main_cw02.tex	Fri Dec 23 16:59:59 2022 +0000
+++ b/cws/main_cw02.tex	Mon Dec 26 16:49:53 2022 +0000
@@ -114,6 +114,11 @@
   return the word list appropriately broken up into lines.
   The result should be a list of strings (the lines in the file). In case
   the url does not produce a file, return the empty list.
+
+  \textcolor{red}{
+    In what follows we will use \texttt{secrets} to refer  to the list of words listed
+    in \texttt{wordle.txt}.  
+  }
   \mbox{}\hfill [0.5 Marks]
 
 \item[(2)] Implement a polymorphic function \pcode{removeN}, which removes $n$ occurrences of an
@@ -261,7 +266,9 @@
 \item[(7)] In this task we want to use the output of \pcode{evil}, rank each string in the
   generated set and then filter out the strings that are ranked highest (the ones with the most obscure letters).
   This list of strings often contains only a single word, but in general there might be more (see below).
-  First implement a function \pcode{rank} that takes a frequency map (from 6) and a string as arguments and
+  First implement a function \pcode{rank} that takes a frequency map (from 6) and a string as arguments.
+  \textcolor{red}{In the testcases, the frequency map is generated for all words in \texttt{secrets}, that is the
+  whole list in \texttt{wordle.txt}.} The function  
   generates a rank by summing up all frequencies of the letters in the string. For example
 
 \begin{lstlisting}[numbers=none]




