diff --git a/ex07/kn07.pdf b/ex07/kn07.pdf
index 0b22563..269f74c 100644
--- a/ex07/kn07.pdf
+++ b/ex07/kn07.pdf
Binary files differ
diff --git a/ex07/kn07.tex b/ex07/kn07.tex
index be60dcf..93c1f72 100644
--- a/ex07/kn07.tex
+++ b/ex07/kn07.tex
@@ -97,12 +97,23 @@
     \item $a_i< N \wedge b_{N-i+1}< N$\\
         To assign numbers to all ports $a_k$ we need $i$ numbers $<N$ ($k\leq i$). For the ports $b_k$ we need $N-i+1$ ($k<N-i+1$). In sum that are $N-i+1+i=N+1>N\ \lightning$
 \end{enumerate}
-So all possibilities where there is blocking in first stage aren't possible which means the first stage is non-blocking.\qed
+So all possibilities where there is blocking in first stage aren't possible which means the first stage is non-blocking.\ok\qed
 \\[0.5cm]
 \Aufgabe{Flow Control and ARQ Protocols}{22}
 \begin{enumerate}
     \item Flow Control means the controlling of the transmission of data. This is necessary for example if the receiver is slower or has higher traffic than the sender and can't keep up. For flow control ACK message can be used to acknowledge received messages (used in the examples from he lecture).
+    \begin{corr}
+        adjustment of sending rate
+    \end{corr}
     \item The specific package may be received anywhere in the window, i.e. newer packages may be received before older ones. However this does not directly lead to retransmission but only if the window for receiving is left. To implement this window a buffer is necessary.
+    \begin{corr}
+        \begin{itemize}
+            \item packages may be lost
+            \item transmission errors
+            \item reordering
+            \item[$\rightarrow$] received packages have to be saved
+        \end{itemize}
+    \end{corr}
     \item $n,m\in\mathds{N}$\\
         \begin{tabular}{c||c|c|c}
             &SAW&GBN&SR\\\hline
@@ -112,6 +123,24 @@
         \end{tabular}\\[0.5cm]
         As we see in the table the main difference is the size of sending and receiving window. By this differences all the other differences can be explained (e.g. accepting only the matching frame or all in the window).\\
         Common for all protocols is that they use ACK messages to acknowledge receiving (implement flow control by this) and that they only have one sender and one receiver.
+        \begin{corr}
+            \begin{itemize}
+                \item common:
+                \begin{itemize}
+                    \item implementation of flow control
+                    \item use send/receive buffer
+                    \item retransmission after timeout
+                    \item ACK for each package
+                \end{itemize}
+                \item differences:
+                \begin{itemize}
+                    \item windows (see table)
+                    \item GBN drop packages out of order
+                    \item $n,m > 1$
+                    \item SR pass packages to higher layer as soon as they are ordered
+                \end{itemize}
+            \end{itemize}
+        \end{corr}
 \end{enumerate}
 \Aufgabe{Framing}{22}
 \begin{enumerate}
@@ -122,8 +151,8 @@
 \end{enumerate}
 \Aufgabe{ALOHA and Slotted ALOHA}{36}
 \begin{enumerate}
-    \item $\frac{64kbit/s}{256bit/s}=25$ messages can be transmitted according to the bandwidth. The maximum of thoughput we reach at $G=0.5$, so the maximum number of terminals is $x^*=\left\lfloor\frac{25}{2}\right\rfloor=12$.
-    \item For Slotted ALOHA the maximum is at $G=1$, so the best number of terminals is $x'^*=25$
+    \item $\frac{64kbit/s}{256bit/s}=25\textcorr{0}$ messages can be transmitted according to the bandwidth. The maximum of thoughput we reach at $G=0.5$, so the maximum number of terminals is $x^*=\left\lfloor\frac{25\textcorr{0}}{2}\right\rfloor=12\textcorr{5}$.
+    \item For Slotted ALOHA the maximum is at $G=1$, so the best number of terminals is $x'^*=25\textcorr{0}$
     \item The formula is $x^*=\left\lfloor\frac{N}{2tm}\right\rfloor$, where $m$ is the message size, $t$ the messages per second. This leads to:
     \begin{enumerate}
         \item doubling $t$ halves $x^*$
@@ -132,4 +161,7 @@
     \end{enumerate}
     All those with the limitation of the floor-function so only approximately.
 \end{enumerate}
+    \begin{corr}
+        Musterlösung mit Übertragungszeit statt Anzahl der Messages
+    \end{corr}
 \end{document}