# HG changeset patch
# User Christian Urban <christian.urban@kcl.ac.uk>
# Date 1632524191 -3600
# Node ID 7af70f9b30abda7b4a39bab6bd77a1e4f3ee5737
# Parent  97df390d64f5fc8801d62c7ffded57e9870dce13
updated

diff -r 97df390d64f5 -r 7af70f9b30ab slides/slides01.tex
--- a/slides/slides01.tex	Fri Sep 24 23:50:30 2021 +0100
+++ b/slides/slides01.tex	Fri Sep 24 23:56:31 2021 +0100
@@ -1454,7 +1454,7 @@
 
 
 \begin{tabular}{lll}
-  TAs: & Anton Luca-Dorin & (took the module last year)\\
+  TAs: & Finley Warman    & (took the module last year)\\
        & Chengsong Tan    & (PhD student working on derivatives)  
 \end{tabular}  
 \mbox{}
@@ -1590,18 +1590,6 @@
 \end{frame}
 
 \begin{frame}[c]
-\begin{mybox3}{Passing Mark}
-  I believe the assessment is 70\% coursework (broken into 10\% weekly
-  stuff, 15\% mid term exam and 45\% CW in any programming language)
-  and 30\% January exam. However, I would like to know if we just need
-  40\% overall to pass the module or pass the each component
-  individually?
-\end{mybox3}
-
-\hfill$\Rightarrow$ 40\% overall
-\end{frame}
-
-\begin{frame}[c]
 \begin{mybox3}{Regexes}
   Can we determine all the possible regular expressions matching a
   certain string? If we take into account all the possible ways to
@@ -1679,9 +1667,6 @@
 
 \hfill online tutorial sessions
 
-\hfill ???
-
-\hfill PL-groups for ``exotic'' langs
 \end{frame}
 
 \begin{frame}[c]
diff -r 97df390d64f5 -r 7af70f9b30ab slides/slides02.pdf
Binary file slides/slides02.pdf has changed