diff -r ea1ee786d5a7 -r 60f64793266f handouts/ho03.tex
--- a/handouts/ho03.tex	Mon Oct 05 12:47:56 2015 +0100
+++ b/handouts/ho03.tex	Mon Oct 05 20:42:11 2015 +0100
@@ -49,10 +49,11 @@
 \end{tikzpicture}
 \end{center}
 
-\noindent This statistics indicates that in the last
-five years or so the number of buffer overflow attacks is
-around 10\% of all attacks (whereby the absolute numbers of
-attacks grow each year).
+\noindent This statistics shows that in the last seven years
+or so the number of buffer overflow attacks is around 10\% of
+all attacks (whereby the absolute numbers of attacks grow each
+year). So you can see buffer overflow attacks are very
+relevant today.
 
 
 To understand how buffer overflow attacks work, we have to have
@@ -67,10 +68,10 @@
 then better you get to know the details too.
  
 For buffer overflow attacks to work, a number of innocent
-design decisions, which are really benign on their own, need
-to conspire against you. All these decisions were taken at a
-time when there was no Internet: C was introduced around 1973;
-the Internet TCP/IP protocol was standardised in 1982 by which
+design decisions, which are really benign on their own, have
+to come together. All these decisions were taken at a time
+when there was no Internet: C was introduced around 1973; the
+Internet TCP/IP protocol was standardised in 1982 by which
 time there were maybe 500 servers connected (and all users
 were well-behaved, mostly academics); Intel's first 8086 CPUs
 arrived around 1977. So nobody of the ``forefathers'' can
@@ -110,7 +111,7 @@
 with the control flow of the program. Notice that the stack
 grows from higher addresses to lower addresses (i.e.~from the
 back to the front). That means that older items on the stack
-will be stored behind, or after, newer items. Let's look a bit
+are stored behind, or after, newer items. Let's look a bit
 closer what happens with the stack when a program is running.
 Consider the following simple C program.
  
@@ -121,8 +122,8 @@
 two (local) buffers, but does not do anything interesting with
 them. The only purpose of this program is to illustrate what
 happens behind the scenes with the stack. The interesting
-question is what will the stack be after Line 3 has been
-executed? The answer can be illustrated as follows:
+question is what will the stack look like after Line 3 has
+been executed? The answer can be illustrated as follows:
  
 \begin{center} 
  \begin{tikzpicture}[scale=0.65]
@@ -188,10 +189,14 @@
 How to do this will be explained later.}
 
 \begin{center}\small
-\begin{tabular}[t]{@{}c@{\hspace{8mm}}c@{}}
+\begin{tabular}[t]{p{10cm}}
 {\lstinputlisting[language={[x86masm]Assembler},
   morekeywords={movl},xleftmargin=5mm]
-  {../progs/example1a.s}} &
+  {../progs/example1a.s}}
+\end{tabular}
+\end{center}
+\begin{center}\small
+\begin{tabular}[t]{p{10cm}}
 {\lstinputlisting[language={[x86masm]Assembler},
   morekeywords={movl,movw},xleftmargin=5mm]
   {../progs/example1b.s}}