diff --git a/ss2012/AlgoAnim/Teil 3/RussischeBauernmultiplikation.java b/ss2012/AlgoAnim/Teil 3/RussischeBauernmultiplikation.java
new file mode 100644
index 00000000..b366a0ec
--- /dev/null
+++ b/ss2012/AlgoAnim/Teil 3/RussischeBauernmultiplikation.java	
@@ -0,0 +1,439 @@
+package part2;
+
+import java.awt.Color;
+import java.io.FileNotFoundException;
+import java.io.FileOutputStream;
+import java.io.PrintStream;
+import de.ahrgr.animal.kohnert.asugen.Font;
+import algoanim.animalscript.AnimalScript;
+import algoanim.primitives.SourceCode;
+import algoanim.primitives.StringMatrix;
+import algoanim.primitives.generators.Language;
+import algoanim.properties.AnimationPropertiesKeys;
+import algoanim.properties.RectProperties;
+import algoanim.properties.SourceCodeProperties;
+import algoanim.properties.TextProperties;
+import algoanim.util.Coordinates;
+import algoanim.util.Offset;
+import algoanim.util.Timing;
+
+
+/**
+ * @author Michael Scholz, Ulf Gebhardt
+ * @version 0.1 2012-05-15
+ *
+ */
+public class RussischeBauernmultiplikation {
+	
+	//Feedback aus †bung 2:
+	/*Es handelt sich bereits um eine anschauliche Animation.
+	 * Dennoch fallen mir ein Paar Details ein, die ihr im Laufe der nŠchsten Aufgaben
+	 * noch einbauen solltet.
+	 * 
+	 * Dass die Aufrufkette am Ende der Animation Ÿber die return-Statements wieder
+	 * nach oben zurŸckverfolgt wird, ist nicht unbedingt intuitiv ersichtlich.
+	 * Das kšnnte man noch erlŠutern oder vielleicht auch graphisch verdeutlichen.
+	 * Die im letzten Schritt einfach da stehende Zerlegung in Zweierpotenzen kšnnte
+	 * ebenfalls animiert dargestellt werden.
+	 * 
+	 * 
+	 * -> Aufrufkette
+	 * -> Zerlegung in Zweierpotenzen animieren 
+	 * 
+	 * */
+	
+	 /**
+     * The concrete language object used for creating output
+     */
+    private Language lang;
+    
+	
+	/**
+	 * The info text as a SourceCode object (first slide)
+	 */
+	private SourceCode info = null;
+	
+	/**
+	 * The statement text as a SourceCode object (last several slides)
+	 */
+	private SourceCode statement = null;
+	
+	
+	/**
+	 * The sourceCode
+	 */
+	private SourceCode sc = null;
+	
+	
+	/**
+	 * The table
+	 */
+	StringMatrix tb1 = null;
+	
+	
+	private static final String DESCRIPTION = 
+		"Russische Bauernmultiplikation\n" +
+		"Das hier vorgestellte Verfahren eignet sich fŸr die Multiplikation zweier ganzer Zahlen.\n" +
+		"Die Funktionsweise lŠsst sich in die folgenden fŸnf Schritte gliedern:\n" +
+		"1. Schreibe die beiden zu multiplizierenden Zahlen nebeneinander.\n" +
+		"2. Die linke Zahl wird halbiert (Reste werden abgerundet), die rechte Zahl wird verdoppelt.\n" +
+		"Die beiden berechneten Zahlen werden in die darauffolgende Zeile geschrieben.\n" +
+		"3. Schritt 2 wird solange wiederholt, bis in der linken Spalte eine 1 steht.\n" +
+		"4. Nun streicht man alle Zeilen, in denen die linke Zahl gerade ist.\n" +
+		"5. Schlussendlich werden alle Ÿbrigen Zahlen der rechten Spalte addiert.";
+	
+			
+	private static final String SOURCE_CODE = "public int russe(int a, int b){" // 0
+		+ "\n	if(a == 1){" // 1	
+		+ "\n		return b;" // 2
+		+ "\n  	}" // 3
+		+ "\n   if(a % 2 == 1){" // 4
+		+ "\n   	return b + russe(a/2, b*2);" // 5
+		+ "\n   }else{" // 6
+		+ "\n		return russe(a/2, b*2);" // 7
+		+ "\n	}" // 8
+		+ "\n }"; // 9	
+	    
+	
+    /**
+     * Default constructor
+     * @param l the conrete language object used for creating output
+     */
+    public RussischeBauernmultiplikation(Language l) {
+    	
+		// Store the language object
+		lang = l;
+		
+		// This initializes the step mode. Each pair of subsequent steps has to
+		// be divdided by a call of lang.nextStep();
+		lang.setStepMode(true);
+    }
+    
+    
+    /**
+     * Builds the information text for the first page in the animation
+     */
+    public void generateInfoText(){
+    	
+    	//create first page of animation (info text) as a code group
+ 	   SourceCodeProperties infoProps = new SourceCodeProperties();
+ 	   infoProps.set(AnimationPropertiesKeys.FONT_PROPERTY, new java.awt.Font("SansSerif", Font.SANSSERIF, 16));
+ 	   
+ 	   this.info = lang.newSourceCode(new Coordinates(10, 75), "info", null, infoProps);
+ 	   this.info.addCodeLine("Das hier vorgestellte Verfahren eignet sich fuer die Multiplikation zweier ganzer Zahlen.", null, 0, null);
+ 	   this.info.addCodeLine("Die Funktionsweise laesst sich in die folgenden fuenf Schritte gliedern:", null, 0, null);
+ 	   this.info.addCodeLine("1. Schreibe die beiden zu multiplizierenden Zahlen nebeneinander.", null, 1, null);
+ 	   this.info.addCodeLine("2. Die linke Zahl wird halbiert (Reste werden abgerundet), die rechte Zahl wird verdoppelt.", null, 1, null);
+	   this.info.addCodeLine(" Die beiden berechneten Zahlen werden in die darauffolgende Zeile geschrieben.", null, 2, null);
+	   this.info.addCodeLine("3. Schritt 2 wird solange wiederholt, bis in der linken Spalte eine 1 steht.", null, 1, null);
+	   this.info.addCodeLine("4. Nun streicht man alle Zeilen, in denen die linke Zahl gerade ist.", null, 1, null);
+	   this.info.addCodeLine("5. Schlussendlich werden alle uebrigen Zahlen der rechten Spalte addiert.", null, 1, null);
+    }
+    
+    
+    /**
+     * Builds the header which is shown during the whole animation
+     */
+    public void generateHeader(){
+    	
+ 	   //head
+ 	   TextProperties textProperties = new TextProperties();
+ 	   textProperties.set(AnimationPropertiesKeys.COLOR_PROPERTY, Color.BLACK);
+ 	   textProperties.set(AnimationPropertiesKeys.DEPTH_PROPERTY, 1);
+ 	   textProperties.set(AnimationPropertiesKeys.FONT_PROPERTY, new java.awt.Font("Serif", Font.SANSSERIF, 24));
+ 	   lang.newText(new Coordinates(11, 15), "Russische Bauernmultiplikation", "header", null, textProperties);
+ 	   
+ 	   //header background
+ 	   RectProperties rectProperties = new RectProperties();
+ 	   rectProperties.set(AnimationPropertiesKeys.FILL_PROPERTY, Color.GRAY);
+ 	   rectProperties.set(AnimationPropertiesKeys.FILLED_PROPERTY, true);
+ 	   rectProperties.set(AnimationPropertiesKeys.DEPTH_PROPERTY, 2);
+ 	   lang.newRect(new Offset(-5, -5, "header",
+ 				AnimalScript.DIRECTION_NW), new Offset(5, 5, "header",
+ 				AnimalScript.DIRECTION_SE), "headerBackground", null,
+ 				rectProperties);
+    }
+	
+    
+    /**
+     * Builds the SourceCode 
+     */
+    public void generateSourceCode(){
+    	
+ 	   //set the visual properties for the source code
+ 	   SourceCodeProperties scProps = new SourceCodeProperties();
+ 	   scProps.set(AnimationPropertiesKeys.HIGHLIGHTCOLOR_PROPERTY, Color.RED);  
+ 	   
+ 	   //initialize source code object and add code lines
+ 	   this.sc = lang.newSourceCode(new Coordinates(10, 147), "sourceCode", null, scProps);  
+ 	   this.sc.addCodeLine("public int russe(int a, int b){", null, 0, null);  // 0
+ 	   this.sc.addCodeLine("if(a == 1){", null, 1, null);  // 1
+ 	   this.sc.addCodeLine("return b;", null, 2, null);  // 2
+ 	   this.sc.addCodeLine("}", null, 1, null);  // 3
+ 	   this.sc.addCodeLine("if(a % 2 == 1){", null, 1, null);  // 4
+ 	   this.sc.addCodeLine("return b + russe(a/2, b*2);", null, 2, null);  // 5
+ 	   this.sc.addCodeLine("}else{", null, 1, null);  // 6
+ 	   this.sc.addCodeLine("return russe(a/2, b*2);", null, 2, null);  // 7
+ 	   this.sc.addCodeLine("}", null, 1, null);  // 8
+ 	   this.sc.addCodeLine("}", null, 0, null);  // 9
+    	
+    }
+    
+    
+    /**
+     * calculate needed lines -> animation is more dynamic
+     * @param a
+     * @param b
+     * @return int number of needed lines
+     */
+    public int calculateLines(int a, int b){
+    	
+    	//calculate needed lines -> animation is more dynamic
+  	   int aTemp = a;
+  	   int lines = 3;
+  	   while(aTemp != 1){
+  		   aTemp = aTemp / 2;
+  		   lines++;
+  	   }
+  	   return lines;
+    }
+    
+    
+    /**
+     * Builds the table
+     * @param a
+     * @param b
+     * @param lines
+     */
+    public void generateTable(int a, int b, int lines){
+    	
+       //create String[][] data array for tb1
+ 	   String[][] tb1Data = new String[lines][4];
+ 	   
+ 	   //fill all fields with ""
+ 	   for(int i = 0; i < tb1Data.length; i++){
+ 		   for(int j = 0; j < tb1Data[i].length; j++){
+ 			   tb1Data[i][j] = "";
+ 		   }
+ 	   }
+ 	   
+ 	   //fill the known fields
+ 	   tb1Data[0][0] = "A-Seite";
+ 	   tb1Data[0][1] = "B-Seite";
+ 	   tb1Data[0][2] = "addieren";
+ 	   tb1Data[0][3] = "Summe";
+ 	   tb1Data[1][0] = a+"";
+ 	   tb1Data[1][1] = b+"";
+ 	   
+ 	   //create table tb1
+ 	   this.tb1 = lang.newStringMatrix(new Coordinates(270, 100), tb1Data, "tb1", null);
+ 	   this.tb1.changeColor(AnimationPropertiesKeys.FILL_PROPERTY, Color.WHITE, null, null);
+ 	   
+    }
+    
+    /**
+     * builds the statement for the last several slides
+     */
+    public void generateStatement(){
+ 	   //final statement
+ 	   SourceCodeProperties statementProps = new SourceCodeProperties();
+ 	   statementProps.set(AnimationPropertiesKeys.FONT_PROPERTY, new java.awt.Font("SansSerif", Font.SANSSERIF, 16));
+ 	   
+ 	   this.statement  = lang.newSourceCode(new Coordinates(10, 75), "statement", null, statementProps);
+ 	   this.statement.addCodeLine("Erklaerung:", null, 0, null);
+ 	   this.statement.addCodeLine("Die Idee des Verfahrens kann man mit Hilfe des Dualsystems verdeutlichen.", null, 0, null);
+ 	   this.statement.addCodeLine("Hierbei wird eine Zahl in ihre Zweierpotenzen zerlegt.", null, 0, null);
+ 	   this.statement.addCodeLine("", null, 0, null); //empty line for vertical space
+ //STEP
+ 	   lang.nextStep();
+ 	   this.statement.addCodeLine("82 * 27 = 82 * (2^0 + 2^1 + 0 * 2^2 + 2^3 + 2^4 )", null, 0, null);
+ //STEP
+ 	   lang.nextStep(); 
+ 	   this.statement.addCodeLine("= 82 * 2^0 + 82 * 2^1 + 82 * 0 + 82 * 2^3 + 82 * 2^4", null, 4, null);
+ //STEP
+ 	   lang.nextStep();
+ 	   this.statement.addCodeLine("= 82 + 164 + 0 + 656 + 1312", null, 4, null);
+ //STEP
+ 	   lang.nextStep();
+ 	   this.statement.addCodeLine("= 2214", null, 4, null);
+    }
+    
+    /**
+     * logical method: calls the needed methods for generating the animation
+     * @param a
+     * @param b
+     */
+    public void multiply(int a, int b){
+
+	   //generate information text and the header
+	   generateInfoText();
+	   generateHeader();
+
+//STEP	   
+	   lang.nextStep();
+	   this.info.hide();
+	   
+	   //generate SourceCode
+	   generateSourceCode();
+	   
+	   //calculate needed lines and generate table
+	   int lines = calculateLines(a, b);
+	   generateTable(a, b, lines);
+	   
+//STEP
+	   lang.nextStep();
+	   
+	   //higlight line 0
+	   this.sc.highlight(0);
+
+	   int result = russe(a, b, sc, tb1, 1, "");	   
+	   this.tb1.put(lines - 1, 2, "Ergebnis", null, null);
+	   this.tb1.put(lines - 1, 3, result+"", null, null);
+	   
+//STEP
+	   lang.nextStep();
+	   this.tb1.hide();
+	   this.sc.hide();
+	   
+	   //generate statement
+	   generateStatement();
+
+   }
+	
+   /**
+    * the algorithm which is used in the animation
+    * @param a
+    * @param b
+    * @param code
+    * @param tb1
+    * @param line
+    * @param sum
+    * @return the product of a and b (a*b)
+    */
+   private int russe(int a, int b, SourceCode code, StringMatrix tb1, int line, String sum){
+	   
+	   int aTb = a;
+	   int bTb = b;
+	   Timing sTime = new Timing(100) {
+		
+		@Override
+		public String getUnit() {
+			// TODO Auto-generated method stub
+			return "ticks";
+		}
+	};
+	   tb1.highlightCell(line, 0, sTime, sTime);
+	   tb1.put(line, 0, a+"", null, null); //update column 0 (a)
+	   tb1.put(line, 1, b+"", null, null); //update column 1 (b)
+
+ //STEP
+	   lang.nextStep();
+	   code.unhighlight(0);
+	   code.highlight(1);
+	   
+ //STEP
+	   lang.nextStep();
+	   
+	   if(a == 1){   
+		   code.toggleHighlight(1, 2);
+		   
+		   //write last line
+		   sum = sum+"+"+b;
+		   //update table
+		   tb1.put(line, 2, "Ja", null, null); //update column 2 (addieren)
+		   tb1.put(line, 3, sum, null, null); //update column 3 (Summe)
+		   return b;
+	   }
+	   if(line != 1){ // first line
+		   aTb = aTb/2;
+		   bTb = bTb*2;
+	   }
+	   code.toggleHighlight(1, 4);
+	   
+ //STEP
+	   lang.nextStep();
+	   code.unhighlight(1);
+	   
+	   if(a % 2 == 1){
+		   code.toggleHighlight(4, 5);
+ 
+		   if(line == 1){
+			   sum = b+"";
+		   }else{
+			if(sum.equals("")){
+			   sum = b+"";}
+			else{
+			   sum = sum+"+"+b;
+			   }
+		   }
+		   //update table
+		   tb1.put(line, 2, "Ja", null, null); //update column 2 (addieren)
+		   tb1.put(line, 3, sum, null, null); //update column 3 (Summe)
+		   
+ //STEP
+		   lang.nextStep();
+		   code.unhighlight(5);
+		   code.highlight(0);
+		   return b + russe(a/2, b*2, code, tb1, line+1, sum);
+	   }   
+	   else{
+		   code.toggleHighlight(4, 7);
+		   //update table
+		   tb1.put(line, 2, "Nein", null, null); //update column 2 (addieren)
+		   tb1.put(line, 3, sum, null, null); //update column 3 (Summe)
+		   
+ //STEP
+		   lang.nextStep();
+		   code.highlight(0);
+		   code.unhighlight(7);
+		   return russe(a/2, b*2, code, tb1, line+1, sum);
+	   }
+   }
+	
+	
+    protected String getAlgorithmDescription() {
+    	return DESCRIPTION;
+    }
+	
+    protected String getAlgorithmCode() {
+    	return SOURCE_CODE;
+    }
+	
+    public String getName() {
+    	return "Russische Bauernmultiplikation";
+    }
+	
+    public String getDescription() {
+    	return DESCRIPTION; 
+    }
+	
+    public String getCodeExample() {
+    	return SOURCE_CODE;
+    }
+	
+	
+	public static void main(String[] args) {
+		
+		Language l = new AnimalScript("Russische Bauenmultiplikation", "Michael Scholz, Ulf Gebhardt", 640, 480);
+		RussischeBauernmultiplikation s = new RussischeBauernmultiplikation(l);
+		int a = 27;
+		int b = 82;
+		s.multiply(a, b);
+		
+		//konsolenausgabe direkt als asu-datei schreiben, vor Abgabe bitte wieder entfernen!!!
+		boolean writeFile = false;
+		writeFile = true;
+		
+		if(writeFile){
+			try {
+				System.setOut(new PrintStream(
+						new FileOutputStream("uebung3_2.asu")));
+			} catch (FileNotFoundException e) {
+				// TODO Auto-generated catch block
+				e.printStackTrace();
+			}
+		}
+		System.out.println(l);
+	}
+
+}
diff --git a/ss2012/AlgoAnim/Teil 3/uebung3_2.asu b/ss2012/AlgoAnim/Teil 3/uebung3_2.asu
new file mode 100644
index 00000000..eaa9a888
--- /dev/null
+++ b/ss2012/AlgoAnim/Teil 3/uebung3_2.asu	
@@ -0,0 +1,187 @@
+%Animal 2 640*480
+title "Russische Bauenmultiplikation"
+author "Michael Scholz, Ulf Gebhardt"
+{
+  codegroup "info" at (10, 75) color (0, 0, 0) highlightColor (0, 0, 0) contextColor (0, 0, 0) font SansSerif size 16 italic depth 1
+  addCodeLine "Das hier vorgestellte Verfahren eignet sich fuer die Multiplikation zweier ganzer Zahlen." to "info"
+  addCodeLine "Die Funktionsweise laesst sich in die folgenden fuenf Schritte gliedern:" to "info"
+  addCodeLine "1. Schreibe die beiden zu multiplizierenden Zahlen nebeneinander." to "info" indentation 1
+  addCodeLine "2. Die linke Zahl wird halbiert (Reste werden abgerundet), die rechte Zahl wird verdoppelt." to "info" indentation 1
+  addCodeLine " Die beiden berechneten Zahlen werden in die darauffolgende Zeile geschrieben." to "info" indentation 2
+  addCodeLine "3. Schritt 2 wird solange wiederholt, bis in der linken Spalte eine 1 steht." to "info" indentation 1
+  addCodeLine "4. Nun streicht man alle Zeilen, in denen die linke Zahl gerade ist." to "info" indentation 1
+  addCodeLine "5. Schlussendlich werden alle uebrigen Zahlen der rechten Spalte addiert." to "info" indentation 1
+  text "header" "Russische Bauernmultiplikation" (11, 15) color (0, 0, 0) depth 1 font Serif size 24 italic
+  rectangle "headerBackground" offset (-5, -5) from "header" NW offset (5, 5) from "header" SE color (0, 0, 0) depth 2 filled  fillColor (128, 128, 128)
+}
+{
+  codegroup "sourceCode" at (10, 147) color (0, 0, 0) highlightColor (255, 0, 0) contextColor (0, 0, 0) font SansSerif size 12 depth 1
+  addCodeLine "public int russe(int a, int b){" to "sourceCode"
+  addCodeLine "if(a == 1){" to "sourceCode" indentation 1
+  addCodeLine "return b;" to "sourceCode" indentation 2
+  addCodeLine "}" to "sourceCode" indentation 1
+  addCodeLine "if(a % 2 == 1){" to "sourceCode" indentation 1
+  addCodeLine "return b + russe(a/2, b*2);" to "sourceCode" indentation 2
+  addCodeLine "}else{" to "sourceCode" indentation 1
+  addCodeLine "return russe(a/2, b*2);" to "sourceCode" indentation 2
+  addCodeLine "}" to "sourceCode" indentation 1
+  addCodeLine "}" to "sourceCode"
+  grid "tb1" (270, 100) lines 7 columns 4  color (0, 0, 0) elementColor (0, 0, 0) fillColor (0, 0, 0) highlightTextColor (0, 0, 0) highlightBackColor (0, 0, 0) depth 1
+  setGridValue "tb1[0][0]" "A-Seite"
+  setGridValue "tb1[0][1]" "B-Seite"
+  setGridValue "tb1[0][2]" "addieren"
+  setGridValue "tb1[0][3]" "Summe"
+  setGridValue "tb1[1][0]" "27"
+  setGridValue "tb1[1][1]" "82"
+  setGridValue "tb1[1][2]" ""
+  setGridValue "tb1[1][3]" ""
+  setGridValue "tb1[2][0]" ""
+  setGridValue "tb1[2][1]" ""
+  setGridValue "tb1[2][2]" ""
+  setGridValue "tb1[2][3]" ""
+  setGridValue "tb1[3][0]" ""
+  setGridValue "tb1[3][1]" ""
+  setGridValue "tb1[3][2]" ""
+  setGridValue "tb1[3][3]" ""
+  setGridValue "tb1[4][0]" ""
+  setGridValue "tb1[4][1]" ""
+  setGridValue "tb1[4][2]" ""
+  setGridValue "tb1[4][3]" ""
+  setGridValue "tb1[5][0]" ""
+  setGridValue "tb1[5][1]" ""
+  setGridValue "tb1[5][2]" ""
+  setGridValue "tb1[5][3]" ""
+  setGridValue "tb1[6][0]" ""
+  setGridValue "tb1[6][1]" ""
+  setGridValue "tb1[6][2]" ""
+  setGridValue "tb1[6][3]" "" refresh
+  color "tb1" type "fillColor" (255, 255, 255)  
+  hide "info" 
+}
+{
+  highlightCode on "sourceCode" line 0 row 0  
+  highlightGridCell "tb1[1][0]"   after 100 ticks  within 100 ticks
+  setGridValue "tb1[1][0]" "27" refresh   
+  setGridValue "tb1[1][1]" "82" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 0 row 0  
+  highlightCode on "sourceCode" line 1 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  highlightCode on "sourceCode" line 4 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  unhighlightCode on "sourceCode" line 4 row 0  
+  highlightCode on "sourceCode" line 5 row 0  
+  setGridValue "tb1[1][2]" "Ja" refresh   
+  setGridValue "tb1[1][3]" "82" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 5 row 0  
+  highlightCode on "sourceCode" line 0 row 0  
+  highlightGridCell "tb1[2][0]"   after 100 ticks  within 100 ticks
+  setGridValue "tb1[2][0]" "13" refresh   
+  setGridValue "tb1[2][1]" "164" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 0 row 0  
+  highlightCode on "sourceCode" line 1 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  highlightCode on "sourceCode" line 4 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  unhighlightCode on "sourceCode" line 4 row 0  
+  highlightCode on "sourceCode" line 5 row 0  
+  setGridValue "tb1[2][2]" "Ja" refresh   
+  setGridValue "tb1[2][3]" "82+164" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 5 row 0  
+  highlightCode on "sourceCode" line 0 row 0  
+  highlightGridCell "tb1[3][0]"   after 100 ticks  within 100 ticks
+  setGridValue "tb1[3][0]" "6" refresh   
+  setGridValue "tb1[3][1]" "328" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 0 row 0  
+  highlightCode on "sourceCode" line 1 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  highlightCode on "sourceCode" line 4 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  unhighlightCode on "sourceCode" line 4 row 0  
+  highlightCode on "sourceCode" line 7 row 0  
+  setGridValue "tb1[3][2]" "Nein" refresh   
+  setGridValue "tb1[3][3]" "82+164" refresh   
+}
+{
+  highlightCode on "sourceCode" line 0 row 0  
+  unhighlightCode on "sourceCode" line 7 row 0  
+  highlightGridCell "tb1[4][0]"   after 100 ticks  within 100 ticks
+  setGridValue "tb1[4][0]" "3" refresh   
+  setGridValue "tb1[4][1]" "656" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 0 row 0  
+  highlightCode on "sourceCode" line 1 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  highlightCode on "sourceCode" line 4 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  unhighlightCode on "sourceCode" line 4 row 0  
+  highlightCode on "sourceCode" line 5 row 0  
+  setGridValue "tb1[4][2]" "Ja" refresh   
+  setGridValue "tb1[4][3]" "82+164+656" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 5 row 0  
+  highlightCode on "sourceCode" line 0 row 0  
+  highlightGridCell "tb1[5][0]"   after 100 ticks  within 100 ticks
+  setGridValue "tb1[5][0]" "1" refresh   
+  setGridValue "tb1[5][1]" "1312" refresh   
+}
+{
+  unhighlightCode on "sourceCode" line 0 row 0  
+  highlightCode on "sourceCode" line 1 row 0  
+}
+{
+  unhighlightCode on "sourceCode" line 1 row 0  
+  highlightCode on "sourceCode" line 2 row 0  
+  setGridValue "tb1[5][2]" "Ja" refresh   
+  setGridValue "tb1[5][3]" "82+164+656+1312" refresh   
+  setGridValue "tb1[6][2]" "Ergebnis" refresh   
+  setGridValue "tb1[6][3]" "2214" refresh   
+}
+{
+  codegroup "statement" at (10, 75) color (0, 0, 0) highlightColor (0, 0, 0) contextColor (0, 0, 0) font SansSerif size 16 italic depth 1
+  addCodeLine "Erklaerung:" to "statement"
+  addCodeLine "Die Idee des Verfahrens kann man mit Hilfe des Dualsystems verdeutlichen." to "statement"
+  addCodeLine "Hierbei wird eine Zahl in ihre Zweierpotenzen zerlegt." to "statement"
+  addCodeLine "" to "statement"
+  hide "tb1" "sourceCode" 
+}
+{
+  addCodeLine "82 * 27 = 82 * (2^0 + 2^1 + 0 * 2^2 + 2^3 + 2^4 )" to "statement"
+}
+{
+  addCodeLine "= 82 * 2^0 + 82 * 2^1 + 82 * 0 + 82 * 2^3 + 82 * 2^4" to "statement" indentation 4
+}
+{
+  addCodeLine "= 82 + 164 + 0 + 656 + 1312" to "statement" indentation 4
+}
+{
+  addCodeLine "= 2214" to "statement" indentation 4
+}
+
diff --git a/ss2012/AlgoAnim/Teil 4/uebung_4.pdf b/ss2012/AlgoAnim/Teil 4/uebung_4.pdf
index 599efbbc..9eb76394 100644
Binary files a/ss2012/AlgoAnim/Teil 4/uebung_4.pdf and b/ss2012/AlgoAnim/Teil 4/uebung_4.pdf differ
diff --git a/ss2012/AlgoAnim/Teil 5/uebung_5.pdf b/ss2012/AlgoAnim/Teil 5/uebung_5.pdf
index cc334b91..182e4be4 100644
Binary files a/ss2012/AlgoAnim/Teil 5/uebung_5.pdf and b/ss2012/AlgoAnim/Teil 5/uebung_5.pdf differ
diff --git a/ss2012/IT Sicherheit/Folien/3-IAMPrivacy-01.pdf b/ss2012/IT Sicherheit/Folien/3,4-IAMPrivacy-01.pdf
similarity index 100%
rename from ss2012/IT Sicherheit/Folien/3-IAMPrivacy-01.pdf
rename to ss2012/IT Sicherheit/Folien/3,4-IAMPrivacy-01.pdf
diff --git a/ss2012/IT Sicherheit/Folien/5-SecurityEngineering-01.pdf b/ss2012/IT Sicherheit/Folien/5-SecurityEngineering-01.pdf
new file mode 100644
index 00000000..471fb117
Binary files /dev/null and b/ss2012/IT Sicherheit/Folien/5-SecurityEngineering-01.pdf differ
diff --git a/ss2012/IT Sicherheit/Gastvorträge/Jan_Camensich.pdf b/ss2012/IT Sicherheit/Gastvorträge/Jan_Camensich.pdf
new file mode 100644
index 00000000..e6f43247
Binary files /dev/null and b/ss2012/IT Sicherheit/Gastvorträge/Jan_Camensich.pdf differ
diff --git a/ss2012/IT Sicherheit/Uebungen/1/exercise1L.pdf b/ss2012/IT Sicherheit/Uebungen/1/exercise1L.pdf
new file mode 100644
index 00000000..bb97e311
Binary files /dev/null and b/ss2012/IT Sicherheit/Uebungen/1/exercise1L.pdf differ
diff --git a/ss2012/IT Sicherheit/Uebungen/2/exercise2.pdf b/ss2012/IT Sicherheit/Uebungen/2/exercise2.pdf
new file mode 100644
index 00000000..c93216f4
Binary files /dev/null and b/ss2012/IT Sicherheit/Uebungen/2/exercise2.pdf differ
diff --git a/ss2012/IT Sicherheit/Uebungen/2/exercise2L.pdf b/ss2012/IT Sicherheit/Uebungen/2/exercise2L.pdf
new file mode 100644
index 00000000..80426ceb
Binary files /dev/null and b/ss2012/IT Sicherheit/Uebungen/2/exercise2L.pdf differ
diff --git a/ss2012/IT Sicherheit/Uebungen/2/hausuebung2.odt b/ss2012/IT Sicherheit/Uebungen/2/hausuebung2.odt
new file mode 100644
index 00000000..9a794ba0
Binary files /dev/null and b/ss2012/IT Sicherheit/Uebungen/2/hausuebung2.odt differ
diff --git a/ss2012/Mathe III/Klausurinfo.rtf b/ss2012/Mathe III/Klausurinfo.rtf
new file mode 100644
index 00000000..56dd28ee
--- /dev/null
+++ b/ss2012/Mathe III/Klausurinfo.rtf	
@@ -0,0 +1,7 @@
+{\rtf1\ansi\ansicpg1252\cocoartf1138\cocoasubrtf320
+{\fonttbl\f0\fswiss\fcharset0 Helvetica;}
+{\colortbl;\red255\green255\blue255;}
+\paperw11900\paperh16840\margl1440\margr1440\vieww10800\viewh8400\viewkind0
+\pard\tx566\tx1133\tx1700\tx2267\tx2834\tx3401\tx3968\tx4535\tx5102\tx5669\tx6236\tx6803\pardirnatural
+
+\f0\fs24 \cf0 50 Prozent der Klausur wird aus Statistik und Stochastik bestehen (\'dcbungen 1-3)}
\ No newline at end of file
diff --git a/ss2012/Mathe III/Uebungen/Uebung01_LSG.pdf b/ss2012/Mathe III/Uebungen/Uebung01_LSG.pdf
new file mode 100644
index 00000000..e6a9485d
Binary files /dev/null and b/ss2012/Mathe III/Uebungen/Uebung01_LSG.pdf differ
diff --git a/ss2012/Mathe III/Uebungen/Uebung02_LSG.pdf b/ss2012/Mathe III/Uebungen/Uebung02_LSG.pdf
new file mode 100644
index 00000000..190c65d8
Binary files /dev/null and b/ss2012/Mathe III/Uebungen/Uebung02_LSG.pdf differ
diff --git a/ss2012/Mathe III/Uebungen/Uebung03.pdf b/ss2012/Mathe III/Uebungen/Uebung03.pdf
new file mode 100644
index 00000000..aaa76322
Binary files /dev/null and b/ss2012/Mathe III/Uebungen/Uebung03.pdf differ
diff --git a/ss2012/Mathe III/Uebungen/Uebung04.pdf b/ss2012/Mathe III/Uebungen/Uebung04.pdf
new file mode 100644
index 00000000..dd567d8c
Binary files /dev/null and b/ss2012/Mathe III/Uebungen/Uebung04.pdf differ
diff --git a/ss2012/Mathe III/Uebungen/Uebung05.pdf b/ss2012/Mathe III/Uebungen/Uebung05.pdf
new file mode 100644
index 00000000..b0a121b2
Binary files /dev/null and b/ss2012/Mathe III/Uebungen/Uebung05.pdf differ
diff --git a/ss2012/Mathe III/info2012.pdf b/ss2012/Mathe III/info2012.pdf
index 86c15812..ac8a9562 100644
Binary files a/ss2012/Mathe III/info2012.pdf and b/ss2012/Mathe III/info2012.pdf differ
diff --git a/ss2012/Mathe III/statistischeTabellen.pdf b/ss2012/Mathe III/statistischeTabellen.pdf
new file mode 100644
index 00000000..a89a2318
Binary files /dev/null and b/ss2012/Mathe III/statistischeTabellen.pdf differ