Protokolle Informatik: Unterschied zwischen den Versionen

Aus Fachschaften Informatik & Mathematik
Wechseln zu: Navigation, Suche
Ben (Diskussion | Beiträge)
autoreview, editor
3.005 Bearbeitungen
Die Seite wurde neu angelegt: „__NOCACHE__ <noinclude> {{Fachschaft:Test:Protokolle_Intro}} Für Altklausuren der Pflichtmodule in der Informatik existiert [https://lms.uni-kiel.de/url/Repo…“
 
Yorik (Diskussion | Beiträge)
472 Bearbeitungen
ERP Systeme
 
(198 dazwischenliegende Versionen von 10 Benutzern werden nicht angezeigt)
Zeile 1: Zeile 1:
__NOCACHE__
__NOCACHE__
<noinclude>
<noinclude>
{{Fachschaft:Test:Protokolle_Intro}}
{{Vorlage:Protokolle_Intro}}
</noinclude>


Für Altklausuren der Pflichtmodule in der Informatik existiert [https://lms.uni-kiel.de/url/RepositoryEntry/2650669063 hier] auch ein OLat Modul von Herrn Wilke.
Für Altklausuren der Pflichtmodule in der Informatik existiert
 
[https://lms.uni-kiel.de/url/RepositoryEntry/2650669063 hier] auch ein OLat Modul von Herrn Wilke.
== Protokolle und Klausuren ==


<noinclude>
== Protokolle und Klausuren der Informatik==
</noinclude>
</noinclude>
<examinationlogs>
<examinationlogs>


<logs>
  <logs>


<!--
    <!--
Mustereintrag:
Mustereintrag:
<log>
<log>
   <date>(nur Jahr)</date>
   <date>(nur Jahr)</date>
   <reading>Vorlesungstitel (Attribute z.B. Nachschreibklausur in Klammern)</reading>
   <reading>Vorlesungstitel</reading>
  <extra>Attribute z.B. Nachschreibklausur, Musterlösung, ...</extra>
   <type>schriftlich/mündlich</type>
   <type>schriftlich/mündlich</type>
   <examiners>
   <examiners>
Zeile 25: Zeile 28:
   <file></file>
   <file></file>
</log>
</log>
  -->
  -->
 
    <log>
      <date>2026</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>InfEERP-01a_sose2026_pz1-gwegwegiuwegweg.pdf</file>
    </log>
<log>
<log>
   <date>2019</date>
   <date>2025</date>
   <reading>Informationssysteme (1. Termin)</reading>
   <reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Renz</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>infsys_renz_ws1819_pz1.pdf</file>
   <file>EAES_SoSe_2025_1.PZ-qehre3weewg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2025</date>
   <reading>Informationssysteme (1. Termin - Lösungen)</reading>
   <reading>Data Visualization</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Renz</examiner>
     <examiner>Zelenka</examiner>
   </examiners>
   </examiners>
   <file>infsys_renz_ws1819_pz1_lsg.pdf</file>
   <file>Data_Visualization_WiSe24-25_2.PZ.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2025</date>
   <reading>Fortgeschrittene Programmierung (Probeklausur)</reading>
   <reading>Informationsmanagement</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Kulczynski</examiner>
   </examiners>
   </examiners>
   <file>fortprog_hanus_ws1819_probe.pdf</file>
   <file>IM-sose25-ewiubwewe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2026</date>
   <reading>XML</reading>
   <reading>Big Data Management and Analytics</reading>
   <type>schrftlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>AufgabenXML.pdf</file>
   <file>BDMA25-26_2-weoiwefoihoewfewf.pdf</file>
</log>
</log>
 
    <log>
 
      <date>2026</date>
      <reading>Process Mining</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>PMWS25_Klausur1-weghiuhweiugwegewg.pdf</file>
    </log>
    <log>
      <date>2026</date>
      <reading>Process Mining</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>PMWS25_Klausur2-weghniuwegiuwegwge.pdf</file>
    </log>
    <log>
      <date>2024</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>EERP24_1-ewoighoiuhwoegoihweg.pdf</file>
    </log>
    <log>
      <date>2024</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>EERP24_2.pdf</file>
    </log>
    <log>
      <date>2025</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>EERP25_2-ewgoihwiuegwe.pdf</file>
    </log>
<log>
<log>
   <date>2015</date>
   <date>2026</date>
   <reading>Programmierung (1. Termin)</reading>
   <reading>Berechnungen und Logik - 2F</reading>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>Programmierung-Klausur_2014_2015.pdf‎</file>
   <file>BuL-2026-2-2F-esgihwkelhglewgwe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2026</date>
   <reading>Mathematik für Informatiker C (1. Termin)</reading>
   <reading>Berechnungen und Logik - 1F</reading>
   <type>mündlich</type>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Langfeld</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>MatheC_WiSe1213_Klausur1.pdf</file>
   <file>BuL-2026-2-1F-rsewukghweligwegweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2026</date>
   <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>
     <examiner>Kliemann</examiner>
   </examiners>
   </examiners>
   <file>TheoInf121321.pdf</file>
   <file>MatheC_2026_2_musterloesung-eawoighouiewhgoiwheiew.pdf</file>
</log>
</log>
<log>
<log>
   <date>2006</date>
   <date>2026</date>
   <reading>Datenbanksysteme</reading>
   <reading>Wissensmanagement und Wissenstechnologien</reading>
   <type>schriftlich</type>
  <extra>2. Termin - gemeinsame Prüfung (2 Personen)</extra>
   <type>mündlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Tochtermann</examiner>
   </examiners>
   </examiners>
   <file>Thalheim Inf Datenbanksysteme 2006.pdf</file>
   <file>WmWt_2026_1-ewiguho8uigviqwuew.pdf</file>
</log>
</log>
<log>
<log>
   <date>2006</date>
   <date>2026</date>
   <reading>Datenbanksysteme (Nachschreibklausur)</reading>
   <reading>Mathematik für die Informatik A</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Braack</examiner>
   </examiners>
   </examiners>
   <file>Thalheim Inf DatenbanksystemeNachschreiber 2006.pdf</file>
   <file>Inf-Math-A_2026_1-weugiuwegweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2026</date>
   <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
   <reading>Foundations of Deep Learning</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>
     <examiner>Pirk</examiner>
   </examiners>
   </examiners>
   <file>Srivastav Inf DiskreteStrukturenWahrscheinlichkeitstheorie 2009.pdf</file>
   <file>FDL_2026_1-kjeabguhweguoihiowqeg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2026</date>
   <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
   <reading>Computer Graphics</reading>
   <type>schriftlich</type>
  <extra>1. Termin</extra>
   <type>mündlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>
     <examiner>Pirk</examiner>
   </examiners>
   </examiners>
   <file>Srivastav Inf DiskreteStrukturenWahrscheinlichkeitstheorie 2008.pdf</file>
   <file>CG_2026_1-ewiohiwuhqwgqg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2026</date>
   <reading>Logik für Informatiker</reading>
   <reading>Data Science</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Spinas</examiner>
     <examiner>Köser</examiner>
   </examiners>
   </examiners>
   <file>Spinas Logik 2007.pdf</file>
   <file>DaSci_2026_1-sewkghiuwegweggew.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2026</date>
   <reading>Mathematik für Informatiker 1 (1. Termin)</reading>
   <reading>Computersysteme</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Braack</examiner>
     <examiner>von Hanxleden</examiner>
   </examiners>
   </examiners>
   <file>Braack Inf Mathe1 2007.PDF</file>
   <file>CompSys_2026_1-eqwoiufhoiuwhegoi.pdf</file>
</log>
</log>
<log>
<log>
   <date>2006</date>
   <date>2026</date>
   <reading>Inf Logikprogrammierung</reading>
   <reading>Big Data Management and Analytics</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Hanus Inf Logikprogrammierung 2006.pdf</file>
   <file>BDMA_2026_1-weuighiuwehgwegwe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2001</date>
   <date>2025</date>
   <reading>Inf Programmierung</reading>
   <reading>Database Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Hanus Inf Programmierung 2001.pdf</file>
   <file>db_2025_1-welgnwkegweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2025</date>
   <reading>Inf Programmierung</reading>
   <reading>Algorithms on Sequences</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Fleischmann</examiner>
   </examiners>
   </examiners>
   <file>Hanus Inf Programmierung 2008.pdf</file>
   <file>AlgSeq_2025_2-ewegubwegiuwg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2025</date>
   <reading>Informatik 1</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Kliemann</examiner>
   </examiners>
   </examiners>
   <file>Hanus Informatik I WS0809.pdf</file>
   <file>MatheC_2025_2_musterloesung-weguiiuewguw.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2026</date>
   <reading>Inf Programmierung</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Kliemann</examiner>
   </examiners>
   </examiners>
   <file>Berghammer Inf Programmierung 2007.pdf</file>
   <file>MatheC_2026_1_musterloesung-weughiuweghweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>1999</date>
   <date>2023</date>
   <reading>Theoretische Informatik</reading>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Esquivel</examiner>
   </examiners>
   </examiners>
   <file>Berghammer_D_Theo_alt_96-99.pdf</file>
   <file>AlgMetP_2023_1_ungeloest-soeiwghweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>1999</date>
   <date>2023</date>
   <reading>Effiziente Algorithen, DB</reading>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <type>mündlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer, Kandzia</examiner>
     <examiner>Esquivel</examiner>
   </examiners>
   </examiners>
   <file>Berghammer_Kandzia_D_Theo_042001.pdf</file>
   <file>AlgMetP_2023_2_ungeloest-saynvwbeg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2004</date>
   <date>2024</date>
   <reading>VD Informatik</reading>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Esquivel</examiner>
   </examiners>
   </examiners>
   <file>Berghammer_VD_InfoB_102004.pdf</file>
   <file>AlgMetP_2024_1_ungeloest-wegiojioweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2025</date>
   <reading>MfI</reading>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Bergweiler</examiner>
     <examiner>Esquivel</examiner>
   </examiners>
   </examiners>
   <file>Bergweiler_VD_MfI_092007.pdf</file>
   <file>AlgMetP_2025_1_ungeloest-wegiqjwf.pdf</file>
</log>
</log><log>
 
   <date>2025</date>
<log>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <date>2004</date>
  <extra>2. Termin</extra>
   <reading>Gruppentheorie, Algebraische Kombinatorik der Permutationen</reading>
   <type>schriftlich</type>
   <type>mündlich</type>
   <examiners>
   <examiners>
     <examiner>Blessenohl</examiner>
     <examiner>Esquivel</examiner>
   </examiners>
   </examiners>
   <file>Blessenohl_D_Alg_102004.pdf</file>
   <file>AlgMetP_2025_2_ungeloest-egwkegwe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2020</date>
   <reading>Nebenläufige Programmierung, Verteilte Algorithmen</reading>
   <reading>Computersysteme</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>deRoever</examiner>
     <examiner>Koch</examiner>
   </examiners>
   </examiners>
   <file>deRoever_D_Nebelaeufige_Programmierung_und_Verteilte_Algorithmen_042008.pdf </file>
   <file>Compsys_2020_1_ungeloest-herhhreerhh4.pdf</file>
</log>
</log>
<log>
<log>
   <date>2000</date>
   <date>2021</date>
   <reading>Informatik4, Logik</reading>
   <reading>Einführung in die Bildverarbeitung</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>deRoever</examiner>
     <examiner>Koch</examiner>
   </examiners>
   </examiners>
   <file>deRoever_VD_InfA_alt.pdf</file>
   <file>Bildverarbeitung_2021_1-wegwegwegwge.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2020</date>
   <reading>Synchrone Sprachen, Internet Communication</reading>
   <reading>Objektorientierte Programmierung</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger, von Hanxleden</examiner>
     <examiner>von Hanxleden</examiner>
   </examiners>
   </examiners>
   <file>D_Luttenberger_vonHanxleden_032007.pdf</file>
   <file>Progoo_2020_1-wegwgewqfqwgh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2026</date>
   <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
   <reading>Introduction to Cryptography</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>  
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>Jansen_D_EffAlg_ApproxAlg_062008.pdf</file>
   <file>Crypto_exam-weguhwegiuweg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2004</date>
   <date>2026</date>
   <reading>Effiziente Algorithmen, Kryptographie</reading>
   <reading>Geo-Informationssysteme</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>  
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Jansen_D_Theo_102004.pdf</file>
   <file>Geo-Informationssysteme_PZ1_25-26_siuhgiuwegwegwe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2026</date>
   <reading>Informatik2, Informatik 4</reading>
   <reading>Knowledge Discovery and Data Mining</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>   
     <examiner>Kröger</examiner>
    <examiner>Wilke</examiner>
   </examiners>
</examiners>
   <file>KDDM-1-25_26-ewuiaghiuweghuiweg.pdf</file>
   <file>Jansen_Wilke_VD_Inf2_Inf4_102008.pdf</file>
</log>
</log>
<log>
<log>
   <date>1999</date>
   <date>2026</date>
   <reading>Datenbanken</reading>
   <reading>Automata and Logics</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Klein</examiner>   
     <examiner>Wilke</examiner>
</examiners>
    <examiner>Nowotka</examiner>
   <file>Klein_D_Prakt_alt_93-99.pdf</file>
   </examiners>
   <file>Exam_autlog.pdf</file>
</log>
</log>
<log>
<log>
   <date>2006</date>
   <date>2022</date>
   <reading>Computer Graphik</reading>
   <reading>Knowledge Discovery and Data Mining</reading>
   <type>mündlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Kröger</examiner>
</examiners>
  </examiners>
   <file>Koch_D_CompGrafik_032006.pdf</file>
   <file>KDDM_Exam_WS22_23_2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2025</date>
   <reading>Computer Graphik</reading>
   <reading>Algorithmische Methoden in der Praxis</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Esquivel</examiner>
</examiners>
  </examiners>
   <file>Koch_D_Computer-Grafik_092007.pdf</file>
   <file>AlgMetP_sose25_1pz_jsdvsbviuhbvuhxdgkjjbsdg.zip</file>
</log>
</log>
<log>
<log>
   <date>2003</date>
   <date>2025</date>
   <reading>Computer Graphik</reading>
   <reading>Einführung in die Algorithmik</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Huch</examiner>
</examiners>
  </examiners>
   <file>Koch_D_Tech_alt.pdf</file>
   <file>InfEAlg-01a_sose25_1pz_ksdnvkjnskjvnkjsnkjn.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2025</date>
   <reading>Internet Communications, Computer Networks</reading>
   <reading>Mathematik für die Informatik B</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Langfeld</examiner>
</examiners>
  </examiners>
   <file>Luttenberger_D_cn_ic_042009.pdf</file>
   <file>Inf-Math-B_sose25_1pz_sjdhviuhsuvhkehrdkhbnkerh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2025</date>
   <reading>Internet Communications</reading>
   <reading>Objektorientierte Programmierung</reading>
   <type>mündlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>Luttenberger_D_InternetCommunication_042008.pdf</file>
   <file>InfProgOO-01a_sose25_pz2_nvsdjusvhiuhhskvhnkjjkbjk.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2025</date>
   <reading>Internet Communications, Computer Networks</reading>
   <reading>Datenschutz</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Bremert</examiner>
</examiners>
  </examiners>
   <file>Luttenberger_D_InternetCommunications_042008.pdf</file>
   <file>Inf-DatSchutz_wise2425_sdjbuishuksskjbnkjsbku.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2022</date>
   <reading>Internet Communications, Computer Networks</reading>
   <reading>Datenschutz</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Bremert</examiner>
</examiners>
  </examiners>
   <file>Luttenberger_IC_CN_092008.pdf</file>
   <file>Inf-DatSchutz_w2122-1pz-jvniuviuhuishdvhsdjv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2025</date>
   <reading>Internet Communication (Test-Prüfung)</reading>
   <reading>Computer Networks</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Peters</examiner>
     <examiner>Grossmann</examiner>
</examiners>
    <examiner>Harms</examiner>
   <file>Peters_TestD_InternetCommunication_042008.pdf</file>
  </examiners>
   <file>Infcn01a-sose25-1pz-ajvbsvhbasjkbkjfn.pdf</file>
</log>
</log>
<log>
<log>
   <date>2004</date>
   <date>2025</date>
   <reading>Fuzzy, KI</reading>
   <reading>Analyse von Algorithmen und Komplexität</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Salski</examiner>
     <examiner>Jansen</examiner>
</examiners>
  </examiners>
   <file>Salski_D_Theo_072004.pdf</file>
   <file>InfAAK-01a-sose2025-pz1-siughviuwbvbvbzbj.pdf</file>
</log>
</log>
<log>
<log>
   <date>1998</date>
   <date>2025</date>
   <reading>Verschiedene</reading>
   <reading>Neural Networks and Deep Learning</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Sommer</examiner>  
     <examiner>Meyer</examiner>
</examiners>
  </examiners>
   <file>Sommer_D_Prakt_alt_96-98.pdf</file>
   <file>Inf-nndl-s2025-1pz-fhniuweviubvbjwbs.pdf</file>
</log>
</log>
<log>
<log>
   <date>2004</date>
   <date>2025</date>
   <reading>Kombinatorische Optimierung</reading>
   <reading>Discrete Optimization</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>  
     <examiner>Deppert</examiner>
</examiners>
  </examiners>
   <file>Srivastav_D_AM_102004.pdf</file>
   <file>DiscOpt_SS25_PZ1-sdbvuzsbvuzgsbzugh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2025</date>
   <reading>Kombinatorische Optimierung</reading>
   <reading>Discrete Optimization</reading>
   <type>mündlich</type>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>  
     <examiner>Deppert</examiner>
</examiners>
  </examiners>
   <file>Srivastav_D_KO_082007.pdf</file>
   <file>DiscOpt_SS25_PZ1-solution-acsbiucbezgfbuzvwgz.pdf</file>
</log>
</log>
<log>
<log>
   <date>2002</date>
   <date>2025</date>
   <reading>Kombinatorische Optimierung</reading>
   <reading>Einführung von ERP Systemen</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>  
     <examiner>Gottschalk</examiner>
</examiners>
  </examiners>
   <file>Srivastav_D_Opt_022002.pdf</file>
   <file>Erpsysteme-25_1-fdiubhiurehbvkujb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2001</date>
   <date>2025</date>
   <reading>Kombinatorische Optimierung</reading>
   <reading>Informationsmanagement</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>  
     <examiner>Kulczynski</examiner>
</examiners>
  </examiners>
   <file>Srivastav_D_Opt_042001.pdf</file>
   <file>IMSS25_Klausur1-sfuhbviuwrhviuh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2004</date>
   <date>2025</date>
   <reading>Kombinatorische Optimierung</reading>
   <reading>Ethik in der Informatik</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>  
     <examiner>Große-Bölting</examiner>
</examiners>
  </examiners>
   <file>Srivastav_D_Opt_082004.pdf</file>
   <file>Ethik_klausur_25PZ1-aviuwevbkjbzugzg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2005</date>
   <date>2025</date>
   <reading>Effiziente Algorithmen, Moderne Kryptographie</reading>
   <reading>Compiler Construction</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>von Hanxleden</examiner>
</examiners>
  </examiners>
   <file>Wilke_D_EffAlg_072005.pdf</file>
   <file>Infcc-01a_s2025-pz1-svbubrghwvsnub.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2025</date>
   <reading>Kryptographie, Programmierung</reading>
   <reading>Einführung in die nichtlineare Optimierung</reading>
  <extra>1. Termin</extra>
   <type>mündlich</type>
   <type>mündlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>Slawig</examiner>
<examiner>deRoever</examiner>
  </examiners>
</examiners>
   <file>Einführung_in_die_nichtlineare_Optimierung-2025-1pz-ievbniuerveivbzbveu.pdf</file>
   <file>Wilke_deRoever_D_Kryptographie_Programmierung_122007.pdf</file>
</log>
</log>
<log>
<log>
   <date>2002</date>
   <date>2025</date>
   <reading>Effiziente Algorithmen, Transitionssysteme</reading>
   <reading>Objektorientierte Programmierung</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>Wilke_D_Theo_072002.pdf</file>
   <file>OOP25-Klausur1-2025-wigunbieniuebiuerbe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2007</date>
   <date>2025</date>
   <reading>Echzeitsysteme</reading>
   <reading>Objektorientierte Programmierung</reading>
   <type>mündlich</type>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>vonHanxleden_D_PrakTech_022007.pdf</file>
   <file>OOP25-Klausur1-Lsg-2025-nuvebveukvbnuwbveb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2008</date>
   <date>2025</date>
   <reading>Synchrone Sprachen</reading>
   <reading>Mathematik für die Informatik B</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Langfeld</examiner>
</examiners>
  </examiners>
   <file>vonHanxleden_D_SynchroneSprachen_042008.pdf</file>
   <file>Inf-Math-B_sose25_1pz-unvshesuvwhvushv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2025</date>
   <reading>Datenbanksysteme1, Betriebssysteme</reading>
   <reading>Mathematik für die Informatik B</reading>
   <type>mündlich</type>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Klein</examiner>
     <examiner>Langfeld</examiner>
     <examiner>von Hanxleden</examiner>
  </examiners>
</examiners>
   <file>Inf-Math-B_sose25_1pz-sduivhiurnbvrer.pdf</file>
   <file>vonHanxleden_Klein_VD_BS_DB_092009.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2025</date>
   <reading>Datenbanksysteme1</reading>
   <reading>Algorithms on Sequences</reading>
   <type>mündlich</type>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Fleischmann</examiner>
</examiners>
  </examiners>
   <file>Thalheim_D_DBS1_2009.pdf</file>
   <file>AoS2025-1-musterloesung-sdvhwriubvbrsv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2006</date>
   <date>2025</date>
   <reading>Theoretische Informatatik, Logik</reading>
   <reading>Algorithms on Sequences</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>Fleischmann</examiner>
</examiners>
  </examiners>
   <file>Wilke-InfA-TheoInf_Logik-Oktober2006.pdf</file>
   <file>AoS_PZ1_SS25-vbwzebvuwhupser.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2025</date>
   <reading>Logik, DSW</reading>
   <reading>Social Media und Web Science</reading>
  <extra>1. Termin</extra>
   <type>mündlich</type>
   <type>mündlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>Peters</examiner>
<examiner>Srivastav</examiner>
  </examiners>
</examiners>
   <file>2025-Social_Media_und_Web_Science-Gedächtnisprotokoll-vbwuebvbrjvbejbebjvezvbrjwzgef.pdf</file>
   <file>Wilke_Srivastav_Logik_DSW.pdf</file>
</log>
</log>
<log>
<log>
   <date>2005</date>
   <date>2025</date>
   <reading>Theoretische Informatatik, Logik</reading>
   <reading>Data Science</reading>
   <type>mündlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Wilke</examiner>
    <examiner>Köser</examiner>
</examiners>
  </examiners>
   <file>Wilke_VD_InfA_Okt2005.pdf</file>
   <file>data_science_2025_pz2-whgiuwhviuwniubuewbv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2023</date>
   <reading>Datenbanken</reading>
   <reading>Objektorientierte Programmierung</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Thalheim</examiner>
    <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>datenbanken_2009.pdf</file>
   <file>InfProgOO-01a_SoSe23_Klausur_PZ1-ungeloest-wihvwiuhvuiwhuivhuihiv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2009</date>
   <date>2023</date>
   <reading>Informatik IV (Nachschreibklausur)</reading>
   <reading>Objektorientierte Programmierung</reading>
  <extra>2. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Jansen</examiner>
    <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>nk_informatikiv_2009.pdf</file>
   <file>InfProgOO-01a_SoSe23_Klausur_PZ2-ungeloest-evuiwubvwbvbwv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2011</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker C (1. Termin)</reading>
   <reading>Objektorientierte Programmierung</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Braack</examiner>  
    <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>MatheC_Braack_20102011.pdf</file>
   <file>InfProgOO-01a_SoSe24_Klausur_PZ1-ungeloest-fiuvrneuhgberhth.pdf</file>
</log>
</log>
<log>
<log>
   <date>2012</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Objektorientierte Programmierung</reading>
  <extra>2. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Berghammer</examiner>  
    <examiner>Slawig</examiner>
</examiners>
  </examiners>
   <file>MatheA_fuer_Inf_11_12.png</file>
   <file>InfProgOO-01a_SoSe24_Klausur_PZ2-ungeloest-sbviwbvbrevberbteh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2011</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Ethik in der Informatik</reading>
  <extra>2. Termin - Bewertungsschema</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Berghammer</examiner>  
    <examiner>Große-Bölting</examiner>
</examiners>
  </examiners>
   <file>MatheA_fuer_Inf_10_11.png</file>
   <file>InfEthik-01a_SoSe24_Klausur_PZ2-Bewertungsschema-udvbsiurbiui.pdf</file>
</log>
</log>
<log>
<log>
   <date>2011</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker B (1. Termin)</reading>
   <reading>Ethik in der Informatik</reading>
  <extra>2. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Klein</examiner>  
    <examiner>Große-Bölting</examiner>
</examiners>
  </examiners>
   <file>MatheB2011.pdf</file>
   <file>InfEthik-01a_SoSe24_Klausur_PZ2-aisufhcurhwb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2012</date>
   <date>2024</date>
   <reading>Softwaretechnik</reading>
   <reading>Ethik in der Informatik</reading>
  <extra>1. Termin - Bewertungsschema</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Hasselbring</examiner>  
    <examiner>Große-Bölting</examiner>
</examiners>
  </examiners>
   <file>Klausur_Sofwaretechnik_2012.pdf</file>
   <file>InfEthik-01a_SoSe24_Klausur_PZ1-Bewertungsschema-siuvwrbv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2010</date>
   <date>2024</date>
   <reading>Digitale Systeme</reading>
   <reading>Ethik in der Informatik</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Große-Bölting</examiner>
   </examiners>
   </examiners>
   <file>Schimmler_SysInfI_2010.pdf</file>
   <file>InfEthik-01a_SoSe24_Klausur_PZ1-iweughiurhbviu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2012</date>
   <date>2025</date>
   <reading>Softwaretechnik (2. Termin)</reading>
   <reading>Einführung in die Wirtschaftsinformatik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Hasselbring</examiner>   
    <examiner>Cordes</examiner>
</examiners>
   </examiners>
   <file>softwaretechnik_2012_2.pdf</file>
   <file>Infewinf-w2425-1-sjbviuwrbvunbviusbwbvwebv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2025</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Distributed Systems</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Mathe_Inf_A_Srivastav_12_13.pdf</file>
   <file>infds-01a2025-2-iuwgvuibniuuhweuhb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2025</date>
   <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Hanus</examiner>
</examiners>
  </examiners>
   <file>Hanus_FortProg_2013_Termin1.pdf</file>
   <file>infdp-01a-2025-2-anviwubneriuun.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2025</date>
   <reading>Mathematik für Informatiker A (2. Termin)</reading>
   <reading>Cryptography</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>MatheA_WS1314_2PZ.pdf</file>
   <file>infcryp-01a-2025-2-abvwebviuwhgiwueghiurw.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2025</date>
   <reading>Digitale Systeme (1. Termin)</reading>
   <reading>Berechnungen und Logik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>DigitaleSysteme_2014_1.pdf</file>
   <file>infbl-01a-2025-2-kabvuaqebzbwev.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2025</date>
   <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
   <reading>Computersysteme</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>von Hanxleden</examiner>
   </examiners>
   </examiners>
   <file>fortprog_hanus_ws1819_pz1.pdf</file>
   <file>Inf-CompSyS_ws2425_1pz.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2025</date>
   <reading>Fortgeschrittene Programmierung (Probeklausur)</reading>
   <reading>Einführung in die Informatik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Mühling</examiner>
   </examiners>
   </examiners>
   <file>fortprog_hanus_ws1819_probe.pdf</file>
   <file>InfEInf-01a_ws2425_klausur-2-sdvuzbzbvzeverbvjze.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2025</date>
   <reading>IT Recht (1. Termin)</reading>
   <reading>Mathematik für die Informatik A</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Lindhorst</examiner>
     <examiner>Langfeld</examiner>
   </examiners>
   </examiners>
   <file>it-recht_lindhorst_ss18_pz1.pdf</file>
   <file>Inf-Math-A wise2425 1pz-siubvwiuebvwqfhw.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2025</date>
   <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
   <reading>Mobile Robotics</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Köser</examiner>
   </examiners>
   </examiners>
   <file>Bsks_ss2017_1.pdf</file>
   <file>InfMobRob_wise2425_1pz-sxdiviuwevbwubevwegf.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2025</date>
   <reading>Computersysteme (1. Termin)</reading>
   <reading>Operating Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Tomforde</examiner>
   </examiners>
   </examiners>
   <file>Compsys_ws1617_1.pdf</file>
   <file>OS-WS2425-PZ1_sbaiuberb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2015</date>
   <date>2025</date>
   <reading>Programmierung (Probeklausur - Lösungen)</reading>
   <reading>Distributed Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_probe_loesung.pdf</file>
   <file>Distributed_Systems_2025_1PZ-jvnurebvdbte.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Programmierung (1. Termin)</reading>
   <reading>Data Science</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Köser</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_1.pdf</file>
   <file>Data_Science_2025_1PZ-egbuvwurejb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Softwaretechnik</reading>
   <reading>Funktionale Programmierung</reading>
   <type>schriftlich</type>
  <extra>1. Termin</extra>
   <type>mündlich</type>
   <examiners>
   <examiners>
     <examiner>Hasselbring</examiner>
     <examiner>Huch</examiner>
   </examiners>
   </examiners>
   <file>SWT_WS1516_1.ZR.pdf</file>
   <file>Funktionale-programmierung-protokoll-2025-1-wenwurngiebnbine.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Digitale Systeme</reading>
   <reading>Data Visualization</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Zelenka</examiner>
   </examiners>
   </examiners>
   <file>DigiSys16-Version.pdf</file>
   <file>DataVis_ws2425_PZ1-egniubruszvzewg.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
   <reading>Tiny Machine Learning (Edge AI)</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Entwurf eingebetteter Echtzeitsysteme _ WiSe 15_16 _ Zeitraum 1 _ Note 1,7.pdf</file>
   <file>InfEDAI-01a_2025_Klausur_1_a7eNwGGs4doLCJDdf8vIOj_34M_f.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Theoretische Grundlagen der Informatik</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Wilke</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>Klausur_TGI_WS1516_1.jpg</file>
   <file>DP-ws2425-klausur1-siuvbuwirbiurewnbiuer.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Wissenschaftliches Rechnen</reading>
   <reading>Mathematik für die Informatik C</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Börm</examiner>
     <examiner>Kliemann</examiner>
   </examiners>
   </examiners>
   <file>Prüfungsprotokoll_wissrech.pdf</file>
   <file>05_Klausur1_InfC_Loesung-evbwuzbvwzbv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2021</date>
   <reading>XML (1. Termin)</reading>
   <reading>Fortgeschrittene Programmierung</reading>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>XML-Klausur-1pz-ws1516.pdf</file>
   <file>FortProg-frueher-4-sdvubuewbuvbweuv.pdf</file>
</log>
</log>
<log>
<log>
<date>2016</date>
  <date>2021</date>
   <reading>Computergraphik (1. Termin)</reading>
   <reading>Fortgeschrittene Programmierung</reading>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>CG-Klausur-WS1516.pdf</file>
   <file>FortProg-frueher-3-suwibiuartbtrbntunbe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2021</date>
   <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
   <reading>Fortgeschrittene Programmierung</reading>
   <type>mündlich</type>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>Prüfungsprotokoll - Entwurf eingebetteter Echtzeitsysteme - WS15_16.pdf</file>
   <file>FortProg-frueher-2-yajsnvrwunsewvnu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2021</date>
   <reading>Deklarative Programmiersprachen1516 (1. Termin)</reading>
   <reading>Fortgeschrittene Programmierung</reading>
   <type>mündlich</type>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>Deklarative Programmiersprachen1516.pdf</file>
   <file>FortProg-frueher-1-wurnunubjnuern.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2021</date>
   <reading>Informationssysteme (1. Termin)</reading>
   <reading>Fortgeschrittene Programmierung</reading>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>InfSys_WS2015_Klausur.pdf</file>
   <file>FortProg-w21-2-fionbiuebnerbui.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2021</date>
   <reading>Softwaretechnik</reading>
   <reading>Fortgeschrittene Programmierung</reading>
   <type>mündlich</type>
  <extra>Probeklausur/Altklausur</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hasselbring</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>Softwaretechnik-Prüfungsprotokoll1516.pdf</file>
   <file>FortProg-w21-1-hbvueierbvuireb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Nebenläufige und verteilte Programmierung</reading>
   <reading>Deklarative Programmierung</reading>
   <type>mündlich</type>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Huch</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>prüfungsprotokoll nebenläufige und verteilte programmierung.pdf</file>
   <file>DP-Klausurloesung-w24-2-xcabuwenviernibniu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2015</date>
   <date>2024</date>
   <reading>Multimediale Signal- und Bildverarbeitung</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>klausur multimediale signal und bildverarbeitung.pdf</file>
   <file>DP-Klausurloesung-w24-1-uhdviurbineriubiuerb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2023</date>
   <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Hanus</examiner>
    <examiner>Schnoor</examiner>
   </examiners>
   </examiners>
   <file>KlausurSS2016-Koch-Schnoor.pdf</file>
   <file>DP-Klausurloesung-w23-2-sdjbvuweanieruibuier.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2023</date>
   <reading>Betriebs- und Kommunikationssysteme (2. Termin)</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Hanus</examiner>
    <examiner>Schnoor</examiner>
   </examiners>
   </examiners>
   <file>BSKS_SS16_2.ZR.pdf</file>
   <file>DP-Klausurloesung-w23-1-vbiuwevbiuweuvbewuv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Computersysteme (1. Termin)</reading>
   <reading>Einführung in die Informatik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Mühling</examiner>
   </examiners>
   </examiners>
   <file>Compsys-WS2016_1.compressed.pdf</file>
   <file>InfEInf-01a-wise2425-1pz-uiewbgiuvbwezvw2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Web-Technologien (1. Termin)</reading>
   <reading>Algebraic Automata Theory</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Fleischmann</examiner>
   </examiners>
   </examiners>
   <file>WebTech_SS16_1.ZR.pdf</file>
   <file>InfAAT-01a-wise2425-1pz-isbviubrwuibuirerb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2025</date>
   <reading>Analysis 3 (1. Termin)</reading>
   <reading>Text Mining</reading>
  <extra>Probeklausur</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Haase</examiner>
     <examiner>Krestel</examiner>
   </examiners>
   </examiners>
   <file>Analysis_3_SS16.pdf</file>
   <file>InfTM-01a-wise2425-probleklausur-rhbvewbvzbwjzbvv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Wahrscheinlichkeitstheorie (LAG) (1. Termin)</reading>
   <reading>Einführung in die Informatik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Klein</examiner>
     <examiner>Mühling</examiner>
   </examiners>
   </examiners>
   <file>WTheorie_SS16_1.ZR.pdf</file>
   <file>EInf_Klausur_WS23_24_PZ2-ebuiwebvbwsdbvh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Computer Networks</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Mathe_A_WS16_17_1_Versuch.pdf</file>
   <file>CNSS24-Klausur2-avbewvibwirbvrwbu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Logik in der Informatik (1. Termin mit Lösung)</reading>
   <reading>Algorithms on Sequences</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Wilke</examiner>
     <examiner>Fleischmann</examiner>
   </examiners>
   </examiners>
   <file>Logik_Inf_SS16_Lsg.pdf</file>
   <file>AlgSeqSS24-Klausur2-siudbvwiubvwbv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
   <reading>3D Computer Vision</reading>
   <type>schriftlich</type>
  <extra>Protokoll</extra>
   <type>mündlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>
     <examiner>Köser</examiner>
   </examiners>
   </examiners>
   <file>klausur_ads_ss2016.pdf</file>
   <file>CV3DSS24-Protokoll-divuweubvwbzvbz.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Algorithmen und Datenstrukturen (Probeklausur)</reading>
   <reading>Informatikrecht</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>
     <examiner>Lindhorst</examiner>
   </examiners>
   </examiners>
   <file>Ads_ss2017_probe.pdf</file>
   <file>InfRechtWS24-Klausur1-esbvuweviueriubvui.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2023</date>
   <reading>Machine Learning</reading>
   <reading>Operating Systems</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Prof. Dr. Carsten Meyer</examiner>
     <examiner>Tomforde</examiner>
   </examiners>
   </examiners>
   <file>Machine_Learning_Klausur_SS17.pdf</file>
   <file>OSWS23-Klausur2-siuvbwubvuwrvu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (Probeklausur)</reading>
   <reading>Einführung in die Wirtschaftsinformatik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Speck</examiner>
    <examiner>Kröger</examiner>
    <examiner>Kulczynski</examiner>
   </examiners>
   </examiners>
   <file>Mathe_inf_a_ws1617_probe.pdf</file>
   <file>EWIWS23-Klausur2-saibvwebvwrvuwhfu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (Probeklausur - Lösungen)</reading>
   <reading>Einführung in die Wirtschaftsinformatik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Speck</examiner>
    <examiner>Kröger</examiner>
    <examiner>Kulczynski</examiner>
   </examiners>
   </examiners>
   <file>Mathe_inf_a_ws1617_probe_loesung.pdf</file>
   <file>EWIWS23-Klausur1-ajfvweubwkwb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2023</date>
   <reading>Programmierung (1. Termin - Lösungen)</reading>
   <reading>Einführung in die Wirtschaftsinformatik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Cordes</examiner>
    <examiner>Kulczynski</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_1_loesung.pdf</file>
   <file>EWIWS22-Klausur2-jsdbvuwbuebv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2023</date>
   <reading>Programmierung (2. Termin)</reading>
   <reading>Einführung in die Wirtschaftsinformatik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Cordes</examiner>
    <examiner>Kulczynski</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_2.pdf</file>
   <file>EWIWS22-Klausur1-oewhgihoioirweb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Programmierung (2. Termin - Lösungen)</reading>
   <reading>Database Systems</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_2_loesung.pdf</file>
   <file>DBS-SoSe24-PZ2-ufudjzdzrdjzdztdf1.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Programmierung (Probeklausur)</reading>
   <reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading>
  <extra>2. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1617_probe.pdf</file>
   <file>EAES_Exam_dsjbvuwbeiuvbzuewzfuv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Programmierung (Probeklausur - Lösungen)</reading>
   <reading>Mathematik für die Informatik B</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Langfeld</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1617_probe_loesung.pdf</file>
   <file>MathB_K1_loes_mit_Punkten-eriubviuwbvub.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Programmierung (1. Termin)</reading>
   <reading>Software Technik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Schnoor</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1617_1.pdf</file>
   <file>ST-24-PZ1-ZvKONPFQFAc7hBv4qNVcNh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2015</date>
   <date>2024</date>
   <reading>Programmierung (Probeklausur)</reading>
   <reading>Advanced Data Mining and Machine Learning Methods</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>von Hanxleden</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_ws1516_probe.pdf</file>
   <file>ADMMLM_SS24_PZ1-fPyb9Nkso1l3e4ir7wlcyB.pdf</file>
</log>
</log>
<log>
<log>
   <date>2015</date>
   <date>2024</date>
   <reading>Mathematik Für Informatiker A (2. Termin)</reading>
   <reading>Einführung in die Algorithmik</reading>
  <extra>"3". Termin (2023)</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Huch</examiner>
   </examiners>
   </examiners>
   <file>MatheA_WS1415_2PZ.pdf</file>
   <file>EinfAlg 23 3-AIBBUiewfbzu=GUOhh.pdf</file>
</log>
</log>
<log>
<log>
   <date>2015</date>
   <date>2023</date>
   <reading>Mathematik Für Informatiker A (1. Termin)</reading>
   <reading>Einführung in die Algorithmik</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Huch</examiner>
   </examiners>
   </examiners>
   <file>MatheA_WS1415_1PZ.pdf</file>
   <file>EinfAlg_23_2-wfqweiguu3b.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Mathematik Für Informatiker A (1. Termin)</reading>
   <reading>Objektorientierte Programmierung</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Slawig</examiner>
   </examiners>
   </examiners>
   <file>MatheA_WS1516_1PZ.pdf</file>
   <file>Progoo202401-hvbwiwdcqeuhv4b.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Mathematik Für Informatiker A (2. Termin)</reading>
   <reading>Internet of Things</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>MatheA_WS1516_2PZ.pdf</file>
   <file>IoT241-fuidbhuhvuhuirhkrhb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Computer Networks</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Mathe_a_ws1718_pz1.pdf</file>
   <file>ComputerNetworks24PZ1-efihwiugbvrvbuer.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Informationssysteme (1. Termin)</reading>
   <reading>Algorithms on Sequences</reading>
  <extra>1. Termin + Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Fleischmann</examiner>
   </examiners>
   </examiners>
   <file>Infsys_ws1617_pz1.pdf</file>
   <file>AoS2024-1_rwdZrmTN58uTT2JjNfwY.pdf</file>
</log>
<log>
      <date>2024</date>
      <reading>Algorithms on Sequences</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Fleischmann</examiner>
      </examiners>
      <file>Inf-AlgSeq_24_Klausur_1_PljsyvoMVbKcw7JZJfV74QME.pdf</file>
</log>
<log>
      <date>2024</date>
      <reading>Algorithms on Sequences</reading>
      <extra>1. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Fleischmann</examiner>
      </examiners>
      <file>Inf-AlgSeq_24_Klausur_1_ungeloest_mnpp8_n2ZcG3hNnUu-KP.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2023</date>
   <reading>Informationssysteme (2. Termin, mit Lösungen)</reading>
   <reading>Computer Networks</reading>
  <extra>2. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Infsys_ws1617_pz2_mit_loesung.pdf</file>
   <file>Computer_Networks_Exam_2023_SS_2_without_solutions-siuvbbewv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Einführung in die numerische Mathematik</reading>
   <reading>Einführung in die Algorithmik</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Börm</examiner>
     <examiner>Huch</examiner>
   </examiners>
   </examiners>
   <file>Numerik_ws1718_0.pdf</file>
   <file>Ealg-SS24-PZ1-jvbiwbeubvu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Computersysteme (1. Termin)</reading>
   <reading>Operating Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Tomforde</examiner>
   </examiners>
   </examiners>
   <file>Compsys_ws1718_pz1.pdf</file>
   <file>OS_WiSe_23_24-dvbzbvuuzbiwefqoi.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (Probeklausur)</reading>
   <reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Mathe-a_berghammer_ws1617_probe.pdf</file>
   <file>EAeS_SS24_PZ1-hsdbvwbjv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
   <reading>Quantum Computing</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>Fortprog_hanus_ws1717_pz2.pdf</file>
   <file>InfQComp-01a_24_Klausur_1_K2RmanXAWDqSk5z0FVnSwG-5.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2024</date>
   <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
   <reading>Neural Networks and Deep Learning</reading>
  <extra>1. Termin - Gedächtnisprotokoll</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Meyer</examiner>
   </examiners>
   </examiners>
   <file>Fortprog_hanus_ws1717_pz1.pdf</file>
   <file>2024-1_NNDL-abschrift-ghvuierhguiherui.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2023</date>
   <reading>Graphenthorie (1. Termin)</reading>
   <reading>Database Systems</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Srivastav</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Graphentheorie_Srivastav_ws1718_1f_pz1.pdf</file>
   <file>DBS_20232PZ_ocred-weivbuzadfybb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2023</date>
   <reading>Fortgeschrittene Programmierung (1. Termin, mit Lösungen)</reading>
   <reading>Cryptography</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Wilke</examiner>
   </examiners>
   </examiners>
   <file>Fortprog_hanus_ws1718_pz1.pdf</file>
   <file>2023_WiSe_exam_cryptography-dsviubvbsbv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2023</date>
   <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
   <reading>Computer Networks</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Huch</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>Fortprog_huch_ss16_pz2.tar.xz</file>
   <file>Computer_Networks_2023_PZ1_ungelöst-iuwbvbvfb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2016</date>
   <date>2024</date>
   <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
   <reading>Database Systems</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Huch</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Fortprog_huch_ss16_pz1.tar.xz</file>
   <file>Klausur_DBS_SS2024_1PZ_blanko-u31fbiub4uvbrefvbi.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Computersysteme (2. Termin)</reading>
   <reading>Database Systems</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>Computersysteme_WS1718_2.pdf</file>
   <file>DBS20241PZ-musterloesung-eviuenbiuersjvb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Einführung in die Wirtschaftsinformatik (1. Termin)</reading>
   <reading>Einführung in die Algorithmik</reading>
  <extra>1. Termin - ungelöst</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>Huch</examiner>
   </examiners>
   </examiners>
   <file>Einf_winf_thalheim_ws1718_pz1.pdf</file>
   <file>Infealg24-1-12345676543rwefdght6u5w.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Softwaretecknik (1. Termin)</reading>
   <reading>Database Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hasselbring</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>swt_hasselbring_ss18_pz1.pdf</file>
   <file>InfDB-2024-Klausur-1_ocred_compressed_uhafivuhsriueghieuahcng.pdf</file>
</log>
</log>
<log>
<log>
   <date>2017</date>
   <date>2023</date>
   <reading>Algorithmen und Datenstrukturen (2. Termin)</reading>
   <reading>Analyse von Algorithmen und Komplexität</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Jansen</examiner>
     <examiner>Jansen</examiner>
   </examiners>
   </examiners>
   <file>Ads_jansen_ss17_pz2.pdf</file>
   <file>AAK_SS23_PZ2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (2. Termin)</reading>
   <reading>Data Science</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Berghammer_MatheA_WS17_2PZ.pdf</file>
   <file>DataScience2024-2-kjvcdrtzujhbvcdtzu.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
   <reading>Big Data Management and Analytics</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Sandro Esquivel</examiner>
     <examiner>Kröger</examiner>
   </examiners>
   </examiners>
   <file>BSKS_Klausur_SS_2018.1.pdf</file>
   <file>BDMA_2324_PZ1-djvbiuwau38fvhwba.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2024</date>
   <reading>Numerische Programmierung</reading>
   <reading>Mathematik für die Informatik A</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Börm</examiner>
     <examiner>Langfeld</examiner>
   </examiners>
   </examiners>
   <file>Numprog_SS18_boerm.pdf</file>
   <file>MatheA_2024-uerv87wqg4bfiwq.pdf</file>
</log>
</log>
<log>
<log>
   <date>2018</date>
   <date>2023</date>
   <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
   <reading>Analyse von Algorithmen und Komplexität - Komplexitätsteil</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Jansen</examiner>
   </examiners>
   </examiners>
   <file>fortprog_hanus_ws1718_pz2.pdf</file>
   <file>AAK_K_2024-rueihubieriubriuebv.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2024</date>
   <reading>Computersysteme (1. Termin)</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>Koch_Compsys_WS1819_1.pdf</file>
   <file>DP_2024_PZ2_eughiuhwaefbvriz.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2024</date>
   <reading>Informationssysteme (1. Termin)</reading>
   <reading>Computer Graphics</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Renz</examiner>
     <examiner>Pirk</examiner>
   </examiners>
   </examiners>
   <file>infsys_renz_ws1819_pz1.pdf</file>
   <file>InfCG-02a_24_Klausur1_DBInUFWSIHdg3fXW.pdf</file>
</log>
</log>
<log>
<log>
   <date>2019</date>
   <date>2024</date>
   <reading>Informationssysteme (1. Termin - Lösungen)</reading>
   <reading>Computer Graphics</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Renz</examiner>
     <examiner>Pirk</examiner>
   </examiners>
   </examiners>
   <file>infsys_renz_ws1819_pz1_lsg.pdf</file>
   <file>InfCG-02a_24_Klausur2_5BhBlHL9ZxWh8-PIkWtGpwNN.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2023</date>
   <reading>Programmierung (2. Termin)</reading>
   <reading>Methoden der Effizienten Ähnlichkeitssuche in großen Datenbeständen</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>Klausur--Programmierung--2014-04-08.pdf</file>
   <file>Klausur_EAS_SS23-oztijohiewees5vz54nfew.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>Mathematik für Informatiker A (1. Termin)</reading>
   <reading>Data Science</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Renz</examiner>
   </examiners>
   </examiners>
   <file>MathematikA_2014_1.pdf</file>
   <file>Klausur_DataScience_WS2324-weiguiwugwegwerqadxchtjto.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>Programmierung (1. Termin)</reading>
   <reading>Berechnungen und Logik - 2F</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Hanus</examiner>
     <examiner>Nowotka</examiner>
   </examiners>
   </examiners>
   <file>Programmierung_2014_1.pdf</file>
   <file>BuL_23_24_2F1PZ-iudsvgigzavgueru.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>Einführung in die Numerik</reading>
   <reading>Data Visualization</reading>
   <type>mündlich</type>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Börm</examiner>
    <examiner>Zelenka</examiner>
</examiners>
  </examiners>
   <file>Numerik_boerm_2014.pdf</file>
   <file>DataVis-Klausur-w2023-1 hwiuiuebicuiwzegf.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>IT-Sicherheit</reading>
   <reading>Berechnungen und Logik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Wilke</examiner>
     <examiner>Nowotka</examiner>
   </examiners>
   </examiners>
   <file>it_sicherheit_2014_1.pdf</file>
   <file>BuL-20232-1.PZ-uvbubhvdbvubjsd.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>Digitale Systeme (2. Termin)</reading>
   <reading>Einführung in die Informatik</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Mühling</examiner>
   </examiners>
   </examiners>
   <file>DigitaleSysteme_2014_2.pdf</file>
   <file>W23einf1.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2024</date>
   <reading>Softwaretechnik (1. Termin)</reading>
   <reading>Computersysteme</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
<examiner>Nowotka</examiner>   
    <examiner>von Hanxleden</examiner>
</examiners>
   </examiners>
   <file>softwaretechnik_2014_1.pdf</file>
   <file>W23compsys1.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2024</date>
   <reading>Digitale Systeme (2. Termin)</reading>
   <reading>Deklarative Programmierung</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Hanus</examiner>
   </examiners>
   </examiners>
   <file>DigitaleSysteme_WS1213_2.pdf</file>
   <file>2024W DekProg_1-PZ_qrKuTpfHW6fLb692wR2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2022</date>
   <reading>Digitale Systeme (1. Termin)</reading>
   <reading>Distributed Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schimmler</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>DigitaleSysteme_WS1213_1.pdf</file>
   <file>InfDS-01a_22_Klausur1_qXZ2azQ6GmY5lVMb.pdf</file>
</log>
</log>
<log>
<log>
   <date>2014</date>
   <date>2023</date>
   <reading>Wirtschaftsinformatik 3 (1. Termin)</reading>
   <reading>Embedded Real-Time Systems</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Thalheim</examiner>
     <examiner>von Hanxleden</examiner>
   </examiners>
   </examiners>
   <file>Wirtschaftsinformatik_3_WS1314_PZ1_Thalheim.pdf</file>
   <file>Inf-EntEinSys_23_Klausur1_X8jgpH5OKj-_dhxe.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2023</date>
   <reading>3D Szenerekonstruktion, Computer Grafik</reading>
   <reading>Einführung in die Informatik</reading>
   <type>mündlich</type>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Koch</examiner>
     <examiner>Mühling</examiner>
</examiners>
  </examiners>
   <file>Koch_D_3D_ComputerGrafik_092013.pdf</file>
   <file>EinfInf2223 Klausur2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2012</date>
   <date>2023</date>
   <reading>XML</reading>
   <reading>Data Visualization</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Zelenka</examiner>
   </examiners>
   </examiners>
   <file>luttenberger_xml_2012.pdf‎</file>
   <file>InfDataVis-01a_2023_1.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2023</date>
   <reading>Mathematik für Informatiker A (Probeklausur)</reading>
   <reading>Data Visualization</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Berghammer</examiner>
     <examiner>Zelenka</examiner>
   </examiners>
   </examiners>
   <file>MaInf_A_PrKl_WS1314.pdf</file>
   <file>InfDataVis-01a_23_Klausur2_vYgjPlTaQRZYc82b5U3Ca7X3.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2023</date>
   <reading>Kommunikatiossysteme (2. Termin)</reading>
   <reading>Computational Intelligence</reading>
  <extra>1. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Luttenberger</examiner>
     <examiner>Tomforde</examiner>
   </examiners>
   </examiners>
   <file>Kommunikationssysteme_SoSe13_(erster_Zeitraum).pdf‎</file>
   <file>InfCI-01a_23_Klausur1.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2023</date>
   <reading>Mathematik für Informatiker B (1. Termin)</reading>
   <reading>Computer Networks</reading>
  <extra>2. Termin</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Langfeld</examiner>
     <examiner>Landsiedel</examiner>
   </examiners>
   </examiners>
   <file>MatheB_SS_2013_1.pdf</file>
   <file>InfCN-01a_22-23_Klausur2.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2024-04-10</date>
   <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>2. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Börm</examiner>
     <examiner>Lasse Kliemann</examiner>
   </examiners>
   </examiners>
   <file>ADS_SS_2013_1.pdf</file>
   <file>Inf-Math-C_2023-24_PZ2_Musterlösung.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2024-02-19</date>
   <reading>Informationssysteme - Hauptfach (1. Termin)</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schnoor</examiner>
     <examiner>Lasse Kliemann</examiner>
</examiners>
  </examiners>
   <file>informationssyteme_hauptfach_sose2013.pdf</file>
   <file>Inf-Math-C_2023-24_PZ1_Musterlösung.pdf</file>
</log>
</log>
<log>
<log>
   <date>2013</date>
   <date>2023</date>
   <reading>Informationssysteme - Nebenfach (1. Termin)</reading>
   <reading>Mathematik für die Informatik C</reading>
  <extra>1. Termin - Musterlösung</extra>
   <type>schriftlich</type>
   <type>schriftlich</type>
   <examiners>
   <examiners>
     <examiner>Schnoor</examiner>
     <examiner>Kliemann</examiner>
</examiners>
  </examiners>
   <file>informationssysteme_nebenfach_sose2013.pdf</file>
   <file>Inf-Math-C_22-23_Klausur1.pdf</file>
</log>
</log>
    <log>
      <date>2023</date>
      <reading>Informationsmanagement</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>IMSS23-Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Informationsmanagement</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>IMSS23-Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Algorithms on Sequences</reading>
      <extra>2. Termin + Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Fleischmann</examiner>
      </examiners>
      <file>AoS2023-2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Theoretische Grundlagen der Informatik</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>TGISS23-Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Theoretische Grundlagen der Informatik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>TGISS23-Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Informationsmanagement</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>IMSS23-Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Informationsmanagement</reading>
      <extra>Probeklausur</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kulczynski</examiner>
      </examiners>
      <file>IMSS23-Probe.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>EERPSS23-Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>EERPSS23-Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Softwaretechnik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>Inf-ST_23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Objektorientierte Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Slawig</examiner>
      </examiners>
      <file>InfProgOO-01a_23_Klausur1.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2023</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
      <reading>Einführung in die Algorithmik</reading>
  <type>schriftlich</type>
      <extra>1. Termin - mängelexemplar</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Huch</examiner>
  <file>Logik_Informatik_2013_1.pdf</file>
      </examiners>
</log>
      <file>InfEAlg-01a_23_Klausur1_maengelexemplar.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Einführung in die Algorithmik</reading>
      <extra>1. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>InfEAlg-01a_23_Klausur1_ungeloest.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Internet of Things and Wireless Networks</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Landsiedel</examiner>
      </examiners>
      <file>InfIoT-01a_23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Computer Networks</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Landsiedel</examiner>
      </examiners>
      <file>Computer_Networks_2023_PZ1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Einführung in die Algorithmik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>InfEAlg-01a_2023_PZ1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Database Systems</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kröger</examiner>
      </examiners>
      <file>DBS_2023_1PZ_Kroeger.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Einführung in die Algorithmik</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>InfEAlg-01a_22_Klausur2.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Objektorientierte Programmierung</reading>
      <extra>2. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Slawig</examiner>
      </examiners>
      <file>InfProgOO-01a_22-Klausur2_ungeloest.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Objektorientierte Programmierung</reading>
      <extra>1. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Slawig</examiner>
      </examiners>
      <file>InfProgOO-01a_22-Klausur1_ungeloest.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin - gelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>InfERP-01a_22_Klausur1_geloest.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>InfEERP-01a_22_Klausur1.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Operating Systems</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Tomforde</examiner>
      </examiners>
      <file>OS_Altklausur_WiSe2022-23.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>InfEERP-01a_22_Klausur2.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Data Science</reading>
      <extra>1. Termin</extra>
      <type>schriftlich/online</type>
      <examiners>
        <examiner>Renz</examiner>
      </examiners>
      <file>InfDaSci-01a_21-22_Klausur1.png</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Hochleistungsrechnen</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Börm</examiner>
      </examiners>
      <file>Gedaechnisprotokoll_infHPC_22_23_PZ1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Computersysteme</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Inf-CompSys_22-23_Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Deklarative Programmierung</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>InfDP-01a_22-23_Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Big Data Management and Analytics</reading>
      <extra>Probeklausur - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kröger</examiner>
      </examiners>
      <file>InfBDMaA-01a_22-23_Probeklausur_loesung.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Big Data Management and Analytics</reading>
      <extra>Probeklausur</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kröger</examiner>
      </examiners>
      <file>InfBDMA-01a_22-23_Probeklausur.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_20_Klausur2.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_20_Klausur1.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>2. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_20_Klausur2_loesung.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_20_Klausur1_loesung.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>2. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_19_Klausur2_loesung.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-B_19_Klausur1_loesung.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Mathematik für die Informatik C</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>Klausurersatzleistung</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>Inf-Math-C_21-22_Klausurersatzleistung_loesung.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Mathematik für die Informatik C</reading>
      <extra>1. Termin</extra>
      <type>Klausurersatzleistung</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>Inf-Math-C_21-22_Klausurersatzleistung.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Informationssysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kröger</examiner>
      </examiners>
      <file>Inf-IS_21-22_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Informatikrecht</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Lindhorst</examiner>
      </examiners>
      <file>Inf-InfRecht_22-23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Informatikrecht</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Lindhorst</examiner>
      </examiners>
      <file>Inf-InfRecht_21-22_Klausur1.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Betriebs- und Kommunikationssysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Landsiedel</examiner>
      </examiners>
      <file>Inf-BSKS_20_Klausur1.pdf</file>
    </log>
    <log>
      <date>2021</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_21_Klausur1_loesung.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_20_Klausur2_loesung.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_20_Klausur2.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_20_Klausur1_loesung.pdf</file>
    </log>
    <log>
      <date>2020</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_20_Klausur1.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_19_Klausur2_loesung.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_19_Klausur1_loesung.pdf</file>
    </log>
    <log>
      <date>2018</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_18_Klausur1.pdf</file>
    </log>
    <log>
      <date>2018</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Inf-ADS_18_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Mathematik für die Informatik A</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Inf-Math-A_22-23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Data Science</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Renz</examiner>
      </examiners>
      <file>InfDaSci-01a_22-23_Klausur2.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Data Science</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Renz</examiner>
      </examiners>
      <file>InfDaSci-01a_22-23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Mathematik für die Informatik C</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Kliemann</examiner>
      </examiners>
      <file>MatheCWS22_23_PZ1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Computersysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Inf-CompSys_22-23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Deklarative Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>InfDP-01a_22-23_Klausur1.pdf</file>
    </log>
    <log>
      <date>2023</date>
      <reading>Einführung in die Informatik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Mühling</examiner>
      </examiners>
      <file>InfEInf-01a_ws2223_klausur-1.pdf</file>
    </log>
    <log>
      <date>2021</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>2. Termin</extra>
      <type>schriftlich/online</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Inf-FortProg_20-21_Klausur2.pdf</file>
    </log>
    <log>
      <date>2021</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich/online</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Inf-FortProg_20-21_Klausur1.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>2. Termin</extra>
      <type>schriftlich/online</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Inf-FortProg_21-22_Klausur2.zip</file>
    </log>
     <log>
      <date>2022</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich/online</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Inf-FortProg_21-22_Klausur1.zip</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Softwaretechnik</reading>
      <extra>1. Termin - Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>Klausur-SWT-2022-pz-1-mit-loesung-und-korrekturhinweisen.pdf</file>
    </log>


    <log>
      <date>2021</date>
      <reading>Softwaretechnik</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>Klausur-SWT-2021-pz-2.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2021</date>
  <reading>Betriebssysteme (2. Termin)</reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>luttenberger_betriebssysteme_2013_2Termin.pdf</file>
      </examiners>
</log>
      <file>Klausur-SWT-2021-pz-1.pdf</file>
    </log>
 
    <log>
      <date>2022</date>
      <reading>Einführung in die Informatik</reading>
      <extra>1. Termin - Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Mühling</examiner>
      </examiners>
      <file>EinfInf2122_Klausur1.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2022</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
      <reading>Datenschutz</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich/online</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>ULD</examiner>
  <file>matheC_2013_2Termin.pdf</file>
      </examiners>
</log>
      <file>Datenschutzrecht_I_2022_Klausur_zensiert.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2022</date>
  <reading>Betriebssysteme (1. Termin)</reading>
      <reading>Complexity Theory</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>BS_Klausur_WS2013_P1.pdf</file>
      </examiners>
</log>
      <file>compltheo_wilke_ss22_pz2.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Complexity Theory</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>compltheo_wilke_ss22_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2022</date>
  <reading>Softwaretechnik (1. Termin)</reading>
      <reading>Fortgeschrittene Logik</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Nowotka</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>SWT_Klausur_WS2013_P1.pdf</file>
      </examiners>
</log>
      <file>fortlog_wilke_ss22_pz2.pdf</file>
    </log>
    <log>
      <date>2022</date>
      <reading>Fortgeschrittene Logik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>fortlog_wilke_ss22_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2022</date>
  <reading>Iterative Verfahren für große Gleichungssysteme</reading>
      <reading>Algorithms on Sequences</reading>
  <type>mündlich</type>
      <extra>1. Termin + Musterlösung</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Börm</examiner>  
      <examiners>
</examiners>
        <examiner>Fleischmann</examiner>
  <file>Boerm_Iterative_2013.pdf</file>
      </examiners>
</log>
      <file>AlgorithmsOnSequencesKlausur2022_1.pdf</file>
    </log>


    <log>
      <date>2022</date>
      <reading>Algorithms on Sequences</reading>
      <extra>Probeklausur + Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Fleischmann</examiner>
      </examiners>
      <file>AlgorithmsOnSequencesProbeKlausur2022.pdf</file>
    </log>


<log>
  <date>2013</date>
  <reading>Nebenläufige und verteilte Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Huch</examiner>   
</examiners>
  <file>Huch_NVP_2013.pdf</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2022</date>
  <reading>Logik für Informatiker (2. Termin)</reading>
      <reading>Computer Networks</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Landsiedel</examiner>
  <file>Logik_Informatiker_2012_21.pdf</file>
      </examiners>
</log>
      <file>ComputerNetworks_2022S_ZR1.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2022</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>1. Termin - Korrekturhinweise</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Langfeld</examiner>
  <file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum2.pdf
      </examiners>
</file>
      <file>2022S_MatheB_K1_Musterlösung.pdf</file>
</log>
    </log>


    <log>
      <date>2022</date>
      <reading>Einführung in die Algorithmik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>EAlgo_SS22_PZ1.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2022</date>
  <reading>Informatik III (1. Termin)</reading>
      <reading>Objektorientierte Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hasselbring</examiner>
      <examiners>
</examiners>
        <examiner>Slawig</examiner>
  <file>2008_ws_informatik_3_schriftlich_hasselbring_zeitraum1.pdf</file>
      </examiners>
</log>
      <file>ProgOO_SS22_PZ1.pdf</file>
    </log>


<log>
  <date>2008</date>
  <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>2008_ss_informatik_2_schriftlich_wilke_zeitraum1.pdf</file>
</log>


<log>
    <log>
  <date>2005</date>
      <date>2022</date>
  <reading>Digitale Systeme</reading>
      <reading>Einführung in die Wirtschaftsinformatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich/online</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Koschmider</examiner>
  <file>Schimmler_Inf_DigitaleSysteme_2005.pdf</file>
      </examiners>
</log>
      <file>WInf_22_PZ1.zip</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2022</date>
  <reading>Digitale Systeme (2. Termin)</reading>
      <reading>Einführung in die Informatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin unvollständig</extra>
  <examiners>
      <type>schriftlich/online</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Mühling</examiner>
  <file>Schimmler_SysInfI_20102.pdf</file>
      </examiners>
</log>
      <file>InfEinf_22_PZ1_unvollständig.zip</file>
    </log>


    <log>
      <date>2022</date>
      <reading>Einführung in die Informatik</reading>
      <extra>Probleklausur + Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Mühling</examiner>
      </examiners>
      <file>EinfInf2122_Probeklausur.pdf</file>
    </log>


<log>
  <date>2005</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_Inf_DigitaleSysteme_2005.pdf</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Programmierung (Übungsklausur)</reading>
      <reading>Knowledge Discovery and Data Mining </reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>Open Book Klausur</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Renz</examiner>
  <file>UebungsklausurProgrammierung2012.pdf</file>
      </examiners>
</log>
      <file>KDDM_Klausur_WS21-22_PZ1.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Programmierung</reading>
      <reading>Mathematik für die Informatik C </reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>Take Home Klausur</type>
     <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Braack</examiner>
  <file>Hanus_Programmierung2012.pdf</file>
      </examiners>
</log>
      <file>MatheCWS20-21_1.pdf</file>
     </log>
 
    <log>
      <date>2021</date>
      <reading>Mathematik für die Informatik C </reading>
      <extra>2. Termin</extra>
      <type>Take Home Klausur</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>MatheCWS20-21_2.pdf</file>
    </log>




<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Digitale Systeme (2. Termin)</reading>
      <reading>IT-Recht</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Lindhorst</examiner>
  <file>Schimmler_SysInfI_20102.pdf</file>
      </examiners>
</log>
      <file>IT-Recht_Klausur_1_SS21.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum1.pdf
</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Betriebssysteme (1. Termin)</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Langfeld</examiner>
  <file>Betriebssysteme_WS11-12(1.Termin).pdf</file>
      </examiners>
</log>
      <file>Langfeld_Mathe_B_SoSe21_1-fixed.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra>1. Termin - gelöst</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Jansen</examiner>
  <file>Logik_SS12(1.Termin).pdf</file>
      </examiners>
</log>
      <file>ADS_Klausur_1_SS21.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>1. Termin - ungelöst</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>    
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Hasselbring_SEPVS_2012.pdf</file>
      </examiners>
</log>
      <file>ADS_Klausur_1_SS21-unsolved.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner>   
</examiners>
  <file>Hanus_PPS_2012.pdf</file>
</log>


    <log>
      <date>2021</date>
      <reading>Einführung von ERP Systemen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Gottschalk</examiner>
      </examiners>
      <file>Einführung_ERP_2021_1.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Organisation und Archtitektur von Rechnern (1. Termin)</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>Probleklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
  </examiners>
        <examiner>Renz</examiner>
  <file>OAR-Klausur-SoSe2012Hanxleden.pdf</file>
      </examiners>
</log>
      <file>Informationssysteme_Probeklausur_WS19-20.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Kommunikatonssysteme (2. Termin)</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>Probleklausur - Lösung</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Renz</examiner>
  <file>Kommunikationssysteme_Klausurtermin2_SS2012.pdf</file>
      </examiners>
</log>
      <file>Informationssysteme_Probeklausur_WS19-20_-_Musterlösung.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner> 
</examiners>
  <file>FortProg _2Termin_SS2012.pdf</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Informatik I</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>ADS_SoSe_2012_Versuch_1.pdf</file>
      </examiners>
</log>
      <file>Informatik_I_WS18-19_PZI.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Fortgeschrittene Programmierung</reading>
      <reading>Programmiertechniken</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
</examiners>
        <examiner>Huch</examiner>
  <file>Hanus_FortProg_2012.pdf</file>
      </examiners>
</log>
      <file>Programmiertechniken_SS19_PZI.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Modellierung nebenläufiger Systeme</reading>
      <reading>Computersysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
</examiners>
        <examiner>Koch</examiner>
  <file>mcs.pdf</file>
      </examiners>
</log>
      <file>Computersysteme_WS20-21_PZII.pdf</file>
    </log>


<log>
    <!--
  <date>2012</date>
Die will Koch nicht online haben
  <reading>Kommunikatonssysteme (1. Termin)</reading>
    <log>
  <type>schriftlich</type>
      <date>2021</date>
  <examiners>
      <reading>Computersysteme</reading>
    <examiner>Luttenberger</examiner>
      <extra>2. Termin - Lösung 1</extra>
</examiners>
      <type>schriftlich</type>
  <file>Kommunikationssysteme_Klausurtermin1_SS2012.pdf</file>
      <examiners>
</log>
        <examiner>Koch</examiner>
      </examiners>
      <file>Computersysteme_WS20-21_PZII_-_Musterlösung_Aufgabe_1.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Binäre Entscheidungsdiagramme</reading>
      <reading>Computersysteme</reading>
  <type>mündlich</type>
      <extra>2. Termin - Lösung 2</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Berghammer</examiner>    
      <examiners>
</examiners>
        <examiner>Koch</examiner>
  <file>bdd_pruefung_2012.pdf</file>
      </examiners>
</log>
      <file>Computersysteme_WS20-21_PZII_-_Musterlösung_Aufgabe_2.pdf</file>
    </log>
-->


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
      <reading>Informatik 1</reading>
  <type>mündlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>    
      <examiners>
</examiners>
        <examiner>Huch</examiner>
  <file>SEPVS_Pruefung_2012.pdf</file>
      </examiners>
</log>
      <file>Informatik_I_Probeklausur_WS18-19.pdf</file>
    </log>
 
    <log>
      <date>2020</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>2. Termin - Musterlösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Fortgeschrittene_Programmierkonzepte_WS19-20_PZII.pdf</file>
    </log>
 
    <log>
      <date>2021</date>
      <reading>Mathematik für die Informatik A</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Klein</examiner>
      </examiners>
      <file>MatheA-WiSe20-21-PZ2.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
</examiners>
        <examiner>Renz</examiner>
  <file>FortProg_SS2012.pdf</file>
      </examiners>
</log>
      <file>Klausur_Infsys_1920.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2021</date>
  <reading>DSW</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich/online</type>
    <examiner>Srivastav</examiner>
      <examiners>
  </examiners>
        <examiner>Renz</examiner>
  <file>dsw-infmath4-2010-srivastav-1.pdf</file>
      </examiners>
</log>
      <file>Klausur_Inf-IS_WS20_21.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>Internet Communications</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>intcom-2011-luttenberger-1.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
      <date>2021</date>
  <reading>Multimediale Informationsverarbeitung</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich/online</type>
    <examiner>Koch</examiner>
      <examiners>
  </examiners>
        <examiner>Renz</examiner>
  <file>multinf-2011-koch-1.pdf</file>
      </examiners>
</log>
      <file>InfSys_Lösungsreduziert-2021.png</file>
    </log>


<log>
  <date>2010</date>
  <reading>Logik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Spinas</examiner>
  </examiners>
  <file>logik-infmath3-2010-spinas-1.pdf</file>
</log>


<log>
    <log>
  <date>2010</date>
      <date>2021</date>
  <reading>Betriebssysteme</reading>
      <reading>Deklarative Programmiersprachen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>bs-sysinf3-2010-luttenberger-1.pdf</file>
      </examiners>
</log>
      <file>DPS-protokoll-2021.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2021</date>
  <reading>Automaten, Logiken und Spiele</reading>
      <reading>Mathematik für die Informatik A</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>     
      <examiners>
</examiners>
        <examiner>Klein</examiner>
  <file>wilke_als_ws11-12.pdf</file>
      </examiners>
</log>
      <file>Mathe_A_PZ1_2021.pdf</file>
     </log>
 
    <log>
      <date>2020</date>
      <reading>Internet of Things and Wireless Networks</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Landsiedel</examiner>
      </examiners>
      <file>IOT_Klausur_2020_PZ2.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2020</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
      <reading>Methoden der Effizienten Ähnlichkeitssuche in großen Datenbeständen</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Srivastav</examiner>  
      <examiners>
</examiners>
        <examiner>Renz</examiner>
  <file>mathe_A_klausur_2.pdf</file>
      </examiners>
</log>
      <file>Effiziente_suche.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2020</date>
  <reading>Digitale Systeme</reading>
      <reading>Synchronous Languages</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Schimmler</examiner>  
      <examiners>
</examiners>
        <examiner>von Hanxleden</examiner>
  <file>DigiSysWS2010_11.pdf</file>
      </examiners>
</log>
      <file>SyncSpr-SoSe2020-PZ1.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Braack</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Mathematik_fuer_Informatiker_C_WS2011_12_Klausurenzeitraum_2.pdf</file>
      </examiners>
</log>
      <file>AdsSS20191PZ.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2020</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
      <reading>Mathematik für die Informatik C</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Srivastav</examiner>  
      <examiners>
</examiners>
        <examiner>Srivastav</examiner>
  <file>mathe_A_klausur_1.pdf</file>
      </examiners>
</log>
      <file>MatheCWS19_20_1PZ.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Semantik von Programmiersprachen, Synchrone Sprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Berghammer</examiner>   
<examiner>von Hanxleden</examiner> 
</examiners>
  <file>D_SemVonProg_SynchSpra_032012.pdf</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Digitale Systeme</reading>
      <reading>Einführung in Operations Research</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Schimmler</examiner>  
      <examiners>
</examiners>
        <examiner>Slawig</examiner>
  <file>DigisysKlausur_2012.pdf</file>
      </examiners>
</log>
      <file>Op_research.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Digitale Systeme, Datenbanken</reading>
      <reading>Distributed Systems</reading>
  <type>mündlich</type>
      <extra>2. Termin - ungelöst</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Schimmler</examiner>  
      <examiners>
<examiner>Klein</examiner>  
        <examiner>Landsiedel</examiner>
</examiners>
      </examiners>
  <file>VD_Digitale_Systeme_und_Datenbanken022012.pdf</file>
      <file>Exam_Distributed_Systems_WS1920.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2020</date>
  <reading>Programmierung, Softwaretechnik</reading>
      <reading>Mathematik für die Informatik A</reading>
  <type>mündlich</type>
      <extra>2. Termin - gelöst</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>     
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>VD_Programmierung_und_SWT022012.pdf</file>
      </examiners>
</log>
      <file>MatheA_Langfeld_19-20W_1PZ.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>2. Termin - gelöst</extra>
      <type>schriftlich</type>
      <examiners>
      </examiners>
      <file>Mathe_B_19-20-Gelöst-2.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Mathematik für die Informatik B</reading>
      <extra>2. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
      </examiners>
      <file>Mathe_B_19-20-Ungelöst-2.pdf</file>
     </log>
    <log>
      <date>2019</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin - ungelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>ADS_19-20-Ungelöst.pdf</file>
    </log>
    <log>
      <date>2019</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>2. Termin - gelöst</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>ADS_19-20-Gelöst.pdf</file>


<log>
    </log>
  <date>2012</date>
    <log>
  <reading>Software-Architektur</reading>
      <date>2019</date>
  <type>mündlich</type>
      <reading>Softwaretechnik</reading>
  <examiners>
      <extra>1. Termin - ausgefüllt</extra>
<examiner>Hasselbring</examiner>  
      <type>schriftlich</type>
</examiners>
      <examiners>
  <file>Pruefungsprotokoll-SoftArch-WS-2011-2012.pdf</file>
        <examiner>Schnoor</examiner>
</log>
      </examiners>
      <file>Softwaretechnik-SS19-1PZ-ohne-Name.pdf</file>
    </log>
 
    <log>
      <date>2019</date>
      <reading>Softwaretechnik</reading>
      <extra>1. Termin - unausgefüllt</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Schnoor</examiner>
      </examiners>
      <file>Softwaretechnik-SS19-1PZ-ohne-Name-ungelöst.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Mathematik für Informatiker I und II</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Braack</examiner>   
</examiners>
  <file>VD_Mathe_fuer_Informatiker022012.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>1. Termin - ausgefüllt</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Jansen</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>Jansen_Algorithmen_und_Datenstrukturen2011.pdf</file>
      </examiners>
</log>
      <file>Mathematik-für-die-Informatik-B-SS19-1PZ-ohne-Name.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Software-Architektur</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>mündlich</type>
      <extra>1. Termin - unausgefüllt</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>PruefungsprotokollSoftArch032012.pdf</file>
      </examiners>
</log>
      <file>Mathematik-für-die-Informatik-B-SS19-1PZ-ohne-Name-ungelöst.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2019</date>
  <reading>Synchrone Sprachen</reading>
      <reading>Betriebs- und Kommunikationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin - ausgefüllt</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>von Hanxleden</examiner>  
      <examiners>
</examiners>
        <examiner>Landsiedel</examiner>
  <file>SynchroneSprachenKlausurWS 20112012.pdf</file>
      </examiners>
</log>
      <file>Betriebs-und-Kommunikationssysteme-SS19-1PZ-ohne-Name.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Hanus</examiner>   
</examiners>
  <file>Programmierung2012.pdf</file>
</log>


<log>
    <log>
  <date>2012</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>2. Termin - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Braack</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>MatheC2012.pdf</file>
      </examiners>
</log>
      <file>mathe-b_langfeld_ss16_pz2_loes.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
      <date>2016</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>1. Termin - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>TheoretischeGrundlagenDerInformatik2012.pdf</file>
      </examiners>
</log>
      <file>mathe-b_langfeld_ss16_pz1_loes.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2016</date>
  <reading>Logik in der Informatik (2. Termin)</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>LogikInDerInformartik_Wilke_2011_2.Prüfungszeitraum.pdf</file>
      </examiners>
</log>
      <file>mathe-b_langfeld_ss16_pz2.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2016</date>
  <reading>Softwaretechnik</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>SWT_Klausur_2010.pdf</file>
      </examiners>
</log>
      <file>mathe-b_langfeld_ss16_pz1.pdf</file>
    </log>
 
    <log>
      <date>2019</date>
      <reading>Mathematik für die Informatik A</reading>
      <extra>Probeklausur - Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>mathe-a_langfeld_ws1819_probe_loes.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Grundlagen der Theoretischen Informatik - Zwischenklausur</reading>
      <reading>Mathematik für die Informatik A</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>TGI_Midsemester_WS1112.pdf</file>
      </examiners>
</log>
      <file>mathe-a_langfeld_ws1819_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Ordnungen und Verbände, Automaten, Logiken, Spiele</reading>
      <reading>Mathematik für die Informatik A</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
<examiner>Berghammer</examiner>  
        <examiner>Langfeld</examiner>
</examiners>
      </examiners>
  <file>Wilke_Berghammer_Ordnung_Automaten_2011.pdf</file>
      <file>mathe-a_langfeld_ws1819_pz1.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
      <reading>Betriebs- und Kommunikationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Huch</examiner>
      <examiners>
</examiners>
        <examiner>Landsiedel</examiner>
  <file>fortgeschrittene_programmierung_2011.pdf</file>
      </examiners>
</log>
      <file>bsks_landsiedel_ss19_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Logik für Informatiker</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>Probeklausur - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Wilke_Logik_2011.pdf</file>
      </examiners>
</log>
      <file>ads_jansen_ss19_probe_loes.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Softwaretechnik</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>protokoll_diplom_vertiefung_2011_softwaretechnik.pdf</file>
      </examiners>
</log>
      <file>ads_jansen_ss19_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2018</date>
  <reading>Semantik von Programmiersprachen, Effiziente Algorithmen</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>2. Termin - mit Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Berghammer</examiner>  
      <examiners>
<examiner>Jansen</examiner>
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>Berghammer_Jansen_D_Semantik_EffAlg_2011.pdf</file>
      <file>ads_jansen_ss18_pz2_loes.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2018</date>
  <reading>Logik für Informatiker</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>1. Termin - mit Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>  
      <examiners>
<examiner>Berghammer</examiner>  
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>Logik_Protokoll_SS2011.pdf</file>
      <file>ads_jansen_ss18_pz1_loes.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2017</date>
  <reading>Organisation und Architektur von Rechnern</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Luttenberger</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>klausur_oar_ss11_v1.pdf</file>
      </examiners>
</log>
      <file>ads_jansen_ss17_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2016</date>
  <reading>Nebenläufige und verteilte Programmierung, Funktioniale Programmierung</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Huch</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Huch_neb_vert_funkt_Programmierung_062011.pdf</file>
      </examiners>
</log>
      <file>ads_jansen_ss16_pz2.pdf</file>
    </log>
 
    <log>
      <date>2019</date>
      <reading>Datenschutz</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>ULD</examiner>
      </examiners>
      <file>datenschutz_uld_ws1819_pz2.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2017</date>
  <reading>Softwareentwicklung für Parallele und Verteilte Systeme</reading>
      <reading>Mathematik für die Informatik B</reading>
  <type>mündlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hasselbring</examiner>  
      <examiners>
</examiners>
        <examiner>Hellwig</examiner>
  <file>protokoll_diplom_vertiefung_2011_sepvs.pdf</file>
      </examiners>
</log>
      <file>mathe_b_hellwig_ss17_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2013</date>
  <reading>Informationssysteme</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>IS_Klausur_SS2011.pdf</file>
      </examiners>
</log>
      <file>TheoInf121321.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>Logik in der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner> 
</examiners>
  <file>Logik_Klausur_SS11.pdf</file>
</log>


<log>
    <log>
  <date>2006</date>
      <date>2019</date>
  <reading>Computer Networks and Internetworking</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>cn_klausur06.pdf</file>
      </examiners>
</log>
      <file>fortprog_hanus_ws1819_probe.pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>Computer Networks and Internetworking</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>cn_klausur07.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
      <date>2019</date>
  <reading>Computer Networks and Internetworking</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Renz</examiner>
  <file>cn_klausur08.pdf</file>
      </examiners>
</log>
      <file>infsys_renz_ws1819_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Rechnergestützter Entwurf digitaler Systeme</reading>
      <reading>Informationssysteme</reading>
  <type>mündlich</type>
      <extra>1. Termin - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Schimmler</examiner>  
      <examiners>
</examiners>
        <examiner>Renz</examiner>
  <file>Schimmler_ReDigiSys_0711.pdf</file>
      </examiners>
</log>
      <file>infsys_renz_ws1819_pz1_lsg.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2015</date>
  <reading>Informationssysteme</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>IS_Klausur_SS2010.pdf</file>
      </examiners>
</log>
      <file>Programmierung-Klausur_2014_2015.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2013</date>
  <reading>Organisation und Architektur von Rechnern</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>mündlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>OAR_Klausur.pdf</file>
      </examiners>
</log>
      <file>MatheC_WiSe1213_Klausur1.pdf</file>
    </log>
 
    <log>
      <date>2009</date>
      <reading>Theoretische Informatik</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Jansen Inf TheoretischeInformatik 2009.PDF</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2008</date>
  <reading>Übersetzerbau, Semantik von Programmiersprachen</reading>
      <reading>Theoretische Informatik</reading>
  <type>mündlich</type>
      <extra>Nachschreibklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>
      <examiners>
<examiner>Berghammer</examiner>
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>Hanus_Berghammer_Compiler_Semantik022011.pdf</file>
      <file>Jansen Inf TheoretischeInformatikNachschreiber 2008.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2008</date>
  <reading>Funktionale Programmierung, Internet Communications</reading>
      <reading>Effiziente Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Huch</examiner>
      <examiners>
<examiner>Luttenberger</examiner>
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>Huch_Luttenberger_FunktProg_IC.pdf</file>
      <file>Jansen Inf EffizienteAlgorithmen 2008.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2008</date>
  <reading>Künstliche Intelligenz</reading>
      <reading>Theoretische Informatik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Salski</examiner>  
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Salski_KI_0711.pdf</file>
      </examiners>
</log>
      <file>Jansen Inf TheoretischeInformatik 2008.pdf</file>
    </log>


    <log>
      <date>2006</date>
      <reading>Approximative Algorithmen</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Jansen</examiner>
      </examiners>
      <file>Jansen Inf ApproximativeAlgorithmen 2006.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2007</date>
  <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
      <reading>Approximative Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>
      <examiners>
<examiner>Huch</examiner>
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>Prüfungsprotokoll_PPS_NVS_230211.pdf</file>
      <file>Jansen Inf ApproximativeAlgorithmen 2007.pdf</file>
</log>
    </log>


<log>
  <date>2008</date>
  <reading>Internet Communication, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Luttenberger</examiner> 
</examiners>
  <file>Prüfungsprotokoll_Luttenberger_IC_CN_040908.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
      <date>2008</date>
  <reading>Übersetzerbau, Entwurf eingebetteter Echtzeitsysteme</reading>
      <reading>Betriebssysteme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>
      <examiners>
<examiner>von Hanxleden</examiner>
        <examiner>von Hanxleden</examiner>
</examiners>
      </examiners>
  <file>Prüfungsprotokoll_vHanxleden_Hanus_I.pdf</file>
      <file>VonHanxleden Inf Betriebssysteme 2008.pdf</file>
</log>
    </log>




<log>
    <log>
  <date>2011</date>
      <date>2007</date>
  <reading>Programmierung</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>INF1_WS1011.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf AlgorithmenDatenstrukturen 2007.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2009</date>
  <reading>Informatik III</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hasselbring</examiner>
      <examiners>
</examiners>
        <examiner>von Hanxleden</examiner>
  <file>InfoIII_WS_09_10.pdf</file>
      </examiners>
</log>
      <file>VonHanxleden InformatikII Sose2009.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2005</date>
  <reading>Information Systems Analysis Design and Developement</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Thalheim</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>ISADD.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf AlgorithmenDatenstrukturen 2005.pdf</file>
    </log>
 
    <log>
      <date>2002</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke Inf AlgorithmenDatenstrukturen 2002.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2008</date>
  <reading>Datenbanktechnologie</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>Probleklausur</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Klein</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>Klein_Datenbanktechnologie_022011.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf AlgorithmenDatenstrukturenProbeklausur 2008.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2007</date>
  <reading>Betriebssysteme</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra>Nachschreibklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>BS_KlausurWS1011.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf AlgorithmenDatenstrukturenNachschreiber 2007.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2009</date>
  <reading>Mathematik für Informatiker 1 (1. Termin)</reading>
      <reading>Logik für Informatiker</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Bergweiler</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>Bergweiler_Inf_Mathe1_2008.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf MathematikfuerInformatikerIII Logik 2009.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2005</date>
  <reading>Betriebssysteme (2. Termin) 10. Seite </reading>
      <reading>Kryptographie</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>SysInfIIIBS10.pdf</file>
      </examiners>
</log>
      <file>Wilke Inf Kryptographie 2005.pdf</file>
    </log>


    <log>
      <date>2009</date>
      <reading>Logik für Informatiker</reading>
      <extra>Nachschreibklausur</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke Mathematik fuer Informatiker III Nachholklausur 2009.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2004</date>
  <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
      <reading>Theoretische Informatik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>
      <examiners>
<examiner>Huch</examiner>
        <examiner>Wilke</examiner>
</examiners>
      </examiners>
  <file>Huch_D_NVP_Hanus_D_PPS_Dez2010.pdf</file>
      <file>Wilke Inf TheoretischeInformatik 2004.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2010</date>
  <reading>Qualitätssicherungsmanagement, Generative Software-Entwicklung</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Speck</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Speck_D_QSM_GSE_Feb2011.pdf</file>
      </examiners>
</log>
      <file>Alg_Dat_2010.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2011</date>
  <reading>Betriebssysteme (2. Termin) 7. Seite </reading>
      <reading>Qualitätsmanagement</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Speck</examiner>
  <file>SysInfIIIBS7.pdf</file>
      </examiners>
</log>
      <file>Qualitätsmanagement.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2011</date>
  <reading>Betriebssysteme (2. Termin) 8. Seite </reading>
      <reading>IT-Sicherheit</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>SysInfIIIBS8.pdf</file>
      </examiners>
</log>
      <file>protokoll_itsec.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2011</date>
  <reading>Betriebssysteme (2. Termin) 9. Seite </reading>
      <reading>Informations- und Wissensmanagement</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Tochtermann</examiner>
  <file>SysInfIIIBS9.pdf</file>
      </examiners>
</log>
      <file>Informations-_und_Wissensmanagement.pdf</file>
    </log>
 
    <log>
      <date>2011</date>
      <reading>Mathematik für Informatiker A</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Berghammer</examiner>
      </examiners>
      <file>Berghammer math a ws1011 nachschreibe.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2014</date>
  <reading>Betriebssysteme (2. Termin) 4. Seite </reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Nowotka</examiner>
  <file>SysInfIIIBS4.pdf</file>
      </examiners>
</log>
      <file>Softwaretechnik 18.2.14.pdf</file>
    </log>


    <log>
      <date>2014</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Börm</examiner>
      </examiners>
      <file>Informatik ADS Börm 2014.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2014</date>
  <reading>Betriebssysteme (2. Termin) 5. Seite </reading>
      <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Luttenberger</examiner>
  <file>SysInfIIIBS5.pdf</file>
      </examiners>
</log>
      <file>Betriebssysteme 11.2.14.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2013</date>
  <reading>Betriebssysteme (2. Termin) 6. Seite </reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>SysInfIIIBS6.pdf</file>
      </examiners>
</log>
      <file>TheoInf12131.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2014</date>
  <reading>Betriebssysteme (2. Termin) 1. Seite </reading>
      <reading>Logik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Wilke</examiner>
  <file>SysInfIIIBS1.pdf</file>
      </examiners>
</log>
      <file>logik_klausur_termin1_lsg.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2013</date>
  <reading>Betriebssysteme (2. Termin) 2. Seite </reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>SysInfIIIBS2.pdf</file>
      </examiners>
</log>
      <file>2-Nachklausur_Fortgeschrittene_Programmierung_pdf_exercises.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2014</date>
  <reading>Betriebssysteme (2. Termin) 3. Seite </reading>
      <reading>Deklarative Programmiersprachen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>SysInfIIIBS3.pdf</file>
      </examiners>
</log>
      <file>DPS_Pruefung_072014.pdf</file>
    </log>


    <log>
      <date>2014</date>
      <reading>Deklarative Programmiersprachen</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Protokolldeklspr.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2014</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>klausur.pdf</file>
      </examiners>
</log>
      <file>MatheC_WS1314_Klausur2.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2014</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>klausur-nachschreib.pdf</file>
      </examiners>
</log>
      <file>MatheC-WS1314-2PZ.pdf</file>
    </log>




<log>
    <log>
  <date>2011</date>
      <date>2014</date>
  <reading>Logikprogrammierung, Kryptographie</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Hanus</examiner>
      <examiners>
<examiner>Wilke</examiner>
        <examiner>Langfeld</examiner>
</examiners>
      </examiners>
  <file>Hanus_Wilke_D_Logik_Krypto_2011.pdf</file>
      <file>MatheC_WS1314_Klausur1.pdf</file>
</log>
    </log>
 
    <log>
      <date>2014</date>
      <reading>Kommunikationssysteme</reading>
      <extra></extra>
      <type>schrftlich</type>
      <examiners>
        <examiner>Luttenberger</examiner>
      </examiners>
      <file>Kommunikationssysteme_Luttenberger_2.Termin_SS14.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2014</date>
  <reading>Generative Software-Entwicklung, Qualitätssicherungsmanagement</reading>
      <reading>Kryptographie</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Speck</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>d_speck_122010.pdf</file>
      </examiners>
</log>
      <file>Kryptographie 2014 2. Prüfungszeitraum.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2013</date>
  <reading>NVP, PrinzProg</reading>
      <reading>Compilerbau</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Huch</examiner>
      <examiners>
<examiner>Hanus</examiner>
        <examiner>Hanus</examiner>
</examiners>
      </examiners>
  <file>Huch_Hanus_D_NVP_PPS_2011.pdf</file>
      <file>Compilerbau-SS13.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2019</date>
  <reading>Synchrone Sprachen, Kryptographie</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
<examiner>Wilke</examiner>
        <examiner>Hanus</examiner>
</examiners>
      </examiners>
  <file>Prüfungsprotokoll_vHanxleden_Wilke.pdf</file>
      <file>fortprog_hanus_ws1819_pz1.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2018</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Srivastav</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>ws0910_matheA.pdf</file>
      </examiners>
</log>
      <file>fortprog_hanus_ws1718_pz2.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2019</date>
  <reading>Funktionale Programmierung</reading>
      <reading>Computersysteme</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Huch</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>FunktionaleProg-Huch-2010.pdf</file>
      </examiners>
</log>
      <file>CompSys2_Koch_1819.pdf</file>
    </log>


    <log>
      <date>2019</date>
      <reading>Computersysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Koch</examiner>
      </examiners>
      <file>Koch_Compsys_WS1819_1.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2018</date>
  <reading>Systemorientierte Informatik I</reading>
      <reading>Numerische Programmierung</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
<examiner>Schimmler</examiner>
      <examiners>
</examiners>
        <examiner>Börm</examiner>
  <file>Schimmler_SysInfI_2010.pdf</file>
      </examiners>
</log>
      <file>Numprog_SS18_boerm.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2018</date>
  <reading>Systemorientierte Informatik I (2. Termin)</reading>
      <reading>IT Recht</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Schimmler</examiner>
      <examiners>
</examiners>
        <examiner>Lindhorst</examiner>
  <file>Schimmler_SysInfI_20102.pdf</file>
      </examiners>
</log>
      <file>it-recht_lindhorst_ss18_pz1.pdf</file>
    </log>
 
    <log>
      <date>2018</date>
      <reading>Betriebs- und Kommunikationssysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Sandro Esquivel</examiner>
      </examiners>
      <file>BSKS_Klausur_SS_2018.1.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2018</date>
  <reading>Theoretische Informatatik, Logik</reading>
      <reading>Softwaretecknik</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Hasselbring</examiner>
  <file>Wilke_VD_InfIV_Logik022006.pdf</file>
      </examiners>
</log>
      <file>swt_hasselbring_ss18_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2010</date>
      <date>2017</date>
  <reading>Künstiche Intelligenz</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Simon</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Simon_Bsc_KI_022010.pdf</file>
      </examiners>
</log>
      <file>Ads_jansen_ss17_pz2.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2018</date>
  <reading>Theoretische Informatatik, Logik</reading>
      <reading>Computersysteme</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Schimmler</examiner>
  <file>Wilke_VD_InfoA_102005_2.pdf</file>
      </examiners>
</log>
      <file>Computersysteme_WS1718_2.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfA_022006.pdf</file>
</log>


<log>
    <log>
  <date>2005</date>
      <date>2014</date>
  <reading>Theoretische Informatatik, Logik</reading>
      <reading>Programmierung</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
<examiner>Wilke</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>Wilke_VD_InfA_102005.pdf</file>
      </examiners>
</log>
      <file>Klausur--Programmierung--2014-04-08.pdf</file>
    </log>


<log>
  <date>2008</date>
  <reading>Synchrone Sprachen (Testprüfung)</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Traulsen</examiner>
</examiners>
  <file>Traulsen_TestD_SynchroneSprachen_042008.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
      <date>2014</date>
  <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Simon</examiner>
      <examiners>
<examiner>Valkema</examiner>
        <examiner>Berghammer</examiner>
</examiners>
      </examiners>
  <file>Valkema_MAG_SystematischesProgrammieren_InformatikNebenfaechler_042008.pdf</file>
      <file>MathematikA_2014_1.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2014</date>
  <reading>Echzeitsysteme</reading>
      <reading>Programmierung</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>von Hanxleden</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>von_Hanxleden_D_Echtzeitsysteme_022007.pdf</file>
      </examiners>
</log>
      <file>Programmierung_2014_1.pdf</file>
    </log>
 
    <log>
      <date>2014</date>
      <reading>Graphentheorie</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Srivistav</examiner>
      </examiners>
      <file>srivastav_graphentheorie_2014_1.pdf</file>
    </log>
 
     <log>
      <date>2014</date>
      <reading>Mathematik für Informatiker A</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Berghammer</examiner>
      </examiners>
      <file>MatheA_WS1314_2PZ.pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_D_Echtzeitsysteme_102007.pdf</file>
</log>


<log>
    <log>
  <date>2009</date>
      <date>2013</date>
  <reading>Echzeitsysteme, Synchrone Sprachen</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>mündlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
</examiners>
        <examiner>Berghammer</examiner>
  <file>vonHanxleden_D_Echtzeitsysteme_SynchroneSprachen_072009.pdf</file>
      </examiners>
</log>
      <file>MaInf_A_PrKl_WS1314.pdf</file>
    </log>


    <log>
      <date>2013</date>
      <reading>Kommunikatiossysteme</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Luttenberger</examiner>
      </examiners>
      <file>Kommunikationssysteme_SoSe13_(erster_Zeitraum).pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>Kryptographie, Angewandte Automatentheorie</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_D_TheoInf.pdf</file>
</log>


<log>
    <log>
  <date>2004</date>
      <date>2013</date>
  <reading>Kombinatorische Optimierung</reading>
      <reading>Mathematik für Informatiker B</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Srivastav</examiner>  
      <examiners>
</examiners>
        <examiner>Langfeld</examiner>
  <file>Srivastav_D_Opt_102004.pdf</file>
      </examiners>
</log>
      <file>MatheB_SS_2013_1.pdf</file>
    </log>


<log>
    <log>
  <date>1999</date>
      <date>2013</date>
  <reading>Kombinatorische Optimierung</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Srivastav</examiner>  
      <examiners>
</examiners>
        <examiner>Börm</examiner>
  <file>Srivastav_D_Opt_alt_98-99.pdf</file>
      </examiners>
</log>
      <file>ADS_SS_2013_1.pdf</file>
    </log>


    <log>
      <date>2013</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Hanus_FortProg_2013_Termin1.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2013</date>
  <reading>eCommerce, Generative Programmierung</reading>
      <reading>Informationssysteme - Hauptfach</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Speck</examiner>  
      <examiners>
</examiners>
        <examiner>Schnoor</examiner>
  <file>Speck_D_ecommerce_genprog_082009.pdf</file>
      </examiners>
</log>
      <file>informationssyteme_hauptfach_sose2013.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2013</date>
  <reading>DSW, MfI2</reading>
      <reading>Nebenläufige und verteilte Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Srivastav</examiner>   
      <examiners>
  <examiner>Braack</examiner>  
        <examiner>Huch</examiner>
</examiners>
      </examiners>
  <file>Srivastav-Braack_VD_DSW-MfI2_092008.pdf</file>
      <file>Huch_NVP_2013.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2013</date>
  <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
      <reading>Betriebssysteme</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Simon</examiner>  
      <examiners>
  <examiner>Valkema</examiner>
        <examiner>Luttenberger</examiner>
</examiners>
      </examiners>
  <file>Simon_Valkema_Zertifikat_022007_02.pdf</file>
      <file>BS_Klausur_WS2013_P1.pdf</file>
</log>
    </log>


    <log>
      <date>2013</date>
      <reading>Softwaretechnik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Nowotka</examiner>
      </examiners>
      <file>SWT_Klausur_WS2013_P1.pdf</file>
    </log>


<log>
  <date>1991</date>
  <reading>Verschiedene</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Simon</examiner>   
</examiners>
  <file>Simon_D_Theo_alt_87-91.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
      <date>2013</date>
  <reading>Bildverarbeitung</reading>
      <reading>Informationssysteme - Nebenfach</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Sommer</examiner>  
      <examiners>
</examiners>
        <examiner>Schnoor</examiner>
  <file>Sommer_D_Bildverarbeitung_092008.pdf</file>
      </examiners>
</log>
      <file>informationssysteme_nebenfach_sose2013.pdf</file>
    </log>
 
    <log>
      <date>2016</date>
      <reading>Nebenläufige und verteilte Programmierung</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>prüfungsprotokoll nebenläufige und verteilte programmierung.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2016</date>
  <reading>Fuzzy, KI</reading>
      <reading>Softwaretechnik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Salski</examiner>
      <examiners>
</examiners>
        <examiner>Hasselbring</examiner>
  <file>Salski_D_Theo_072007.pdf</file>
      </examiners>
</log>
      <file>Softwaretechnik-Prüfungsprotokoll1516.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2016</date>
  <reading>SysInfI, SysInfIII</reading>
      <reading>Informationssysteme</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
<examiner>Luttenberger</examiner>
        <examiner>Thalheim</examiner>
</examiners>
      </examiners>
  <file>Schimmler_Luttenberger_VD_SysInfI_SysInfIII_102007.pdf</file>
      <file>InfSys_WS2015_Klausur.pdf</file>
</log>
    </log>


    <log>
      <date>2016</date>
      <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Entwurf eingebetteter Echtzeitsysteme _ WiSe 15_16 _ Zeitraum 1 _ Note 1,7.pdf</file>
    </log>


<log>
    <log>
  <date>1995</date>
      <date>2015</date>
  <reading>Logik</reading>
      <reading>Softwaretechnik</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Potthoff</examiner>
      <examiners>
</examiners>
        <examiner>Hasselbring</examiner>
  <file>Potthoff_D_Logik_alt_92-95.pdf</file>
      </examiners>
</log>
      <file>Softwaretechnik-Nachklausurneu.pdf</file>
    </log>


<log>
    <log>
  <date>1996</date>
      <date>2007</date>
  <reading>Logik</reading>
      <reading>Prinzipien von Programmiersprachen, Logikprogrammierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Potthoff</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>Potthoff_VD_InfA_alt_96.pdf</file>
      </examiners>
</log>
      <file>D_Hanus_Programmierung_032007.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2006</date>
  <reading>Computer Networks</reading>
      <reading>Prinzipien von Programmiersprachen und Funktionale Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>luttenberger_VD_rechnernetze_200507.pdf</file>
      </examiners>
</log>
      <file>DiplPruefungHanus.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2007</date>
  <reading>Internet Communications, Computer Networks</reading>
      <reading>Synchrone Sprachen, Internet Communication</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Luttenberger, von Hanxleden</examiner>
  <file>Luttenberger_D_Internet_Communications_CommunicationNetworks_042008.pdf
      </examiners>
</file>
      <file>D_Luttenberger_vonHanxleden_032007.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2008</date>
  <reading>Internet Communications, Computer Networks</reading>
      <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Luttenberger_D_Kommunikationssysteme_082006.pdf</file>
      </examiners>
</log>
      <file>Jansen_D_EffAlg_ApproxAlg_062008.pdf</file>
     </log>
 
    <log>
      <date>2009</date>
      <reading>Nebenläufige und verteilte Programmierung, Softwaretechnik</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Huch</examiner>
        <examiner>Goerigk</examiner>
      </examiners>
      <file>huch_goerigk_D_Nebprog_softtech_062009.pdf</file>
    </log>


<log>
  <date>2004</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_Prakt_102004.pdf</file>
</log>


<log>
    <log>
  <date>2009</date>
      <date>2004</date>
  <reading>Internet Communications, Computer Networks</reading>
      <reading>Übersetzerbau, Funktionale Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>Luttenberger_D_Rechnernetze_IC_2009.pdf</file>
      </examiners>
</log>
      <file>Hanus_D__PrakInf.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2007</date>
  <reading>Internet Communications, Computer Networks</reading>
      <reading>Deklarative Programmiersprachen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>Luttenberger_D_VerteilteSysteme-Rechnernetze_092007.pdf</file>
      </examiners>
</log>
      <file>Hanus_VL_DPS_082007.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
      <date>2006</date>
  <reading>Computer Graphik, Datenbanksysteme1</reading>
      <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Koch</examiner> 
      <examiners>
    <examiner>Klein</examiner>  
        <examiner>Jansen</examiner>
</examiners>
      </examiners>
  <file>KochKlein_D_Datenbanken-ComputerGraphik_092007.pdf</file>
      <file>Jansen_D_EffApprAlg_082006.pdf</file>
</log>
    </log>




<log>
    <log>
  <date>1994</date>
      <date>2004</date>
  <reading>Codierungstheorie</reading>
      <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Knüppel</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Knueppel_Alg_D_alt_94.pdf</file>
      </examiners>
</log>
      <file>Jansen_D_Theo_012004.pdf</file>
    </log>


<log>
    <log>
  <date>1999</date>
      <date>2004</date>
  <reading>Verschiedene (Diplom)</reading>
      <reading>Effiziente Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Kluge</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Kluge_D_Prakt_alt_86-99.pdf</file>
      </examiners>
</log>
      <file>Jansen_D_Theo_072004.pdf</file>
    </log>


<log>
    <log>
  <date>1994</date>
      <date>2004</date>
  <reading>Verschiedene (Vordiplom)</reading>
      <reading>Effiziente Algorithmen, Kryptographie</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Kluge</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Kluge_VD_InfB_alt_90-94.pdf</file>
      </examiners>
</log>
      <file>Jansen_D_Theo_102004.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
      <date>2009</date>
  <reading>Betriebssysteme, Abstrakte Maschinen</reading>
      <reading>Effiziente Algorithmen, Kombinatorische Optimierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Kluge</examiner>
      <examiners>
</examiners>
        <examiner>Jansen</examiner>
  <file>Kluge_D_Prakt_062002.pdf</file>
        <examiner>Srivastav</examiner>
</log>
      </examiners>
      <file>Jansen_Srivastav_D_EffizienteAlg_KombOpt_042009.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2006</date>
  <reading>Datenbanken, Betriebssysteme</reading>
      <reading>Effiziente Algorithmen, Kryptographie</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Klein</examiner>
      <examiners>
     <examiner>von Hanxleden</examiner>  
        <examiner>Jansen</examiner>
</examiners>
        <examiner>Wilke</examiner>
  <file>Klein_von_Hanxleden_VD_DB_BS_092008.pdf</file>
      </examiners>
</log>
      <file>Jansen_Wilke_D_Theo_032006.pdf</file>
     </log>
 
    <log>
      <date>2015</date>
      <reading>Logik in der Informatik</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Logik SS15.pdf</file>
    </log>
 
     <log>
      <date>2015</date>
      <reading>Mathematik für Informatiker B</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>Klausur mathe b15.pdf</file>
    </log>


<log>
  <date>2001</date>
  <reading>Datenbanken</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Klein</examiner> 
</examiners>
  <file>Klein_D_Prakt_042001.pdf</file>
</log>


<log>
    <log>
  <date>2002</date>
      <date>2015</date>
  <reading>Datenbanken</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>  
      <examiners>
</examiners>
        <examiner>Hanus</examiner>
  <file>Klein_D_Prakt_042002.pdf</file>
      </examiners>
</log>
      <file>2015SS_FortProg_Hanus.pdf</file>
    </log>


<log>
    <log>
  <date>2001</date>
      <date>2015</date>
  <reading>Datenbanken</reading>
      <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Klein</examiner>  
      <examiners>
</examiners>
        <examiner>Hasselbring</examiner>
  <file>Klein_D_Prakt_072001.pdf</file>
      </examiners>
</log>
      <file>Prüfungsprotokoll zu SEPDS.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2015</date>
  <reading>Datenbanken</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>  
      <examiners>
</examiners>
        <examiner>Srivastav</examiner>
  <file>Klein D Datenbanksysteme I, Datenbanktheorie.pdf</file>
      </examiners>
</log>
      <file>TGI_Srivastav_WS14-15_PZ2.pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>Datenbanken</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Klein</examiner> 
</examiners>
  <file>Klein_D_DB_092007.pdf</file>
</log>


<log>
    <log>
  <date>2006</date>
      <date>2015</date>
  <reading>Datenbanken</reading>
      <reading>Softwaretechnik</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>  
      <examiners>
</examiners>
        <examiner>Hasselbring</examiner>
  <file>Klein_D_DBS1_082006.pdf</file>
      </examiners>
</log>
      <file>Softwaretechnik-Klausur1415neu.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
      <date>2015</date>
  <reading>Datenbanksysteme1</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Kandzia</examiner>  
      <examiners>
</examiners>
        <examiner>Srivastav</examiner>
  <file>Kandzia_D_Theo_022003.pdf</file>
      </examiners>
</log>
      <file>TGI_Srivastav_WS14-15_PZ1.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2014</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
      <reading>Mathematik für Informatiker B</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Langfeld</examiner>
  <file>Berghammer math a ws1011 nachschreibe.pdf</file>
      </examiners>
</log>
      <file>MatheB-Klausur2014.pdf</file>
    </log>


    <log>
      <date>2015</date>
      <reading>Codierungstheorie</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Langfeld</examiner>
      </examiners>
      <file>Pruefungsprotokoll_CodTh.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2015</date>
  <reading>Softwaretechnik (2. Termin)</reading>
      <reading>Modellierung von Echtzeitsystemen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hasselbring</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Softwaretechnik-Nachklausurneu.pdf</file>
      </examiners>
</log>
      <file>EmSys1415.pdf</file>
    </log>
 
    <log>
      <date>2015</date>
      <reading>IT Recht</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Lindhorst</examiner>
      </examiners>
      <file>Klausur IT 15.pdf</file>
    </log>
 
    <log>
      <date>2016</date>
      <reading>Digitale Systeme</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Schimmler</examiner>
      </examiners>
      <file>DigiSys16-Version.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Modellierung von Echtzeitsystemen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>EmSys1415.pdf</file>
</log>


    <log>
      <date>2012</date>
      <reading>Synchrone Sprachen</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>SynchroneSprachenKlausurWS 20112012.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2012</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>MatheC-WS1314-2PZ.pdf‎</file>
      </examiners>
</log>
      <file>Programmierung2012.pdf</file>
    </log>


    <log>
      <date>2012</date>
      <reading>Softwaretechnik</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>Klausur_Sofwaretechnik_2012.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2011</date>
  <reading>IT Recht (1. Termin)</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Lindhorst</examiner>
      <examiners>
  </examiners>
        <examiner>Jansen</examiner>
  <file>Klausur IT 15.pdf</file>
      </examiners>
</log>
      <file>Jansen_Algorithmen_und_Datenstrukturen2011.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2012</date>
  <reading>Mathematik für Informatiker B (2. Termin)</reading>
      <reading>Software-Architektur</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Braack</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>Klausur mathe b15.pdf</file>
      </examiners>
</log>
      <file>PruefungsprotokollSoftArch032012.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Logik SS15.pdf</file>
</log>


<log>
    <log>
  <date>2015</date>
      <date>2006</date>
  <reading>Fortgeschrittene Programmierung</reading>
      <reading>Computer Graphik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>2015SS_FortProg_Hanus.pdf</file>
      </examiners>
</log>
      <file>Koch_D_CompGrafik_032006.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2007</date>
  <reading>Codierungstheorie</reading>
      <reading>Computer Graphik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Pruefungsprotokoll_CodTh.pdf</file>
      </examiners>
</log>
      <file>Koch_D_Computer-Grafik_092007.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2003</date>
  <reading>Theoretische Grundlagen der Informatik (1. Termin)</reading>
      <reading>Computer Graphik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Srivastav</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>TGI_Srivastav_WS14-15_PZ1.pdf</file>
      </examiners>
</log>
      <file>Koch_D_Tech_alt.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2003</date>
  <reading>Digitale Systeme (1. Termin)</reading>
      <reading>Computer Graphik, Datenbanksysteme1</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>DigiSys_Schimmler_WS14-15_PZ1.pdf</file>
        <examiner>Klein</examiner>
</log>
      </examiners>
      <file>KochKlein_D_Datenbanken-ComputerGraphik_092007.pdf</file>
    </log>


    <log>
      <date>2012</date>
      <reading>Software-Architektur</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>Pruefungsprotokoll-SoftArch-WS-2011-2012.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2011</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Srivastav</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>TGI_Srivastav_WS14-15_PZ2.pdf</file>
      </examiners>
</log>
      <file>SWT_Klausur_2010.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Hasselbring</examiner>
  </examiners>
  <file>Prüfungsprotokoll zu SEPDS.pdf</file>
</log>


    <log>
      <date>2011</date>
      <reading>Grundlagen der Theoretischen Informatik - Zwischenklausur</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>TGI_Midsemester_WS1112.pdf</file>
    </log>




<log>
    <log>
  <date>2014</date>
      <date>2011</date>
  <reading>Mathematik für Informatiker B (1. Termin)</reading>
      <reading>Ordnungen und Verbände, Automaten, Logiken, Spiele</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>MatheB-Klausur2014.pdf</file>
        <examiner>Berghammer</examiner>
</log>
      </examiners>
      <file>Wilke_Berghammer_Ordnung_Automaten_2011.pdf</file>
    </log>




    <log>
      <date>2011</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Huch</examiner>
      </examiners>
      <file>fortgeschrittene_programmierung_2011.pdf</file>
    </log>
    <log>
      <date>2011</date>
      <reading>Logik für Informatiker</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke_Logik_2011.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Softwaretechnik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hasselbring</examiner>
  </examiners>
  <file>Softwaretechnik-Klausur1415neu.pdf</file>
</log>


    <log>
      <date>2011</date>
      <reading>Logik in der Informatik</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>LogikInDerInformartik_Wilke_2011_2.Prüfungszeitraum.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2011</date>
  <reading>Compilerbau</reading>
      <reading>Semantik von Programmiersprachen, Effiziente Algorithmen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Compilerbau-SS13.pdf</file>
        <examiner>Jansen</examiner>
</log>
      </examiners>
      <file>Berghammer_Jansen_D_Semantik_EffAlg_2011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2011</date>
  <reading>Digitale Systeme (1. Termin, mit Lösungen)</reading>
      <reading>Logik für Informatiker</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Klausur1-DigiSys-WS2013-14.pdf‎</file>
        <examiner>Berghammer</examiner>
</log>
      </examiners>
      <file>Logik_Protokoll_SS2011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2011</date>
  <reading>XML</reading>
      <reading>Informationssysteme</reading>
  <type>schrftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Klein</examiner>
  <file>AufgabenXML2.pdf</file>
      </examiners>
</log>
      <file>IS_Klausur_SS2011.pdf</file>
<log>
    </log>
  <date>2014</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Langfeld</examiner>
  </examiners>
  <file>MatheC_WS1314_Klausur1.pdf‎</file>
</log>


<log>
    <log>
  <date>2014</date>
      <date>2011</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
      <reading>Logik in der Informatik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>MatheC_WS1314_Klausur2.pdf‎</file>
      </examiners>
</log>
      <file>Logik_Klausur_SS11.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2009</date>
  <reading>XML</reading>
      <reading>Logik, DSW</reading>
  <type>schrftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>AufgabenXML.pdf</file>
        <examiner>Srivastav</examiner>
</log>
      </examiners>
      <file>Wilke_Srivastav_Logik_DSW.pdf</file>
    </log>


    <log>
      <date>2006</date>
      <reading>Theoretische Informatatik, Logik</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke_VD_InfA_022006.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
      <date>2005</date>
  <reading>Programmierung (1. Termin)</reading>
      <reading>Theoretische Informatatik, Logik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Programmierung-Klausur_2014_2015.pdf‎</file>
      </examiners>
</log>
      <file>Wilke_VD_InfA_102005.pdf</file>
    </log>
 
 
    <log>
      <date>2005</date>
      <reading>Theoretische Informatatik, Logik</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke_VD_InfA_Okt2005.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2006</date>
  <reading>Kommunikationssysteme</reading>
      <reading>Theoretische Informatatik, Logik</reading>
  <type>schrftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Kommunikationssysteme_Luttenberger_2.Termin_SS14.pdf</file>
      </examiners>
</log>
      <file>Wilke_VD_InfIV_Logik022006.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Kryptographie 2014 2. Prüfungszeitraum.pdf</file>
</log>


<log>
    <log>
  <date>2014</date>
      <date>2008</date>
  <reading>Deklarative Programmiersprachen</reading>
      <reading>Synchrone Sprachen</reading>
  <type>mündlich</type>
      <extra>Testprüfung</extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Traulsen</examiner>
  <file>Protokolldeklspr.pdf</file>
      </examiners>
</log>
      <file>Traulsen_TestD_SynchroneSprachen_042008.pdf</file>
    </log>


    <log>
      <date>2009</date>
      <reading>Echzeitsysteme, Synchrone Sprachen</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>vonHanxleden_D_Echtzeitsysteme_SynchroneSprachen_072009.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
      <date>2007</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
      <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Langfeld</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>MatheC_WiSe1213_Klausur1.pdf</file>
      </examiners>
</log>
      <file>vonHanxleden_D_PrakTech_022007.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2002</date>
  <reading>Deklarative Programmiersprachen</reading>
      <reading>Effiziente Algorithmen, Transitionssysteme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>DPS_Pruefung_072014.pdf</file>
      </examiners>
</log>
      <file>Wilke_D_Theo_072002.pdf</file>
    </log>
 
     <log>
      <date>2007</date>
      <reading>Kryptographie, Angewandte Automatentheorie</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke_D_TheoInf.pdf</file>
    </log>
 
    <log>
      <date>2006</date>
      <reading>Theoretische Informatatik, Logik</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Wilke-InfA-TheoInf_Logik-Oktober2006.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Logik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>logik_klausur_termin1_lsg.pdf</file>
</log>


<log>
    <log>
  <date>2013</date>
      <date>2008</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
      <reading>Synchrone Sprachen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>2-Nachklausur_Fortgeschrittene_Programmierung_pdf_exercises.pdf</file>
      </examiners>
</log>
      <file>vonHanxleden_D_SynchroneSprachen_042008.pdf</file>
    </log>


<log>
  <date>2013</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>TheoInf121321.pdf</file>
  <file>TheoInf121322.pdf</file>
</log>


<log>
    <log>
  <date>2013</date>
      <date>2005</date>
  <reading>Theoretische Grundlagen der Informatik (1. Termin)</reading>
      <reading>Effiziente Algorithmen, Moderne Kryptographie</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>TheoInf12131.pdf</file>
      </examiners>
</log>
      <file>Wilke_D_EffAlg_072005.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2007</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Kryptographie, Programmierung</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Börm</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Informatik ADS Börm 2014.pdf</file>
        <examiner>deRoever</examiner>
</log>
      </examiners>
      <file>Wilke_deRoever_D_Kryptographie_Programmierung_122007.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
      <date>2005</date>
  <reading>Betriebssysteme</reading>
      <reading>Theoretische Informatatik, Logik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Luttenberger</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Betriebssysteme 11.2.14.pdf</file>
      </examiners>
</log>
      <file>Wilke_VD_InfoA_102005_2.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Nowotka</examiner>
  </examiners>
  <file>Softwaretechnik 18.2.14.pdf</file>
</log>


<log>
    <log>
  <date>1999</date>
      <date>2011</date>
  <reading>Datenbanken</reading>
      <reading>NVP, PrinzProg</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Kandzia</examiner>  
      <examiners>
</examiners>
        <examiner>Huch</examiner>
  <file>Kandzia_D_Theo_alt_89-99.pdf</file>
        <examiner>Hanus</examiner>
</log>
      </examiners>
      <file>Huch_Hanus_D_NVP_PPS_2011.pdf</file>
    </log>
 
    <log>
      <date>2011</date>
      <reading>Synchrone Sprachen, Kryptographie</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Prüfungsprotokoll_vHanxleden_Wilke.pdf</file>
     </log>
 
    <log>
      <date>2010</date>
      <reading>Theoretische Grundlagen der Informatik</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>klausur.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2010</date>
  <reading>Effiziente Algorithmen, Kombinatorische Optimierung</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>  
      <examiners>
    <examiner>Srivastav</examiner>
        <examiner>Wilke</examiner>
</examiners>
      </examiners>
  <file>Jansen_Srivastav_D_EffizienteAlg_KombOpt_042009.pdf</file>
      <file>klausur-nachschreib.pdf</file>
</log>
    </log>


<log>
  <date>2006</date>
  <reading>Effiziente Algorithmen, Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Jansen</examiner> 
    <examiner>Wilke</examiner>
</examiners>
  <file>Jansen_Wilke_D_Theo_032006.pdf</file>
</log>


    <log>
      <date>2010</date>
      <reading>Mathematik für Informatiker A</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Srivastav</examiner>
      </examiners>
      <file>ws0910_matheA.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
      <date>2010</date>
  <reading>Fuzzy-Methoden</reading>
      <reading>Funktionale Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Salski</examiner>
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>protokoll_fuzzy.pdf</file>
      </examiners>
</log>
      <file>FunktionaleProg-Huch-2010.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>Informations- und Wissensmanagement</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Tochtermann</examiner>
  </examiners>
  <file>Informations-_und_Wissensmanagement.pdf‎</file>
</log>


<log>
    <log>
  <date>2011</date>
      <date>2010</date>
  <reading>E-Business und e-Marketing</reading>
      <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Speck</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>EBusiness_eMarketing.pdf‎</file>
        <examiner>Huch</examiner>
</log>
      </examiners>
      <file>Huch_D_NVP_Hanus_D_PPS_Dez2010.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>IT-Sicherheit</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>protokoll_itsec.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
      <date>2011</date>
  <reading>Betriebliche Informationssysteme</reading>
      <reading>Nebenläufige und verteilte Programmierung, Funktioniale Programmierung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Speck</examiner>
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>Betriebliche_Informationssysteme.pdf</file>
      </examiners>
</log>
      <file>Huch_neb_vert_funkt_Programmierung_062011.pdf</file>
    </log>
 


<log>
    <log>
  <date>2011</date>
      <date>2011</date>
  <reading>Qualitätsmanagement</reading>
      <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Speck</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Qualitätsmanagement.pdf</file>
        <examiner>Huch</examiner>
</log>
      </examiners>
      <file>Prüfungsprotokoll_PPS_NVS_230211.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Jansen</examiner> 
  </examiners>
  <file>Jansen_D_EffApprAlg_082006.pdf</file>
</log>


    <log>
      <date>2011</date>
      <reading>Übersetzerbau, Entwurf eingebetteter Echtzeitsysteme</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hanus</examiner>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Prüfungsprotokoll_vHanxleden_Hanus_I.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
      <date>2011</date>
  <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
      <reading>Übersetzerbau, Semantik von Programmiersprachen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Jansen</examiner>  
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Jansen_D_Theo_012004.pdf</file>
        <examiner>Berghammer</examiner>
</log>
      </examiners>
      <file>Hanus_Berghammer_Compiler_Semantik022011.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
      <date>2011</date>
  <reading>Effiziente Algorithmen</reading>
      <reading>Funktionale Programmierung, Internet Communications</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Jansen</examiner>  
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>Jansen_D_Theo_072004.pdf</file>
        <examiner>Luttenberger</examiner>
</log>
      </examiners>
      <file>Huch_Luttenberger_FunktProg_IC.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2011</date>
  <reading>Nebenläufige und verteilte Programmierung, Softwaretechnik</reading>
      <reading>Künstliche Intelligenz</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Huch</examiner>  
      <examiners>
<examiner>Goerigk</examiner> 
        <examiner>Salski</examiner>
</examiners>
      </examiners>
  <file>huch_goerigk_D_Nebprog_softtech_062009.pdf</file>
      <file>Salski_KI_0711.pdf</file>
</log>
    </log>


<log>
  <date>2004</date>
  <reading>Übersetzerbau, Funktionale Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>Hanus_D__PrakInf.pdf</file>
</log>


<log>
    <log>
  <date>2007</date>
      <date>2011</date>
  <reading>Deklarative Programmiersprachen</reading>
      <reading>Softwareentwicklung für Parallele und Verteilte Systeme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>Hanus_VL_DPS_082007.pdf</file>
      </examiners>
</log>
      <file>protokoll_diplom_vertiefung_2011_sepvs.pdf</file>
     </log>
 
    <log>
      <date>2011</date>
      <reading>Softwaretechnik</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hasselbring</examiner>
      </examiners>
      <file>protokoll_diplom_vertiefung_2011_softwaretechnik.pdf</file>
    </log>


<log>
  <date>2009</date>
  <reading>Informatik1, Informatik4</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Hanus, Wilke</examiner>
  </examiners>
  <file>HanusWilke_VD_Inf1_Inf4_Okt2009.pdf</file>
</log>


<log>
    <log>
  <date>2010</date>
      <date>2012</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Mathematik für Informatiker I und II</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Braack</examiner>
  <file>Alg_Dat_2010.pdf</file>
      </examiners>
</log>
      <file>VD_Mathe_fuer_Informatiker022012.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2012</date>
  <reading>Prinzipien von Programmiersprachen, Logikprogrammierung</reading>
      <reading>Programmierung, Softwaretechnik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
     <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>D_Hanus_Programmierung_032007.pdf</file>
      </examiners>
</log>
      <file>VD_Programmierung_und_SWT022012.pdf</file>
     </log>
    <log>
      <date>2011</date>
      <reading>Mathematik für Informatiker C</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>MatheC_Braack_20102011.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2012</date>
  <reading>Prinzipien von Programmiersprachen und Funktionale Programmierung</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>DiplPruefungHanus.pdf</file>
      </examiners>
</log>
      <file>TheoretischeGrundlagenDerInformatik2012.pdf</file>
    </log>




<log>
    <log>
  <date>2007</date>
      <date>2012</date>
  <reading>Algorithmen und Datenstrukturen (Nachschreibklausur)</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturenNachschreiber 2007.pdf</file>
      </examiners>
</log>
      <file>MatheA_fuer_Inf_11_12.png</file>
     </log>
 
    <log>
      <date>2011</date>
      <reading>Mathematik für Informatiker A</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Berghammer</examiner>
      </examiners>
      <file>MatheA_fuer_Inf_10_11.png</file>
    </log>


<log>
  <date>2005</date>
  <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2005.pdf</file>
</log>


<log>
    <log>
  <date>2002</date>
      <date>2012</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Braack</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2002.pdf</file>
      </examiners>
</log>
      <file>MatheC2012.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2011</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Mathematik für Informatiker B</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Klein</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2007.pdf</file>
      </examiners>
</log>
      <file>MatheB2011.pdf</file>
    </log>


<log>
  <date>2009</date>
  <reading>Logik für Informatiker (Nachschreibklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Wilke Mathematik fuer Informatiker III Nachholklausur 2009.pdf</file>
</log>


<log>
    <log>
  <date>2004</date>
      <date>2016</date>
  <reading>Theoretische Informatik</reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>Wilke Inf TheoretischeInformatik 2004.pdf</file>
      </examiners>
</log>
      <file>SWT_WS1516_1.ZR.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2016</date>
  <reading>Logik für Informatiker</reading>
      <reading>Wissenschaftliches Rechnen</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Börm</examiner>
  <file>Wilke Inf MathematikfuerInformatikerIII Logik 2009.pdf</file>
      </examiners>
</log>
      <file>Prüfungsprotokoll_wissrech.pdf</file>
    </log>
 
    <log>
      <date>2012</date>
      <reading>Betriebssysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Luttenberger</examiner>
      </examiners>
      <file>Betriebssysteme_WS11-12(1.Termin).pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2012</date>
  <reading>Kryptographie</reading>
      <reading>Logik in der Informatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Wilke Inf Kryptographie 2005.pdf</file>
      </examiners>
</log>
      <file>Logik_SS12(1.Termin).pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2012</date>
  <reading>Algorithmen und Datenstrukturen (Probleklausur)</reading>
      <reading>Modellierung nebenläufiger Systeme</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturenProbeklausur 2008.pdf</file>
      </examiners>
</log>
      <file>mcs.pdf</file>
    </log>


    <log>
      <date>2012</date>
      <reading>Kommunikatonssysteme</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Luttenberger</examiner>
      </examiners>
      <file>Kommunikationssysteme_Klausurtermin1_SS2012.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2012</date>
  <reading>Algorithmen und Datenstrukturen</reading>
      <reading>Kommunikatonssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
  </examiners>
        <examiner>Luttenberger</examiner>
  <file>VonHanxleden InformatikII Sose2009.pdf</file>
      </examiners>
</log>
      <file>Kommunikationssysteme_Klausurtermin2_SS2012.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Organisation und Archtitektur von Rechnern</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>VonHanxleden Inf OAR 2006.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
      <date>2012</date>
  <reading>Betriebssysteme</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>VonHanxleden Inf Betriebssysteme 2008.pdf</file>
      </examiners>
</log>
      <file>FortProg _2Termin_SS2012.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2012</date>
  <reading>Verteilte Algorithmen, Synchrone Sprachen</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>deRoever, von Hanxleden</examiner>
      <examiners>
  </examiners>
        <examiner>Jansen</examiner>
  <file>DeRoeverVonHanxleden_D_VerteilteAlgorithmen_SynchroneSprachen_072007.pdf
      </examiners>
</file>
      <file>ADS_SoSe_2012_Versuch_1.pdf</file>
</log>
    </log>
 
 
     <log>
      <date>2012</date>
      <reading>Mathematik für Informatiker C</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Braack</examiner>
      </examiners>
      <file>Mathematik_fuer_Informatiker_C_WS2011_12_Klausurenzeitraum_2.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
      <date>2012</date>
  <reading>Verteilte Algorithmen</reading>
      <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>deRoever</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>deRoever_D_Theo_022003.pdf</file>
      </examiners>
</log>
      <file>Hasselbring_SEPVS_2012.pdf</file>
    </log>


    <log>
      <date>2011</date>
      <reading>Mathematik für Informatiker A</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Srivastav</examiner>
      </examiners>
      <file>mathe_A_klausur_1.pdf</file>
    </log>


<log>
    <log>
  <date>1996</date>
      <date>2011</date>
  <reading>Theoretische Informatik</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Unbekannt</examiner>
      <examiners>
  </examiners>
        <examiner>Srivastav</examiner>
  <file>Unbekannt Inf TheoretischeInformatik 1996.pdf</file>
      </examiners>
</log>
      <file>mathe_A_klausur_2.pdf</file>
    </log>


<log>
    <log>
  <date>1991</date>
      <date>2012</date>
  <reading>Diplomprüfung</reading>
      <reading>Automaten, Logiken und Spiele</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Betten, Klopsch</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Betten_D_Geo_alt_91-02.pdf</file>
      </examiners>
</log>
      <file>wilke_als_ws11-12.pdf</file>
    </log>


<log>
    <log>
  <date>1987</date>
      <date>2011</date>
  <reading>Vordiplomprüfung</reading>
      <reading>Multimediale Informationsverarbeitung</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Betten</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Betten_VD_Alg_alt_86-87.pdf</file>
      </examiners>
</log>
      <file>multinf-2011-koch-1.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Thalheim Inf Datenbanksysteme 2006.pdf</file>
</log>


<log>
    <log>
  <date>2005</date>
      <date>2012</date>
  <reading>Datenbanksysteme</reading>
      <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Thalheim</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>Thalheim Inf Datenbanksysteme 2005.pdf</file>
      </examiners>
</log>
      <file>SEPVS_Pruefung_2012.pdf</file>
    </log>


<log>
  <date>2005</date>
  <reading>Datenbanksysteme (Nachschreibklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Thalheim Inf DatenbanksystemeNachschreiber 2005.pdf</file>
</log>


<log>
    <log>
  <date>2006</date>
      <date>2012</date>
  <reading>Datenbanksysteme (Nachschreibklausur)</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Thalheim</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Thalheim Inf DatenbanksystemeNachschreiber 2006.pdf</file>
      </examiners>
</log>
      <file>FortProg_SS2012.pdf</file>
    </log>
 
     <log>
      <date>2012</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Hanus_FortProg_2012.pdf</file>
    </log>
 
    <log>
      <date>2010</date>
      <reading>Logik</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Spinas</examiner>
      </examiners>
      <file>logik-infmath3-2010-spinas-1.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Datenbanksysteme (Nachschreibklausur - Nebenfächler)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Thalheim DatenbanksystemeNebenfaechlerNachschreiber 2006 01.pdf</file>
</log>


<log>
    <log>
  <date>2006</date>
      <date>2012</date>
  <reading>Datenbanksysteme (Nebenfächler)</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>Übungsklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Thalheim</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Thalheim DatenbanksystemeNebenfaechler 2006.pdf</file>
      </examiners>
</log>
      <file>UebungsklausurProgrammierung2012.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2012</date>
  <reading>Softwaretechnologie</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Thalheim</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Thalheim Inf Softwaretechnologie 2007.pdf</file>
      </examiners>
</log>
      <file>Hanus_Programmierung2012.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2012</date>
  <reading>MfI2, Logik</reading>
      <reading>Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Bergweiler, Wilke</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Bergweiler_Wilke_VD_MfI2_Logik_052009.pdf</file>
      </examiners>
</log>
      <file>Hanus_PPS_2012.pdf</file>
    </log>


    <log>
      <date>2008</date>
      <reading>Algorithmen und Datenstrukturen</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>2008_ss_informatik_2_schriftlich_wilke_zeitraum1.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2011</date>
  <reading>Logik fuer Informatiker</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Spinas</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Spinas Logik 2007.pdf</file>
      </examiners>
</log>
      <file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum1.pdf</file>
    </log>


    <log>
      <date>2016</date>
      <reading>Theoretische Grundlagen der Informatik</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Klausur_TGI_WS1516_1.jpg</file>
    </log>


<log>
    <log>
  <date>2000</date>
      <date>2016</date>
  <reading>Semantik, Effiziente Algorithmen</reading>
      <reading>Computergraphik</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Berghammer_D_Theo_102000.pdf</file>
      </examiners>
</log>
      <file>CG-Klausur-WS1516.pdf</file>
    </log>
 
    <log>
      <date>2016</date>
      <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Prüfungsprotokoll - Entwurf eingebetteter Echtzeitsysteme - WS15_16.pdf</file>
    </log>
 
     <log>
      <date>2016</date>
      <reading>Deklarative Programmiersprachen1516</reading>
      <extra>1. Termin</extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Deklarative Programmiersprachen1516.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2012</date>
  <reading>Digitale Systeme</reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Hasselbring</examiner>
  <file>Schimmler sysinfI ws0809.PDF</file>
      </examiners>
</log>
      <file>softwaretechnik_2012_2.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2012</date>
  <reading>Digitale Systeme</reading>
      <reading>Logik für Informatiker</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Schimmler Inf DigitaleSysteme 2005.pdf</file>
      </examiners>
</log>
      <file>Logik_Informatiker_2012_21.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2011</date>
  <reading>Parallele Architekturen und Algorithmen</reading>
      <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Schimmler Inf ParalleleArchitekturen 2006.pdf</file>
      </examiners>
</log>
      <file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum2.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2015</date>
  <reading>Digitale Systeme</reading>
      <reading>Multimediale Signal- und Bildverarbeitung</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Schimmler</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Schimmler Inf DigitaleSysteme 2008.pdf</file>
      </examiners>
</log>
      <file>klausur multimediale signal und bildverarbeitung.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2016</date>
  <reading>VD Informatik</reading>
      <reading>Betriebs- und Kommunikationssysteme</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Berghammer_VD_InfoB_102005_3.pdf</file>
        <examiner>Schnoor</examiner>
</log>
      </examiners>
      <file>KlausurSS2016-Koch-Schnoor.pdf</file>
    </log>


<log>
  <date>2005</date>
  <reading>VD Informatik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Berghammer_VD_InfoB_102005.pdf</file>
</log>


<log>
    <log>
  <date>2005</date>
      <date>2013</date>
  <reading>VD Informatik</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Srivastav</examiner>
  <file>Berghammer_VD_InfoB_102005_2.pdf</file>
      </examiners>
</log>
      <file>Mathe_Inf_A_Srivastav_12_13.pdf</file>
    </log>
 
    <log>
      <date>2013</date>
      <reading>Graphentheorie</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Srivistav</examiner>
      </examiners>
      <file>srivastav_graphentheorie_032013.pdf</file>
    </log>
 
     <log>
      <date>2013</date>
      <reading>Iterative Verfahren für große Gleichungssysteme</reading>
      <extra></extra>
      <type>mündlich</type>
      <examiners>
        <examiner>Börm</examiner>
      </examiners>
      <file>Boerm_Iterative_2013.pdf</file>
    </log>


    <log>
      <date>2013</date>
      <reading>Betriebssysteme</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Luttenberger</examiner>
      </examiners>
      <file>luttenberger_betriebssysteme_2013_2Termin.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2016</date>
  <reading>Informatik 2: Algorithmen und Datenstrukturen</reading>
      <reading>Computersysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Schimmler</examiner>
  <file>Jansen Inf AlgorithmenDatenstrukturen 2006.pdf</file>
      </examiners>
</log>
      <file>Compsys-WS2016_1.compressed.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2013</date>
  <reading>Approximative Algorithmen</reading>
      <reading>Mathematik für Informatiker C</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Langfeld</examiner>
  <file>Jansen Inf ApproximativeAlgorithmen 2006.pdf</file>
      </examiners>
</log>
      <file>matheC_2013_2Termin.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2016</date>
  <reading>Approximative Algorithmen</reading>
      <reading>Betriebs- und Kommunikationssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Jansen Inf ApproximativeAlgorithmen 2007.pdf</file>
        <examiner>Schnoor</examiner>
</log>
      </examiners>
      <file>BSKS_SS16_2.ZR.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2016</date>
  <reading>Effiziente Algorithmen</reading>
      <reading>Web-Technologien</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Luttenberger</examiner>
  <file>Jansen Inf EffizienteAlgorithmen 2008.pdf</file>
      </examiners>
</log>
      <file>WebTech_SS16_1.ZR.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2017</date>
  <reading>Theoretische Informatik</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Jansen Inf TheoretischeInformatik 2008.pdf</file>
      </examiners>
</log>
      <file>Mathe_A_WS16_17_1_Versuch.pdf</file>
    </log>
 
    <log>
      <date>2016</date>
      <reading>Logik in der Informatik</reading>
      <extra>1. Termin mit Lösung</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Wilke</examiner>
      </examiners>
      <file>Logik_Inf_SS16_Lsg.pdf</file>
    </log>


<log>
  <date>2009</date>
  <reading>Theoretische Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>Jansen Inf TheoretischeInformatik 2009.PDF</file>
</log>


<log>
    <log>
  <date>2008</date>
      <date>2013</date>
  <reading>Theoretische Informatik (Nachschreibklausur)</reading>
      <reading>Logik in der Informatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Jansen Inf TheoretischeInformatikNachschreiber 2008.pdf</file>
      </examiners>
</log>
      <file>Logik_Informatik_2013_1.pdf</file>
    </log>


<log>
    <log>
  <date>1998</date>
      <date>2016</date>
  <reading>VD Informatik</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Jansen</examiner>
  <file>Berghammer_VD_InfA_alt_96-98.pdf</file>
      </examiners>
</log>
      <file>klausur_ads_ss2016.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
      <date>2013</date>
  <reading>Logik</reading>
      <reading>3D Szenerekonstruktion, Computer Grafik</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>mündlich</type>
    <examiner>Blessenohl</examiner>
      <examiners>
  </examiners>
        <examiner>Koch</examiner>
  <file>Blessenohl Logik 2003.pdf</file>
      </examiners>
</log>
      <file>Koch_D_3D_ComputerGrafik_092013.pdf</file>
    </log>


<log>
  <date>2003</date>
  <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Berghammer_Inf_Programmierung_2003_01.PDF‎</file>
</log>


<log>
    <log>
  <date>1999</date>
      <date>2017</date>
  <reading>Inf Programmierung</reading>
      <reading>Betriebs- und Kommunikationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>Luttenberger</examiner>
  <file>Berghammer_Inf_Programmierung_1999_01.pdf‎</file>
      </examiners>
</log>
      <file>Bsks_ss2017_1.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 2 (1. Termin)</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Bergweiler</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Bergweiler Inf Mathe2 2008.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1516_2.pdf</file>
    </log>


    <log>
      <date>2017</date>
      <reading>Machine Learning</reading>
      <extra></extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Prof. Dr. Carsten Meyer</examiner>
      </examiners>
      <file>Machine_Learning_Klausur_SS17.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2017</date>
  <reading>Datenbanksysteme</reading>
      <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>
      <examiners>
  </examiners>
        <examiner>Jansen</examiner>
  <file>Klein Inf Datenbanksysteme 2009.pdf</file>
      </examiners>
</log>
      <file>Ads_ss2017_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 1 (2. Termin)</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Bergweiler</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Bergweiler Inf Mathe1Nachschreiber 2008.pdf</file>
      </examiners>
</log>
      <file>Mathe_inf_a_ws1617_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 2 (2. Termin)</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>Probeklausur - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Bergweiler</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Bergweiler Inf Mathe2 2006 01.PDF</file>
      </examiners>
</log>
      <file>Mathe_inf_a_ws1617_probe_loesung.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
      <date>2016</date>
  <reading>Inf Programmierung</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Berghammer Inf Programmierung 2004.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1516_2_loesung.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
      <date>2015</date>
  <reading>Inf Programmierung</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Berghammer</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Berghammer Inf Programmierung 2005.PDF</file>
      </examiners>
</log>
      <file>Programmierung_ws1516_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2001</date>
      <date>2016</date>
  <reading>Inf Programmierung (Mitsemesterklausur)</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Hanus Inf ProgrammierungMitsemester 2001.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1617_probe.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 1 (1. Termin)</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Braack</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Braack WS0809 MathefuerInfosI.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1516_1.pdf</file>
    </log>


    <log>
      <date>2016</date>
      <reading>Programmierung</reading>
      <extra>1. Termin - Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Programmierung_ws1516_1_loesung.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2016</date>
  <reading>Inf Logikprogrammierung</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>Probeklausur - Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Hanus Inf Logikprogrammierung 2006.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1617_probe_loesung.pdf</file>
     </log>
 
    <log>
      <date>2015</date>
      <reading>Programmierung</reading>
      <extra>Probeklausur - Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>von Hanxleden</examiner>
      </examiners>
      <file>Programmierung_ws1516_probe_loesung.pdf</file>
    </log>


<log>
    <log>
  <date>2001</date>
      <date>2017</date>
  <reading>Inf Programmierung</reading>
      <reading>Computersysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Schimmler</examiner>
  <file>Hanus Inf Programmierung 2001.pdf</file>
      </examiners>
</log>
      <file>Compsys_ws1617_1.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
      <date>2017</date>
  <reading>Inf Programmierung</reading>
      <reading>Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>von Hanxleden</examiner>
  <file>Hanus Inf Programmierung 2002.pdf</file>
      </examiners>
</log>
      <file>Programmierung_ws1617_1.pdf</file>
    </log>


<log>
  <date>2008</date>
  <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>Hanus Inf Programmierung 2008.pdf</file>
</log>


<log>
    <log>
  <date>2001</date>
      <date>2014</date>
  <reading>Inf Programmierung (Mitsemesterklausur)</reading>
      <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Nowotka</examiner>
  <file>Hanus Inf ProgrammierungMitsemester 2001.pdf</file>
      </examiners>
</log>
      <file>softwaretechnik_2014_1.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
      <date>2014</date>
  <reading>Inf Programmierung (Testklausur)</reading>
      <reading>IT-Sicherheit</reading>
  <type>schriftlich</type>
      <extra></extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Wilke</examiner>
  <file>Hanus Inf ProgrammierungTestklausur 2002.pdf</file>
      </examiners>
</log>
      <file>it_sicherheit_2014_1.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2018</date>
  <reading>Informatik 1</reading>
      <reading>Einführung in die Wirtschaftsinformatik</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Thalheim</examiner>
  <file>Hanus Informatik I WS0809.pdf</file>
      </examiners>
</log>
      <file>Einf_winf_thalheim_ws1718_pz1.pdf</file>
    </log>
 
    <log>
      <date>2018</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>1. Termin mit Lösungen</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Fortprog_hanus_ws1718_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
      <date>2015</date>
  <reading>Inf Programmierung (Testklausur)</reading>
      <reading>Mathematik Für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Hanus Inf ProgrammierungTestklausur 2002.pdf</file>
      </examiners>
</log>
      <file>MatheA_WS1415_2PZ.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
      <date>2016</date>
  <reading>Inf Programmierung</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Hanus</examiner>
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>Hanus Inf Programmierung 2002.pdf</file>
      </examiners>
</log>
      <file>Fortprog_huch_ss16_pz2.tar.xz</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 2 (1. Termin)</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Braack</examiner>
      <examiners>
  </examiners>
        <examiner>Huch</examiner>
  <file>Braack MfI II Sose2009.pdf</file>
      </examiners>
</log>
      <file>Fortprog_huch_ss16_pz1.tar.xz</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2016</date>
  <reading>Mathematik für Informatiker 1 (1. Termin)</reading>
      <reading>Mathematik Für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Braack</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Braack WS0809 MathefuerInfosI.pdf</file>
      </examiners>
</log>
      <file>MatheA_WS1516_1PZ.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2016</date>
  <reading>Datenbanksysteme</reading>
      <reading>Mathematik Für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Klein Inf Datenbanksysteme 2009.pdf</file>
      </examiners>
</log>
      <file>MatheA_WS1516_2PZ.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
      <date>2017</date>
  <reading>Theoretische Informatik</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin mit Lösungen</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Thalheim</examiner>
  <file>Jansen Inf TheoretischeInformatik 2009.PDF</file>
      </examiners>
</log>
      <file>Infsys_ws1617_pz2_mit_loesung.pdf</file>
     </log>
 
    <log>
      <date>2015</date>
      <reading>Mathematik Für Informatiker A</reading>
      <extra>1. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Berghammer</examiner>
      </examiners>
      <file>MatheA_WS1415_1PZ.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2018</date>
  <reading>Theoretische Informatik (Nachschreibklausur)</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Jansen Inf TheoretischeInformatikNachschreiber 2008.pdf</file>
      </examiners>
</log>
      <file>Mathe_a_ws1718_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2017</date>
  <reading>Effiziente Algorithmen</reading>
      <reading>Informationssysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Thalheim</examiner>
  <file>Jansen Inf EffizienteAlgorithmen 2008.pdf</file>
      </examiners>
</log>
      <file>Infsys_ws1617_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
      <date>2018</date>
  <reading>Theoretische Informatik</reading>
      <reading>Computersysteme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Schimmler</examiner>
  <file>Jansen Inf TheoretischeInformatik 2008.pdf</file>
      </examiners>
</log>
      <file>Compsys_ws1718_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2017</date>
  <reading>Approximative Algorithmen</reading>
      <reading>Fortgeschrittene Programmierung</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Hanus</examiner>
  <file>Jansen Inf ApproximativeAlgorithmen 2006.pdf</file>
      </examiners>
</log>
      <file>Fortprog_hanus_ws1717_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
      <date>2018</date>
  <reading>Approximative Algorithmen</reading>
      <reading>Graphenthorie</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Srivastav</examiner>
  <file>Jansen Inf ApproximativeAlgorithmen 2007.pdf</file>
      </examiners>
</log>
      <file>Graphentheorie_Srivastav_ws1718_1f_pz1.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
      <date>2017</date>
  <reading>Informatik 2: Algorithmen und Datenstrukturen</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>Probeklausur</extra>
  <examiners>
      <type>schriftlich</type>
     <examiner>Jansen</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Jansen Inf AlgorithmenDatenstrukturen 2006.pdf</file>
      </examiners>
</log>
      <file>Mathe-a_berghammer_ws1617_probe.pdf</file>
    </log>
 
     <log>
      <date>2017</date>
      <reading>Fortgeschrittene Programmierung</reading>
      <extra>2. Termin</extra>
      <type>schriftlich</type>
      <examiners>
        <examiner>Hanus</examiner>
      </examiners>
      <file>Fortprog_hanus_ws1717_pz2.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
      <date>2018</date>
  <reading>Logik</reading>
      <reading>Mathematik für Informatiker A</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Rösler</examiner>
      <examiners>
  </examiners>
        <examiner>Berghammer</examiner>
  <file>Roesler Logik 2004.pdf</file>
      </examiners>
</log>
      <file>Berghammer_MatheA_WS17_2PZ.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Parallele Architekturen und Algorithmen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler Inf ParalleleArchitekturen 2006.pdf</file>
</log>


<log>
     <!--
  <date>2008</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
     <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler Inf DigitaleSysteme 2008.pdf</file>
</log>


<log>
  <date>2009</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler sysinfI ws0809.PDF</file>
</log>


  Veraltet:


<log>
      <log>
  <date>2007</date>
        <date>1993</date>
  <reading>Inf Programmierung</reading>
        <reading>Logik</reading>
  <type>schriftlich</type>
      <extra>Lösung</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Unbekannt</examiner>
  <file>Berghammer Inf Programmierung 2007.pdf</file>
        </examiners>
</log>
        <file>Unbekannt Logik 1993 Loesung.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>1995</date>
  <reading>Inf Programmierung</reading>
        <reading>Logik</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Unbekannt</examiner>
  <file>Berghammer Inf Programmierung 2004.pdf</file>
        </examiners>
</log>
        <file>Unbekannt Logik 1995.pdf</file>
    </log>


<log>
        <log>
  <date>2005</date>
        <date>1996</date>
  <reading>Inf Programmierung</reading>
        <reading>Theoretische Informatik</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
     <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Unbekannt</examiner>
  <file>Berghammer Inf Programmierung 2005.PDF</file>
        </examiners>
</log>
        <file>Unbekannt Inf TheoretischeInformatik 1996.pdf</file>
    </log>
 
    <log>
        <date>1999</date>
        <reading>Verschiedene (Diplom)</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Kluge</examiner>
        </examiners>
        <file>Kluge_D_Prakt_alt_86-99.pdf</file>
    </log>
 
     <log>
        <date>1994</date>
        <reading>Verschiedene (Vordiplom)</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Kluge</examiner>
        </examiners>
        <file>Kluge_VD_InfB_alt_90-94.pdf</file>
    </log>




<log>
        <log>
  <date>2005</date>
        <date>2006</date>
  <reading>Digitale Systeme</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Schimmler Inf DigitaleSysteme 2005.pdf</file>
        </examiners>
</log>
        <file>Thalheim Inf Datenbanksysteme 2006.pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
  </examiners>
  <file>Srivastav Inf DiskreteStrukturen 2004.pdf</file>
</log>


<log>
    <log>
  <date>2006</date>
        <date>2006</date>
  <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
      <extra>Nachschreibklausur</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Srivastav</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Srivastav Inf DiskreteStrukturen 2006.pdf</file>
        </examiners>
</log>
        <file>Thalheim Inf DatenbanksystemeNachschreiber 2006.pdf</file>
    </log>


    <log>
        <date>1994</date>
        <reading>Codierungstheorie</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Knüppel</examiner>
        </examiners>
        <file>Knueppel_Alg_D_alt_94.pdf</file>
    </log>




<log>
    <log>
  <date>2007</date>
        <date>2005</date>
  <reading>Softwaretechnologie</reading>
        <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Thalheim</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Thalheim Inf Softwaretechnologie 2007.pdf</file>
        </examiners>
</log>
        <file>Schimmler_Inf_DigitaleSysteme_2005.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
        <date>2010</date>
  <reading>Datenbanksysteme (Nachschreibklausur - Nebenfächler)</reading>
        <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Thalheim</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Thalheim DatenbanksystemeNebenfaechlerNachschreiber 2006 01.pdf</file>
        </examiners>
</log>
        <file>Schimmler_SysInfI_20102.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Datenbanksysteme (Nebenfächler)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Thalheim DatenbanksystemeNebenfaechler 2006.pdf</file>
</log>


<log>
    <log>
  <date>2005</date>
        <date>2004</date>
  <reading>Datenbanksysteme</reading>
        <reading>Kombinatorische Optimierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
     <examiner>Thalheim</examiner>
        <examiners>
  </examiners>
            <examiner>Srivastav</examiner>
  <file>Thalheim Inf Datenbanksysteme 2005.pdf</file>
        </examiners>
</log>
        <file>Srivastav_D_Opt_102004.pdf</file>
     </log>
 
    <log>
        <date>1999</date>
        <reading>Kombinatorische Optimierung</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Srivastav</examiner>
        </examiners>
        <file>Srivastav_D_Opt_alt_98-99.pdf</file>
    </log>


<log>
  <date>2005</date>
  <reading>Datenbanksysteme (Nachschreibklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Thalheim Inf DatenbanksystemeNachschreiber 2005.pdf</file>
</log>


<log>
    <log>
  <date>1996</date>
        <date>2008</date>
  <reading>Theoretische Informatik</reading>
        <reading>DSW, MfI2</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Unbekannt</examiner>
        <examiners>
  </examiners>
            <examiner>Srivastav</examiner>
  <file>Unbekannt Inf TheoretischeInformatik 1996.pdf</file>
            <examiner>Braack</examiner>
</log>
        </examiners>
        <file>Srivastav-Braack_VD_DSW-MfI2_092008.pdf</file>
    </log>


<log>
  <date>1993</date>
  <reading>Logik (Lösung)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Unbekannt</examiner>
  </examiners>
  <file>Unbekannt Logik 1993 Loesung.pdf</file>
</log>


<log>
    <log>
  <date>1995</date>
        <date>2007</date>
  <reading>Logik</reading>
        <reading>Mathematik für Informatiker 1</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Unbekannt</examiner>
        <examiners>
  </examiners>
            <examiner>Braack</examiner>
  <file>Unbekannt Logik 1995.pdf</file>
        </examiners>
</log>
        <file>Braack Inf Mathe1 2007.PDF</file>
    </log>


<log>
  <date>2006</date>
  <reading>Organisation und Archtitektur von Rechnern</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>VonHanxleden Inf OAR 2006.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
        <date>2004</date>
  <reading>Betriebssysteme</reading>
        <reading>Gruppentheorie, Algebraische Kombinatorik der Permutationen</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>von Hanxleden</examiner>
        <examiners>
  </examiners>
            <examiner>Blessenohl</examiner>
  <file>VonHanxleden Inf Betriebssysteme 2008.pdf</file>
        </examiners>
</log>
        <file>Blessenohl_D_Alg_102004.pdf</file>
    </log>




<log>
    <log>
  <date>1999</date>
        <date>1998</date>
  <reading>Inf Programmierung</reading>
        <reading>Verschiedene</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Sommer</examiner>
  <file>Berghammer_Inf_Programmierung_1999_01.pdf‎</file>
        </examiners>
</log>
        <file>Sommer_D_Prakt_alt_96-98.pdf</file>
    </log>
 
    <log>
        <date>2009</date>
        <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Srivastav</examiner>
        </examiners>
        <file>Srivastav Inf DiskreteStrukturenWahrscheinlichkeitstheorie 2009.pdf</file>
    </log>
 
    <log>
        <date>2008</date>
        <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Srivastav</examiner>
        </examiners>
        <file>Srivastav Inf DiskreteStrukturenWahrscheinlichkeitstheorie 2008.pdf</file>
    </log>


<log>
  <date>2003</date>
  <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Berghammer_Inf_Programmierung_2003_01.PDF‎</file>
</log>


    <log>
        <date>2013</date>
        <reading>Digitale Systeme</reading>
      <extra>2. Termin</extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>DigitaleSysteme_WS1213_2.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>2013</date>
  <reading>Algorithmen und Datenstrukturen</reading>
        <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2007.pdf</file>
        </examiners>
</log>
        <file>DigitaleSysteme_WS1213_1.pdf</file>
    </log>


<log>
        <log>
  <date>2009</date>
        <date>2014</date>
  <reading>Algorithmen und Datenstrukturen</reading>
        <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>von Hanxleden</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>VonHanxleden InformatikII Sose2009.pdf</file>
        </examiners>
</log>
        <file>DigitaleSysteme_2014_1.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
        <date>2012</date>
  <reading>Algorithmen und Datenstrukturen</reading>
        <reading>XML</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2005.pdf</file>
        </examiners>
</log>
        <file>luttenberger_xml_2012.pdf</file>
    </log>


<log>
  <date>2002</date>
  <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Wilke Inf AlgorithmenDatenstrukturen 2002.pdf</file>
</log>


<log>
        <log>
  <date>2008</date>
        <date>2009</date>
  <reading>Algorithmen und Datenstrukturen (Probleklausur)</reading>
        <reading>Informatik III</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
     <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Hasselbring</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturenProbeklausur 2008.pdf</file>
        </examiners>
</log>
        <file>2008_ws_informatik_3_schriftlich_hasselbring_zeitraum1.pdf</file>
     </log>
 
    <log>
        <date>2011</date>
        <reading>Kombinatorische Optimierung</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Srivastav</examiner>
        </examiners>
        <file>2011_ss_kombinatorische_optimierung_1_muendlich_srivastav.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>2012</date>
  <reading>Algorithmen und Datenstrukturen (Nachschreibklausur)</reading>
        <reading>Organisation und Archtitektur von Rechnern</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>Wilke Inf AlgorithmenDatenstrukturenNachschreiber 2007.pdf</file>
        </examiners>
</log>
        <file>OAR-Klausur-SoSe2012Hanxleden.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
        <date>2010</date>
  <reading>Logik für Informatiker</reading>
        <reading>DSW</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Srivastav</examiner>
  <file>Wilke Inf MathematikfuerInformatikerIII Logik 2009.pdf</file>
        </examiners>
</log>
        <file>dsw-infmath4-2010-srivastav-1.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
        <date>2011</date>
  <reading>Kryptographie</reading>
        <reading>Internet Communications</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Wilke Inf Kryptographie 2005.pdf</file>
        </examiners>
</log>
        <file>intcom-2011-luttenberger-1.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
        <date>2010</date>
  <reading>Logik für Informatiker (Nachschreibklausur)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Wilke Mathematik fuer Informatiker III Nachholklausur 2009.pdf</file>
        </examiners>
</log>
        <file>bs-sysinf3-2010-luttenberger-1.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>2012</date>
  <reading>Theoretische Informatik</reading>
        <reading>Binäre Entscheidungsdiagramme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Berghammer</examiner>
  <file>Wilke Inf TheoretischeInformatik 2004.pdf</file>
        </examiners>
</log>
        <file>bdd_pruefung_2012.pdf</file>
    </log>


<log>
  <date>2010</date>
  <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>Alg_Dat_2010.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
        <date>2011</date>
  <reading>Qualitätsmanagement</reading>
        <reading>Digitale Systeme</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Speck</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Qualitätsmanagement.pdf</file>
        </examiners>
</log>
        <file>DigiSysWS2010_11.pdf</file>
    </log>
 
    <log>
        <date>2012</date>
        <reading>Digitale Systeme</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>DigisysKlausur_2012.pdf</file>
    </log>
 
    <log>
        <date>2012</date>
        <reading>Semantik von Programmiersprachen, Synchrone Sprachen</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Berghammer</examiner>
            <examiner>von Hanxleden</examiner>
        </examiners>
        <file>D_SemVonProg_SynchSpra_032012.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
        <date>2012</date>
  <reading>Betriebliche Informationssysteme</reading>
        <reading>Digitale Systeme, Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Speck</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Betriebliche_Informationssysteme.pdf</file>
            <examiner>Klein</examiner>
</log>
        </examiners>
        <file>VD_Digitale_Systeme_und_Datenbanken022012.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
        <date>2008</date>
  <reading>IT-Sicherheit</reading>
        <reading>Computer Networks and Internetworking</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>protokoll_itsec.pdf</file>
        </examiners>
</log>
        <file>cn_klausur08.pdf</file>
    </log>


<log>
    <log>
  <date>2011</date>
        <date>2008</date>
  <reading>E-Business und e-Marketing</reading>
        <reading>Internet Communication, Computer Networks</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Speck</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>EBusiness_eMarketing.pdf‎</file>
        </examiners>
</log>
        <file>Prüfungsprotokoll_Luttenberger_IC_CN_040908.pdf</file>
<log>
    </log>
  <date>2000</date>
  <reading>Semantik, Effiziente Algorithmen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Berghammer_D_Theo_102000.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
        <date>2007</date>
  <reading>Informations- und Wissensmanagement</reading>
        <reading>Computer Networks and Internetworking</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Tochtermann</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Informations-_und_Wissensmanagement.pdf‎</file>
        </examiners>
</log>
        <file>cn_klausur07.pdf</file>
    </log>


<log>
  <date>2011</date>
  <reading>Fuzzy-Methoden</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Salski</examiner>
  </examiners>
  <file>protokoll_fuzzy.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
        <date>2011</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
        <reading>Programmierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Hanus</examiner>
  <file>Berghammer math a ws1011 nachschreibe.pdf</file>
        </examiners>
</log>
        <file>INF1_WS1011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2010</date>
  <reading>Softwaretechnik</reading>
        <reading>Informatik III</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Nowotka</examiner>
        <examiners>
  </examiners>
            <examiner>Hasselbring</examiner>
  <file>Softwaretechnik 18.2.14.pdf</file>
        </examiners>
</log>
        <file>InfoIII_WS_09_10.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2011</date>
  <reading>Algorithmen und Datenstrukturen</reading>
        <reading>Information Systems Analysis Design and Developement</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Börm</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Informatik ADS Börm 2014.pdf</file>
        </examiners>
</log>
        <file>ISADD.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2011</date>
  <reading>Betriebssysteme</reading>
        <reading>Rechnergestützter Entwurf digitaler Systeme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Luttenberger</examiner>
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Betriebssysteme 11.2.14.pdf</file>
        </examiners>
</log>
        <file>Schimmler_ReDigiSys_0711.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2010</date>
  <reading>Theoretische Grundlagen der Informatik (1. Termin)</reading>
        <reading>Informationssysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>TheoInf12131.pdf</file>
        </examiners>
</log>
        <file>IS_Klausur_SS2010.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2008</date>
  <reading>Logik (1. Termin)</reading>
        <reading>Organisation und Architektur von Rechnern</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
     <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>logik_klausur_termin1_lsg.pdf</file>
        </examiners>
</log>
        <file>OAR_Klausur.pdf</file>
    </log>
 
    <log>
        <date>2006</date>
        <reading>Computer Networks and Internetworking</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>cn_klausur06.pdf</file>
    </log>
 
     <log>
        <date>2011</date>
        <reading>Datenbanktechnologie</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Klein</examiner>
        </examiners>
        <file>Klein_Datenbanktechnologie_022011.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2011</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>2-Nachklausur_Fortgeschrittene_Programmierung_pdf_exercises.pdf</file>
        </examiners>
</log>
        <file>BS_KlausurWS1011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2008</date>
  <reading>Deklarative Programmiersprachen</reading>
        <reading>Mathematik für Informatiker 1</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Bergweiler</examiner>
  <file>DPS_Pruefung_072014.pdf</file>
        </examiners>
</log>
        <file>Bergweiler_Inf_Mathe1_2008.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2011</date>
  <reading>Deklarative Programmiersprachen</reading>
        <reading>Qualitätssicherungsmanagement, Generative Software-Entwicklung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Speck</examiner>
  <file>Protokolldeklspr.pdf</file>
        </examiners>
</log>
        <file>Speck_D_QSM_GSE_Feb2011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>XML</reading>
        <reading>Betriebssysteme</reading>
  <type>schrftlich</type>
      <extra>2. Termin - 1. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>AufgabenXML2.pdf</file>
        </examiners>
</log>
        <file>SysInfIIIBS1.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin - 2. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Langfeld</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>MatheC_WS1314_Klausur2.pdf‎</file>
        </examiners>
</log>
        <file>SysInfIIIBS2.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin - 3. Seite</extra>
  <examiners>
        <type>schriftlich</type>
     <examiner>Langfeld</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>MatheC-WS1314-2PZ.pdf‎</file>
        </examiners>
</log>
        <file>SysInfIIIBS3.pdf</file>
    </log>
 
    <log>
        <date>2009</date>
        <reading>Betriebssysteme</reading>
      <extra>2. Termin - 4. Seite</extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>SysInfIIIBS4.pdf</file>
    </log>
 
    <log>
        <date>2010</date>
        <reading>Systemorientierte Informatik I</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>Schimmler_SysInfI_2010.pdf</file>
    </log>
 
     <log>
        <date>2011</date>
        <reading>Logikprogrammierung, Kryptographie</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Hanus</examiner>
            <examiner>Wilke</examiner>
        </examiners>
        <file>Hanus_Wilke_D_Logik_Krypto_2011.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>Digitale Systeme (1. Termin, mit Lösungen)</reading>
        <reading>Datenbanken</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Klausur1-DigiSys-WS2013-14.pdf‎</file>
        </examiners>
</log>
        <file>datenbanken_2009.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Langfeld</examiner>
  </examiners>
  <file>MatheC_WS1314_Klausur1.pdf‎</file>
</log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>Kommunikationssysteme</reading>
        <reading>Informatik IV</reading>
  <type>schrftlich</type>
      <extra>Nachschreibklausur</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Luttenberger</examiner>
        <examiners>
  </examiners>
            <examiner>Jansen</examiner>
  <file>Kommunikationssysteme_Luttenberger_2.Termin_SS14.pdf</file>
        </examiners>
</log>
        <file>nk_informatikiv_2009.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Kryptographie 2014 2. Prüfungszeitraum.pdf</file>
</log>


<log>
    <log>
  <date>2013</date>
        <date>2009</date>
  <reading>Compilerbau</reading>
        <reading>Betriebssysteme</reading>
  <type>mündlich</type>
      <extra>2. Termin - 6. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Compilerbau-SS13.pdf</file>
        </examiners>
</log>
        <file>SysInfIIIBS6.pdf</file>
    </log>


<log>
    <log>
  <date>2019</date>
        <date>2009</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin - 7. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>fortprog_hanus_ws1819_pz1.pdf</file>
        </examiners>
</log>
        <file>SysInfIIIBS7.pdf</file>
    </log>
 
    <log>
        <date>2009</date>
        <reading>Betriebssysteme</reading>
      <extra>2. Termin - 8. Seite</extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>SysInfIIIBS8.pdf</file>
    </log>


<log>
    <log>
  <date>2018</date>
        <date>2009</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin - 9. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>fortprog_hanus_ws1718_pz2.pdf</file>
        </examiners>
</log>
        <file>SysInfIIIBS9.pdf</file>
    </log>


<log>
    <log>
  <date>2019</date>
        <date>2009</date>
  <reading>Computersysteme (1. Termin)</reading>
        <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
      <extra>2. Termin - 10. Seite</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Koch</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Koch_Compsys_WS1819_1.pdf</file>
        </examiners>
</log>
        <file>SysInfIIIBS10.pdf</file>
    </log>


<log>
  <date>2018</date>
  <reading>Numerische Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Börm</examiner>
  </examiners>
  <file>Numprog_SS18_boerm.pdf</file>
</log>


    <log>
        <date>2010</date>
        <reading>Generative Software-Entwicklung, Qualitätssicherungsmanagement</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Speck</examiner>
        </examiners>
        <file>d_speck_122010.pdf</file>
    </log>


<log>
  <date>2007</date>
  <reading>MfI</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Bergweiler</examiner>
  </examiners>
  <file>Bergweiler_VD_MfI_092007.pdf</file>
</log>


<log>
        <log>
  <date>2009</date>
        <date>2009</date>
  <reading>MfI2, Logik</reading>
        <reading>Datenbanksysteme1, Betriebssysteme</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Bergweiler, Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>Bergweiler_Wilke_VD_MfI2_Logik_052009.pdf</file>
            <examiner>von Hanxleden</examiner>
</log>
        </examiners>
        <file>vonHanxleden_Klein_VD_BS_DB_092009.pdf</file>
    </log>


<log>
  <date>1999</date>
  <reading>Theoretische Informatik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Berghammer_D_Theo_alt_96-99.pdf</file>
</log>


<log>
    <log>
  <date>1999</date>
        <date>2009</date>
  <reading>Effiziente Algorithen, DB</reading>
        <reading>Datenbanksysteme1</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer, Kandzia</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Berghammer_Kandzia_D_Theo_042001.pdf</file>
        </examiners>
</log>
        <file>Thalheim_D_DBS1_2009.pdf</file>
    </log>
 
    <log>
        <date>2008</date>
        <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Simon</examiner>
            <examiner>Valkema</examiner>
        </examiners>
        <file>Valkema_MAG_SystematischesProgrammieren_InformatikNebenfaechler_042008.pdf</file>
    </log>


<log>
    <log>
  <date>1998</date>
        <date>2007</date>
  <reading>VD Informatik</reading>
        <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>Berghammer_VD_InfA_alt_96-98.pdf</file>
        </examiners>
</log>
        <file>von_Hanxleden_D_Echtzeitsysteme_022007.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>2007</date>
  <reading>VD Informatik</reading>
        <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>Berghammer_VD_InfoB_102004.pdf</file>
        </examiners>
</log>
        <file>vonHanxleden_D_Echtzeitsysteme_102007.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
        <date>2008</date>
  <reading>VD Informatik</reading>
        <reading>DSW, Logik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Srivastav</examiner>
  <file>Berghammer_VD_InfoB_102005.pdf</file>
            <examiner>Wilke</examiner>
</log>
        </examiners>
        <file>Srivastav_Wilke_VD_DSW_Logik_10-2008.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
        <date>2010</date>
  <reading>VD Informatik</reading>
        <reading>Künstiche Intelligenz</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Simon</examiner>
  <file>Berghammer_VD_InfoB_102005_2.pdf</file>
        </examiners>
</log>
        <file>Simon_Bsc_KI_022010.pdf</file>
    </log>


<log>
    <log>
  <date>2005</date>
        <date>2011</date>
  <reading>VD Informatik</reading>
        <reading>Organisation und Architektur von Rechnern</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Berghammer_VD_InfoB_102005_3.pdf</file>
        </examiners>
</log>
        <file>klausur_oar_ss11_v1.pdf</file>
    </log>


<log>
    <log>
  <date>2018</date>
        <date>2008</date>
  <reading>IT Recht (1. Termin)</reading>
        <reading>Bildverarbeitung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Lindhorst</examiner>
        <examiners>
  </examiners>
            <examiner>Sommer</examiner>
  <file>it-recht_lindhorst_ss18_pz1.pdf</file>
        </examiners>
</log>
        <file>Sommer_D_Bildverarbeitung_092008.pdf</file>
    </log>


<log>
  <date>2018</date>
  <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Sandro Esquivel</examiner>
  </examiners>
  <file>BSKS_Klausur_SS_2018.1.pdf</file>
</log>


<log>
    <log>
  <date>2018</date>
        <date>2009</date>
  <reading>Softwaretecknik (1. Termin)</reading>
        <reading>eCommerce, Generative Programmierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hasselbring</examiner>
        <examiners>
  </examiners>
            <examiner>Speck</examiner>
  <file>swt_hasselbring_ss18_pz1.pdf</file>
        </examiners>
</log>
        <file>Speck_D_ecommerce_genprog_082009.pdf</file>
    </log>


<log>
    <log>
  <date>2017</date>
        <date>2004</date>
  <reading>Algorithmen und Datenstrukturen (2. Termin)</reading>
        <reading>Fuzzy, KI</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Jansen</examiner>
        <examiners>
  </examiners>
            <examiner>Salski</examiner>
  <file>Ads_jansen_ss17_pz2.pdf</file>
        </examiners>
</log>
        <file>Salski_D_Theo_072004.pdf</file>
    </log>


<log>
    <log>
  <date>2018</date>
        <date>2007</date>
  <reading>Computersysteme (2. Termin)</reading>
        <reading>Fuzzy, KI</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Salski</examiner>
  <file>Computersysteme_WS1718_2.pdf</file>
        </examiners>
</log>
        <file>Salski_D_Theo_072007.pdf</file>
    </log>


    <log>
        <date>2007</date>
        <reading>SysInfI, SysInfIII</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>Schimmler_Luttenberger_VD_SysInfI_SysInfIII_102007.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2007</date>
  <reading>Programmierung (2. Termin)</reading>
        <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Simon</examiner>
  <file>Klausur--Programmierung--2014-04-08.pdf</file>
            <examiner>Valkema</examiner>
</log>
        </examiners>
        <file>Simon_Valkema_Zertifikat_022007_02.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>1995</date>
  <reading>Digitale Systeme (2. Termin)</reading>
        <reading>Logik</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Potthoff</examiner>
  <file>DigitaleSysteme_2014_2.pdf</file>
        </examiners>
</log>
        <file>Potthoff_D_Logik_alt_92-95.pdf</file>
    </log>


    <log>
        <date>1996</date>
        <reading>Logik</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Potthoff</examiner>
        </examiners>
        <file>Potthoff_VD_InfA_alt_96.pdf</file>
    </log>


<log>
  <date>2014</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>MathematikA_2014_1.pdf</file>
</log>


<log>
    <log>
  <date>2014</date>
        <date>2008</date>
  <reading>Programmierung (1. Termin)</reading>
        <reading>Internet Communication</reading>
  <type>schriftlich</type>
      <extra>Test-Prüfung</extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Peters</examiner>
  <file>Programmierung_2014_1.pdf</file>
        </examiners>
</log>
        <file>Peters_TestD_InternetCommunication_042008.pdf</file>
<log>
    </log>
  <date>2014</date>
 
  <reading>Graphentheorie (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivistav</examiner>  
</examiners>
  <file>srivastav_graphentheorie_2014_1.pdf</file>
</log>


<log>
    <log>
  <date>2014</date>
        <date>2004</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>MatheA_WS1314_2PZ.pdf</file>
        </examiners>
</log>
        <file>Luttenberger_D_Prakt_102004.pdf</file>
    </log>


<log>
    <log>
  <date>2014</date>
        <date>2009</date>
  <reading>Wirtschaftsinformatik 3 (1. Termin)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Thalheim</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Wirtschaftsinformatik_3_WS1314_PZ1_Thalheim.pdf</file>
        </examiners>
</log>
        <file>Luttenberger_D_Rechnernetze_IC_2009.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2007</date>
  <reading>Mathematik für Informatiker A (Probeklausur)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>MaInf_A_PrKl_WS1314.pdf</file>
        </examiners>
</log>
        <file>Luttenberger_D_VerteilteSysteme-Rechnernetze_092007.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2008</date>
  <reading>Kommunikatiossysteme (2. Termin)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Luttenberger</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>Kommunikationssysteme_SoSe13_(erster_Zeitraum).pdf‎</file>
        </examiners>
</log>
        <file>Luttenberger_IC_CN_092008.pdf</file>
    </log>


    <log>
        <date>2005</date>
        <reading>Computer Networks</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>luttenberger_VD_rechnernetze_200507.pdf</file>
    </log>


<log>
  <date>2013</date>
  <reading>Mathematik für Informatiker B (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Langfeld</examiner>
  </examiners>
  <file>MatheB_SS_2013_1.pdf</file>
</log>


<log>
    <log>
  <date>2013</date>
        <date>2009</date>
  <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
     <examiner>Börm</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>ADS_SS_2013_1.pdf</file>
        </examiners>
</log>
        <file>Luttenberger_D_cn_ic_042009.pdf</file>
    </log>
 
    <log>
        <date>2008</date>
        <reading>Internet Communications</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>Luttenberger_D_InternetCommunication_042008.pdf</file>
     </log>
 
    <log>
        <date>2008</date>
        <reading>Internet Communications, Computer Networks</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>Luttenberger_D_InternetCommunications_042008.pdf</file>
    </log>
 
    <log>
        <date>2008</date>
        <reading>Internet Communications, Computer Networks</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>Luttenberger_D_Internet_Communications_CommunicationNetworks_042008.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2006</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
        <reading>Internet Communications, Computer Networks</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
</examiners>
            <examiner>Luttenberger</examiner>
  <file>Hanus_FortProg_2013_Termin1.pdf</file>
        </examiners>
</log>
        <file>Luttenberger_D_Kommunikationssysteme_082006.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2015</date>
  <reading>Informationssysteme - Hauptfach (1. Termin)</reading>
        <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schnoor</examiner>
        <examiners>
</examiners>
            <examiner>Schimmler</examiner>
  <file>informationssyteme_hauptfach_sose2013.pdf</file>
        </examiners>
</log>
        <file>DigiSys_Schimmler_WS14-15_PZ1.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2002</date>
  <reading>Nebenläufige und verteilte Programmierung</reading>
        <reading>Betriebssysteme, Abstrakte Maschinen</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Huch</examiner>  
        <examiners>
</examiners>
            <examiner>Kluge</examiner>
  <file>Huch_NVP_2013.pdf</file>
        </examiners>
</log>
        <file>Kluge_D_Prakt_062002.pdf</file>
    </log>


<log>
  <date>2013</date>
  <reading>Betriebssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>BS_Klausur_WS2013_P1.pdf</file>
</log>


<log>
    <log>
  <date>2013</date>
        <date>2008</date>
  <reading>Softwaretechnik (1. Termin)</reading>
        <reading>Informatik2, Informatik 4</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Nowotka</examiner>
        <examiners>
  </examiners>
            <examiner>Jansen</examiner>
  <file>SWT_Klausur_WS2013_P1.pdf</file>
            <examiner>Wilke</examiner>
</log>
        </examiners>
        <file>Jansen_Wilke_VD_Inf2_Inf4_102008.pdf</file>
    </log>


    <log>
        <date>1999</date>
        <reading>Datenbanken</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Klein</examiner>
        </examiners>
        <file>Klein_D_Prakt_alt_93-99.pdf</file>
    </log>


<log>
    <log>
  <date>2013</date>
        <date>2008</date>
  <reading>Informationssysteme - Nebenfach (1. Termin)</reading>
        <reading>Datenbanken, Betriebssysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Schnoor</examiner>
        <examiners>
</examiners>
            <examiner>Klein</examiner>
  <file>informationssysteme_nebenfach_sose2013.pdf</file>
            <examiner>von Hanxleden</examiner>
</log>
        </examiners>
        <file>Klein_von_Hanxleden_VD_DB_BS_092008.pdf</file>
    </log>


<log>
  <date>2016</date>
  <reading>Nebenläufige und verteilte Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Huch</examiner>
  </examiners>
  <file>prüfungsprotokoll nebenläufige und verteilte programmierung.pdf</file>
</log>


<log>
    <log>
  <date>2016</date>
        <date>2009</date>
  <reading>Softwaretechnik</reading>
        <reading>Informatik1, Informatik4</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
     <examiner>Hasselbring</examiner>
        <examiners>
  </examiners>
            <examiner>Hanus, Wilke</examiner>
  <file>Softwaretechnik-Prüfungsprotokoll1516.pdf</file>
        </examiners>
</log>
        <file>HanusWilke_VD_Inf1_Inf4_Okt2009.pdf</file>
     </log>
 
    <log>
        <date>1991</date>
        <reading>Vordiplom</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Haehl</examiner>
        </examiners>
        <file>Haehl_VD_Alg_alt_85-91.pdf</file>
    </log>


<log>
    <log>
  <date>2016</date>
        <date>2008</date>
  <reading>Informationssysteme (1. Termin)</reading>
        <reading>Nebenläufige Programmierung, Verteilte Algorithmen</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Thalheim</examiner>
        <examiners>
  </examiners>
            <examiner>deRoever</examiner>
  <file>InfSys_WS2015_Klausur.pdf</file>
        </examiners>
</log>
        <file>deRoever_D_Nebelaeufige_Programmierung_und_Verteilte_Algorithmen_042008.pdf</file>
    </log>


<log>
    <log>
  <date>2016</date>
        <date>2003</date>
  <reading>XML (1. Termin)</reading>
        <reading>Verteilte Algorithmen</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Luttenberger</examiner>
        <examiners>
  </examiners>
            <examiner>deRoever</examiner>
  <file>XML-Klausur-1pz-ws1516.pdf</file>
        </examiners>
</log>
        <file>deRoever_D_Theo_022003.pdf</file>
    </log>


<log>
    <log>
  <date>2016</date>
        <date>2000</date>
  <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
        <reading>Informatik4, Logik</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>von Hanxleden</examiner>
        <examiners>
  </examiners>
            <examiner>deRoever</examiner>
  <file>Entwurf eingebetteter Echtzeitsysteme _ WiSe 15_16 _ Zeitraum 1 _ Note 1,7.pdf</file>
        </examiners>
</log>
        <file>deRoever_VD_InfA_alt.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2007</date>
  <reading>Softwaretechnik (2. Termin)</reading>
        <reading>Verteilte Algorithmen, Synchrone Sprachen</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hasselbring</examiner>
        <examiners>
  </examiners>
            <examiner>deRoever, von Hanxleden</examiner>
  <file>Softwaretechnik-Nachklausurneu.pdf</file>
        </examiners>
</log>
        <file>DeRoeverVonHanxleden_D_VerteilteAlgorithmen_SynchroneSprachen_072007.pdf</file>
    </log>


    <log>
        <date>2003</date>
        <reading>Datenbanksysteme1</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Kandzia</examiner>
        </examiners>
        <file>Kandzia_D_Theo_022003.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>1999</date>
  <reading>Prinzipien von Programmiersprachen, Logikprogrammierung</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Kandzia</examiner>
  <file>D_Hanus_Programmierung_032007.pdf</file>
        </examiners>
</log>
        <file>Kandzia_D_Theo_alt_89-99.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
        <date>2009</date>
  <reading>Prinzipien von Programmiersprachen und Funktionale Programmierung</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
     <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>DiplPruefungHanus.pdf</file>
        </examiners>
</log>
        <file>Klein D Datenbanksysteme I, Datenbanktheorie.pdf</file>
     </log>
 
    <log>
        <date>2007</date>
        <reading>Datenbanken</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Klein</examiner>
        </examiners>
        <file>Klein_D_DB_092007.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>2006</date>
  <reading>Synchrone Sprachen, Internet Communication</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Luttenberger, von Hanxleden</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>D_Luttenberger_vonHanxleden_032007.pdf</file>
        </examiners>
</log>
        <file>Klein_D_DBS1_082006.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
        <date>2001</date>
  <reading>Nebenläufige Programmierung, Verteilte Algorithmen</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>deRoever</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>deRoever_D_Nebelaeufige_Programmierung_und_Verteilte_Algorithmen_042008.pdf</file>
        </examiners>
</log>
        <file>Klein_D_Prakt_042001.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
        <date>2002</date>
  <reading>Verteilte Algorithmen</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>deRoever</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>deRoever_D_Theo_022003.pdf</file>
        </examiners>
</log>
        <file>Klein_D_Prakt_042002.pdf</file>
    </log>


<log>
    <log>
  <date>2000</date>
        <date>2001</date>
  <reading>Informatik4, Logik</reading>
        <reading>Datenbanken</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>deRoever</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>deRoever_VD_InfA_alt.pdf</file>
        </examiners>
</log>
        <file>Klein_D_Prakt_072001.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>2016</date>
  <reading>Verteilte Algorithmen, Synchrone Sprachen</reading>
        <reading>XML</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>deRoever, von Hanxleden</examiner>
        <examiners>
  </examiners>
            <examiner>Luttenberger</examiner>
  <file>DeRoeverVonHanxleden_D_VerteilteAlgorithmen_SynchroneSprachen_072007.pdf</file>
        </examiners>
</log>
        <file>XML-Klausur-1pz-ws1516.pdf</file>
    </log>


<log>
    <log>
  <date>2003</date>
        <date>2014</date>
  <reading>Datenbanksysteme1</reading>
        <reading>Wirtschaftsinformatik 3</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Kandzia</examiner>  
        <examiners>
</examiners>
            <examiner>Thalheim</examiner>
  <file>Kandzia_D_Theo_022003.pdf</file>
        </examiners>
</log>
        <file>Wirtschaftsinformatik_3_WS1314_PZ1_Thalheim.pdf</file>
    </log>


<log>
    <log>
  <date>1999</date>
        <date>2014</date>
  <reading>Datenbanken</reading>
        <reading>Digitale Systeme</reading>
  <type>mündlich</type>
      <extra>2. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Kandzia</examiner>  
        <examiners>
</examiners>
            <examiner>Schimmler</examiner>
  <file>Kandzia_D_Theo_alt_89-99.pdf</file>
        </examiners>
</log>
        <file>DigitaleSysteme_2014_2.pdf</file>
    </log>
 
    <log>
        <date>1999</date>
        <reading>Theoretische Informatik</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Berghammer</examiner>
        </examiners>
        <file>Berghammer_D_Theo_alt_96-99.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
        <date>1999</date>
  <reading>Datenbanken</reading>
        <reading>Effiziente Algorithen, DB</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Klein</examiner>  
        <examiners>
</examiners>
            <examiner>Berghammer, Kandzia</examiner>
  <file>Klein D Datenbanksysteme I, Datenbanktheorie.pdf</file>
        </examiners>
</log>
        <file>Berghammer_Kandzia_D_Theo_042001.pdf</file>
    </log>


<log>
  <log>
   <date>2007</date>
      <date>2009</date>
  <reading>Datenbanken</reading>
      <reading>Betriebssysteme</reading>
  <type>mündlich</type>
      <extra>2. Termin - 5. Seite</extra>
  <examiners>
      <type>schriftlich</type>
    <examiner>Klein</examiner>  
      <examiners>
</examiners>
          <examiner>Luttenberger</examiner>
  <file>Klein_D_DB_092007.pdf</file>
      </examiners>
</log>
      <file>SysInfIIIBS5.pdf</file>
  </log>
    
    <log>
        <date>1998</date>
        <reading>VD Informatik</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Berghammer</examiner>
        </examiners>
        <file>Berghammer_VD_InfA_alt_96-98.pdf</file>
    </log>


<log>
    <log>
  <date>2006</date>
        <date>2004</date>
  <reading>Datenbanken</reading>
        <reading>VD Informatik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Klein</examiner>  
        <examiners>
</examiners>
            <examiner>Berghammer</examiner>
  <file>Klein_D_DBS1_082006.pdf</file>
        </examiners>
</log>
        <file>Berghammer_VD_InfoB_102004.pdf</file>
    </log>


<log>
    <log>
  <date>2001</date>
        <date>2005</date>
  <reading>Datenbanken</reading>
        <reading>VD Informatik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Klein</examiner>  
        <examiners>
</examiners>
            <examiner>Berghammer</examiner>
  <file>Klein_D_Prakt_042001.pdf</file>
        </examiners>
</log>
        <file>Berghammer_VD_InfoB_102005.pdf</file>
    </log>


<log>
    <log>
  <date>2002</date>
        <date>2005</date>
  <reading>Datenbanken</reading>
        <reading>VD Informatik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Klein</examiner>  
        <examiners>
</examiners>
            <examiner>Berghammer</examiner>
  <file>Klein_D_Prakt_042002.pdf</file>
        </examiners>
</log>
        <file>Berghammer_VD_InfoB_102005_2.pdf</file>
    </log>


<log>
    <log>
  <date>2001</date>
        <date>2005</date>
  <reading>Datenbanken</reading>
        <reading>VD Informatik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Klein</examiner>  
        <examiners>
</examiners>
            <examiner>Berghammer</examiner>
  <file>Klein_D_Prakt_072001.pdf</file>
        </examiners>
</log>
        <file>Berghammer_VD_InfoB_102005_3.pdf</file>
    </log>


    <log>
        <date>2007</date>
        <reading>MfI</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Bergweiler</examiner>
        </examiners>
        <file>Bergweiler_VD_MfI_092007.pdf</file>
    </log>


<log>
    <log>
  <date>2008</date>
        <date>2009</date>
  <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
        <reading>MfI2, Logik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
  </examiners>
            <examiner>Bergweiler, Wilke</examiner>
  <file>Jansen_D_EffAlg_ApproxAlg_062008.pdf</file>
        </examiners>
</log>
        <file>Bergweiler_Wilke_VD_MfI2_Logik_052009.pdf</file>
    </log>


    <log>
        <date>2014</date>
        <reading>Digitale Systeme</reading>
      <extra>1. Termin mit Lösungen</extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>Klausur1-DigiSys-WS2013-14.pdf</file>
    </log>


<log>
  <date>2009</date>
  <reading>Nebenläufige und verteilte Programmierung, Softwaretechnik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Huch</examiner> 
<examiner>Goerigk</examiner> 
</examiners>
  <file>huch_goerigk_D_Nebprog_softtech_062009.pdf</file>
</log>


    <log>
        <date>2014</date>
        <reading>XML</reading>
        <extra></extra>
        <type>schrftlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>AufgabenXML2.pdf</file>
    </log>
    <log>
        <date>2011</date>
        <reading>Fuzzy-Methoden</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Salski</examiner>
        </examiners>
        <file>protokoll_fuzzy.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>2011</date>
  <reading>Übersetzerbau, Funktionale Programmierung</reading>
        <reading>E-Business und e-Marketing</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Speck</examiner>
  <file>Hanus_D__PrakInf.pdf</file>
        </examiners>
</log>
        <file>EBusiness_eMarketing.pdf</file>
    </log>


<log>
    <log>
  <date>2007</date>
        <date>2000</date>
  <reading>Deklarative Programmiersprachen</reading>
        <reading>Semantik, Effiziente Algorithmen</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>mündlich</type>
     <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Berghammer</examiner>
  <file>Hanus_VL_DPS_082007.pdf</file>
        </examiners>
</log>
        <file>Berghammer_D_Theo_102000.pdf</file>
     </log>
    <log>
        <date>2011</date>
        <reading>Betriebliche Informationssysteme</reading>
        <extra></extra>
        <type>mündlich</type>
        <examiners>
            <examiner>Speck</examiner>
        </examiners>
        <file>Betriebliche_Informationssysteme.pdf</file>
    </log>


<log>
    <log>
  <date>2009</date>
        <date>1999</date>
  <reading>Informatik1, Informatik4</reading>
        <reading>Inf Programmierung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus, Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Berghammer</examiner>
  <file>HanusWilke_VD_Inf1_Inf4_Okt2009.pdf</file>
        </examiners>
</log>
        <file>Berghammer_Inf_Programmierung_1999_01.pdf</file>
    </log>


<log>
    <log>
  <date>1991</date>
        <date>2003</date>
  <reading>Vordiplom</reading>
        <reading>Inf Programmierung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Haehl</examiner>
        <examiners>
  </examiners>
            <examiner>Berghammer</examiner>
  <file>Haehl_VD_Alg_alt_85-91.pdf</file>
        </examiners>
</log>
        <file>Berghammer_Inf_Programmierung_2003_01.PDF</file>
    </log>


<log>
    <log>
  <date>2006</date>
        <date>2006</date>
  <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
        <reading>Organisation und Archtitektur von Rechnern</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
  </examiners>
            <examiner>von Hanxleden</examiner>
  <file>Jansen_D_EffApprAlg_082006.pdf</file>
        </examiners>
</log>
        <file>VonHanxleden Inf OAR 2006.pdf</file>
    </log>


    <log>
        <date>2006</date>
        <reading>Informatik 2: Algorithmen und Datenstrukturen</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Jansen</examiner>
        </examiners>
        <file>Jansen Inf AlgorithmenDatenstrukturen 2006.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>2004</date>
  <reading>Effiziente Algorithmen, Approximative Algorithmen</reading>
        <reading>Logik</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
  </examiners>
            <examiner>Rösler</examiner>
  <file>Jansen_D_Theo_012004.pdf</file>
        </examiners>
</log>
        <file>Roesler Logik 2004.pdf</file>
    </log>


<log>
    <log>
  <date>2004</date>
        <date>2006</date>
  <reading>Effiziente Algorithmen</reading>
        <reading>Parallele Architekturen und Algorithmen</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
     <examiner>Jansen</examiner>  
        <examiners>
  </examiners>
            <examiner>Schimmler</examiner>
  <file>Jansen_D_Theo_072004.pdf</file>
        </examiners>
</log>
        <file>Schimmler Inf ParalleleArchitekturen 2006.pdf</file>
    </log>
 
     <log>
        <date>2008</date>
        <reading>Digitale Systeme</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>Schimmler Inf DigitaleSysteme 2008.pdf</file>
    </log>
 
    <log>
        <date>2009</date>
        <reading>Digitale Systeme</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Schimmler</examiner>
        </examiners>
        <file>Schimmler sysinfI ws0809.PDF</file>
    </log>


<log>
  <date>2004</date>
  <reading>Effiziente Algorithmen, Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Jansen</examiner> 
  </examiners>
  <file>Jansen_D_Theo_102004.pdf</file>
</log>


<log>
    <log>
  <date>2009</date>
        <date>2007</date>
  <reading>Effiziente Algorithmen, Kombinatorische Optimierung</reading>
        <reading>Inf Programmierung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
    <examiner>Srivastav</examiner>
            <examiner>Berghammer</examiner>
</examiners>
        </examiners>
  <file>Jansen_Srivastav_D_EffizienteAlg_KombOpt_042009.pdf</file>
        <file>Berghammer Inf Programmierung 2007.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2006</date>
        <date>2004</date>
  <reading>Effiziente Algorithmen, Kryptographie</reading>
        <reading>Inf Programmierung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
    <examiner>Wilke</examiner>
            <examiner>Berghammer</examiner>
</examiners>
        </examiners>
  <file>Jansen_Wilke_D_Theo_032006.pdf</file>
        <file>Berghammer Inf Programmierung 2004.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2008</date>
        <date>2005</date>
  <reading>Informatik2, Informatik 4</reading>
        <reading>Inf Programmierung</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Jansen</examiner>  
        <examiners>
    <examiner>Wilke</examiner>
            <examiner>Berghammer</examiner>
</examiners>
        </examiners>
  <file>Jansen_Wilke_VD_Inf2_Inf4_102008.pdf</file>
        <file>Berghammer Inf Programmierung 2005.PDF</file>
</log>
    </log>


<log>
  <date>1999</date>
  <reading>Datenbanken</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Klein</examiner> 
</examiners>
  <file>Klein_D_Prakt_alt_93-99.pdf</file>
</log>


<log>
    <log>
  <date>2008</date>
        <date>2005</date>
  <reading>Datenbanken, Betriebssysteme</reading>
        <reading>Digitale Systeme</reading>
  <type>mündlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Klein</examiner>
        <examiners>
    <examiner>von Hanxleden</examiner>  
            <examiner>Schimmler</examiner>
</examiners>
        </examiners>
  <file>Klein_von_Hanxleden_VD_DB_BS_092008.pdf</file>
        <file>Schimmler Inf DigitaleSysteme 2005.pdf</file>
</log>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2007</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
        <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Wilke</examiner>
        <examiners>
  </examiners>
            <examiner>Srivastav</examiner>
  <file>Logik SS15.pdf</file>
        </examiners>
</log>
        <file>Srivastav Inf DiskreteStrukturen 2004.pdf</file>
    </log>
 
    <log>
        <date>2006</date>
        <reading>Diskrete Strukturen und Wahrscheinlichkeitstheorie</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Srivastav</examiner>
        </examiners>
        <file>Srivastav Inf DiskreteStrukturen 2006.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Mathematik für Informatiker B (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Braack</examiner>
  </examiners>
  <file>Klausur mathe b15.pdf</file>
</log>


    <log>
        <date>2007</date>
        <reading>Softwaretechnologie</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Thalheim</examiner>
        </examiners>
        <file>Thalheim Inf Softwaretechnologie 2007.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2006</date>
  <reading>Fortgeschrittene Programmierung</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
      <extra>Nebenfächler - Nachschreibklausur</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>2015SS_FortProg_Hanus.pdf</file>
        </examiners>
</log>
        <file>Thalheim DatenbanksystemeNebenfaechlerNachschreiber 2006 01.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2006</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
        <reading>Datenbanksysteme</reading>
  <type>mündlich</type>
      <extra>Nebenfächler</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hasselbring</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>Prüfungsprotokoll zu SEPDS.pdf</file>
        </examiners>
</log>
        <file>Thalheim DatenbanksystemeNebenfaechler 2006.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2005</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Srivastav</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>TGI_Srivastav_WS14-15_PZ2.pdf</file>
        </examiners>
</log>
        <file>Thalheim Inf Datenbanksysteme 2005.pdf</file>
    </log>


<log>
    <log>
  <date>2015</date>
        <date>2005</date>
  <reading>Digitale Systeme (1. Termin)</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
      <extra>Nachschreibklausur</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Thalheim</examiner>
  <file>DigiSys_Schimmler_WS14-15_PZ1.pdf</file>
        </examiners>
</log>
        <file>Thalheim Inf DatenbanksystemeNachschreiber 2005.pdf</file>
    </log>


<log>
  <date>2002</date>
  <reading>Betriebssysteme, Abstrakte Maschinen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Kluge</examiner> 
</examiners>
  <file>Kluge_D_Prakt_062002.pdf</file>
</log>




    <log>
        <date>2007</date>
        <reading>Logik fuer Informatiker</reading>
        <extra></extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Spinas</examiner>
        </examiners>
        <file>Spinas Logik 2007.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Softwaretechnik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hasselbring</examiner>
  </examiners>
  <file>Softwaretechnik-Klausur1415neu.pdf</file>
</log>


<log>
  <date>2015</date>
  <reading>Theoretische Grundlagen der Informatik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
  </examiners>
  <file>TGI_Srivastav_WS14-15_PZ1.pdf</file>
</log>


<log>
  <date>2014</date>
  <reading>Mathematik für Informatiker B (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Langfeld</examiner>
  </examiners>
  <file>MatheB-Klausur2014.pdf</file>
</log>


<log>
    <log>
  <date>2015</date>
        <date>2008</date>
  <reading>Codierungstheorie</reading>
        <reading>Mathematik für Informatiker 2</reading>
  <type>mündlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Langfeld</examiner>
        <examiners>
  </examiners>
            <examiner>Bergweiler</examiner>
  <file>Pruefungsprotokoll_CodTh.pdf</file>
        </examiners>
</log>
        <file>Bergweiler Inf Mathe2 2008.pdf</file>
    </log>


<log>
  <date>2015</date>
  <reading>Modellierung von Echtzeitsystemen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>EmSys1415.pdf</file>
</log>


<log>
    <log>
  <date>2015</date>
        <date>2008</date>
  <reading>IT Recht (1. Termin)</reading>
        <reading>Mathematik für Informatiker 1</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Lindhorst</examiner>
        <examiners>
  </examiners>
            <examiner>Bergweiler</examiner>
  <file>Klausur IT 15.pdf</file>
        </examiners>
</log>
        <file>Bergweiler Inf Mathe1Nachschreiber 2008.pdf</file>
    </log>


<log>
    <log>
  <date>2016</date>
        <date>2006</date>
  <reading>Digitale Systeme</reading>
        <reading>Mathematik für Informatiker 2</reading>
  <type>schriftlich</type>
      <extra>2. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Bergweiler</examiner>
  <file>DigiSys16-Version.pdf</file>
        </examiners>
</log>
        <file>Bergweiler Inf Mathe2 2006 01.PDF</file>
    </log>




<log>
    <log>
  <date>2012</date>
        <date>2006</date>
  <reading>Synchrone Sprachen</reading>
        <reading>Inf Logikprogrammierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
<examiner>von Hanxleden</examiner>  
        <examiners>
</examiners>
            <examiner>Hanus</examiner>
  <file>SynchroneSprachenKlausurWS 20112012.pdf</file>
        </examiners>
</log>
        <file>Hanus Inf Logikprogrammierung 2006.pdf</file>
    </log>


<log>
    <log>
  <date>2012</date>
        <date>2001</date>
  <reading>Programmierung</reading>
        <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
<examiner>Hanus</examiner>  
        <examiners>
</examiners>
            <examiner>Hanus</examiner>
  <file>Programmierung2012.pdf</file>
        </examiners>
</log>
        <file>Hanus Inf Programmierung 2001.pdf</file>
    </log>


<log>
  <date>2012</date>
  <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Hasselbring</examiner>   
</examiners>
  <file>Klausur_Sofwaretechnik_2012.pdf</file>
</log>


<log>
    <log>
  <date>2011</date>
        <date>2008</date>
  <reading>Algorithmen und Datenstrukturen</reading>
        <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
<examiner>Jansen</examiner>   
        <examiners>
</examiners>
            <examiner>Hanus</examiner>
  <file>Jansen_Algorithmen_und_Datenstrukturen2011.pdf</file>
        </examiners>
</log>
        <file>Hanus Inf Programmierung 2008.pdf</file>
 
    </log>
<log>
  <date>2012</date>
  <reading>Software-Architektur</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner>  
</examiners>
  <file>PruefungsprotokollSoftArch032012.pdf</file>
</log>


    <log>
        <date>2001</date>
        <reading>Inf Programmierung</reading>
      <extra>Mitsemesterklausur</extra>
        <type>schriftlich</type>
        <examiners>
            <examiner>Hanus</examiner>
        </examiners>
        <file>Hanus Inf ProgrammierungMitsemester 2001.pdf</file>
    </log>


<log>
  <date>2006</date>
  <reading>Computer Graphik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Koch</examiner> 
</examiners>
  <file>Koch_D_CompGrafik_032006.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Computer Graphik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Koch</examiner> 
</examiners>
  <file>Koch_D_Computer-Grafik_092007.pdf</file>
</log>
<log>
  <date>2003</date>
  <reading>Computer Graphik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Koch</examiner> 
</examiners>
  <file>Koch_D_Tech_alt.pdf</file>
</log>
<log>
  <date>2003</date>
  <reading>Computer Graphik, Datenbanksysteme1</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Koch</examiner> 
    <examiner>Klein</examiner>
</examiners>
  <file>KochKlein_D_Datenbanken-ComputerGraphik_092007.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Software-Architektur</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner>   
</examiners>
  <file>Pruefungsprotokoll-SoftArch-WS-2011-2012.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Hasselbring</examiner>   
</examiners>
  <file>SWT_Klausur_2010.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Grundlagen der Theoretischen Informatik - Zwischenklausur</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Wilke</examiner>   
</examiners>
  <file>TGI_Midsemester_WS1112.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Ordnungen und Verbände, Automaten, Logiken, Spiele</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
<examiner>Berghammer</examiner> 
</examiners>
  <file>Wilke_Berghammer_Ordnung_Automaten_2011.pdf</file>
</log>
<log>
  <date>1995</date>
  <reading>Logik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Potthoff</examiner> 
</examiners>
  <file>Potthoff_D_Logik_alt_92-95.pdf</file>
</log>
<log>
  <date>1996</date>
  <reading>Logik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Potthoff</examiner> 
</examiners>
  <file>Potthoff_VD_InfA_alt_96.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communication (Test-Prüfung)</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Peters</examiner> 
</examiners>
  <file>Peters_TestD_InternetCommunication_042008.pdf</file>
</log>
<log>
  <date>2004</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_Prakt_102004.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_Rechnernetze_IC_2009.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_VerteilteSysteme-Rechnernetze_092007.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_IC_CN_092008.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>luttenberger_VD_rechnernetze_200507.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_cn_ic_042009.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communications</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_InternetCommunication_042008.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_InternetCommunications_042008.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_Internet_Communications_CommunicationNetworks_042008.pdf</file>
</log>
<log>
  <date>2006</date>
  <reading>Internet Communications, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Luttenberger_D_Kommunikationssysteme_082006.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Huch</examiner> 
</examiners>
  <file>fortgeschrittene_programmierung_2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Logik für Informatiker</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>   
</examiners>
  <file>Wilke_Logik_2011.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Simon</examiner>   
  <examiner>Valkema</examiner> 
</examiners>
  <file>Simon_Valkema_Zertifikat_022007_02.pdf</file>
</log>
<log>
  <date>2004</date>
  <reading>Fuzzy, KI</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Salski</examiner> 
</examiners>
  <file>Salski_D_Theo_072004.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Fuzzy, KI</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Salski</examiner> 
</examiners>
  <file>Salski_D_Theo_072007.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>SysInfI, SysInfIII</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
<examiner>Luttenberger</examiner> 
</examiners>
  <file>Schimmler_Luttenberger_VD_SysInfI_SysInfIII_102007.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Logik in der Informatik (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Wilke</examiner>   
</examiners>
  <file>LogikInDerInformartik_Wilke_2011_2.Prüfungszeitraum.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Bildverarbeitung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Sommer</examiner>   
</examiners>
  <file>Sommer_D_Bildverarbeitung_092008.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>eCommerce, Generative Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Speck</examiner>   
</examiners>
  <file>Speck_D_ecommerce_genprog_082009.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Semantik von Programmiersprachen, Effiziente Algorithmen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Berghammer</examiner> 
<examiner>Jansen</examiner> 
</examiners>
  <file>Berghammer_Jansen_D_Semantik_EffAlg_2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Organisation und Architektur von Rechnern</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Luttenberger</examiner> 
</examiners>
  <file>klausur_oar_ss11_v1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Logik für Informatiker</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
<examiner>Berghammer</examiner> 
</examiners>
  <file>Logik_Protokoll_SS2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Informationssysteme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Klein</examiner> 
</examiners>
  <file>IS_Klausur_SS2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Logik in der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner> 
</examiners>
  <file>Logik_Klausur_SS11.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Künstiche Intelligenz</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Simon</examiner>
</examiners>
  <file>Simon_Bsc_KI_022010.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Logik, DSW</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
<examiner>Srivastav</examiner>
</examiners>
  <file>Wilke_Srivastav_Logik_DSW.pdf</file>
</log>
<log>
  <date>2006</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfA_022006.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfA_102005.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>DSW, Logik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
    <examiner>Wilke</examiner>       
</examiners>
  <file>Srivastav_Wilke_VD_DSW_Logik_10-2008.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfA_Okt2005.pdf</file>
</log>
<log>
  <date>2006</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfIV_Logik022006.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Synchrone Sprachen (Testprüfung)</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Traulsen</examiner>
</examiners>
  <file>Traulsen_TestD_SynchroneSprachen_042008.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Systematisches Programmieren, Informatik für Nebenfächler</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Simon</examiner>
<examiner>Valkema</examiner>
</examiners>
  <file>Valkema_MAG_SystematischesProgrammieren_InformatikNebenfaechler_042008.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>von_Hanxleden_D_Echtzeitsysteme_022007.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_D_Echtzeitsysteme_102007.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Echzeitsysteme, Synchrone Sprachen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_D_Echtzeitsysteme_SynchroneSprachen_072009.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Echzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_D_PrakTech_022007.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Datenbanksysteme1</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
</examiners>
  <file>Thalheim_D_DBS1_2009.pdf</file>
</log>
<log>
  <date>2002</date>
  <reading>Effiziente Algorithmen, Transitionssysteme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_D_Theo_072002.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Kryptographie, Angewandte Automatentheorie</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_D_TheoInf.pdf</file>
</log>
<log>
  <date>2006</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke-InfA-TheoInf_Logik-Oktober2006.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Synchrone Sprachen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_D_SynchroneSprachen_042008.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Datenbanksysteme1, Betriebssysteme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Klein</examiner>
    <examiner>von Hanxleden</examiner>
</examiners>
  <file>vonHanxleden_Klein_VD_BS_DB_092009.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Effiziente Algorithmen, Moderne Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_D_EffAlg_072005.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Kryptographie, Programmierung</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
<examiner>deRoever</examiner>
</examiners>
  <file>Wilke_deRoever_D_Kryptographie_Programmierung_122007.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Theoretische Informatatik, Logik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>
</examiners>
  <file>Wilke_VD_InfoA_102005_2.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 6. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS6.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 7. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS7.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 8. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS8.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 9. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS9.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 10. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS10.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Generative Software-Entwicklung, Qualitätssicherungsmanagement</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Speck</examiner>
  </examiners>
  <file>d_speck_122010.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>NVP, PrinzProg</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Huch</examiner>
<examiner>Hanus</examiner> 
</examiners>
  <file>Huch_Hanus_D_NVP_PPS_2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Synchrone Sprachen, Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
<examiner>Wilke</examiner> 
</examiners>
  <file>Prüfungsprotokoll_vHanxleden_Wilke.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Datenbanken</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Thalheim</examiner>
</examiners>
  <file>datenbanken_2009.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Informatik IV (Nachschreibklausur)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Jansen</examiner>
</examiners>
  <file>nk_informatikiv_2009.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner> 
</examiners>
  <file>klausur.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner> 
</examiners>
  <file>klausur-nachschreib.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Systemorientierte Informatik I</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Schimmler</examiner>
</examiners>
  <file>Schimmler_SysInfI_2010.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Systemorientierte Informatik I (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Schimmler</examiner>
</examiners>
  <file>Schimmler_SysInfI_20102.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Logikprogrammierung, Kryptographie</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner> 
<examiner>Wilke</examiner>
</examiners>
  <file>Hanus_Wilke_D_Logik_Krypto_2011.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 1. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS1.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 2. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS2.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 3. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS3.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 4. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS4.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
  </examiners>
  <file>ws0910_matheA.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Funktionale Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Huch</examiner>
  </examiners>
  <file>FunktionaleProg-Huch-2010.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Betriebssysteme (2. Termin) 5. Seite </reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>SysInfIIIBS5.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner> 
<examiner>Huch</examiner>
</examiners>
  <file>Huch_D_NVP_Hanus_D_PPS_Dez2010.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Qualitätssicherungsmanagement, Generative Software-Entwicklung</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Speck</examiner> 
</examiners>
  <file>Speck_D_QSM_GSE_Feb2011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Datenbanktechnologie</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Klein</examiner> 
</examiners>
  <file>Klein_Datenbanktechnologie_022011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner> 
</examiners>
  <file>BS_KlausurWS1011.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Mathematik für Informatiker 1 (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Bergweiler</examiner> 
</examiners>
  <file>Bergweiler_Inf_Mathe1_2008.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Nebenläufige und verteilte Programmierung, Funktioniale Programmierung</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Huch</examiner> 
</examiners>
  <file>Huch_neb_vert_funkt_Programmierung_062011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Rechnergestützter Entwurf digitaler Systeme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Schimmler</examiner> 
</examiners>
  <file>Schimmler_ReDigiSys_0711.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Informationssysteme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Klein</examiner> 
</examiners>
  <file>IS_Klausur_SS2010.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Organisation und Architektur von Rechnern</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner> 
</examiners>
  <file>OAR_Klausur.pdf</file>
</log>
<log>
  <date>2006</date>
  <reading>Computer Networks and Internetworking</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>cn_klausur06.pdf</file>
</log>
<log>
  <date>2007</date>
  <reading>Computer Networks and Internetworking</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>cn_klausur07.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner> 
</examiners>
  <file>INF1_WS1011.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Informatik III</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hasselbring</examiner> 
</examiners>
  <file>InfoIII_WS_09_10.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Information Systems Analysis Design and Developement</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Thalheim</examiner> 
</examiners>
  <file>ISADD.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner> 
<examiner>Huch</examiner>
</examiners>
  <file>Prüfungsprotokoll_PPS_NVS_230211.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Internet Communication, Computer Networks</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Luttenberger</examiner> 
</examiners>
  <file>Prüfungsprotokoll_Luttenberger_IC_CN_040908.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Übersetzerbau, Entwurf eingebetteter Echtzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner> 
<examiner>von Hanxleden</examiner> 
</examiners>
  <file>Prüfungsprotokoll_vHanxleden_Hanus_I.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Übersetzerbau, Semantik von Programmiersprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner> 
<examiner>Berghammer</examiner> 
</examiners>
  <file>Hanus_Berghammer_Compiler_Semantik022011.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Funktionale Programmierung, Internet Communications</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Huch</examiner> 
<examiner>Luttenberger</examiner> 
</examiners>
  <file>Huch_Luttenberger_FunktProg_IC.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Künstliche Intelligenz</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Salski</examiner> 
</examiners>
  <file>Salski_KI_0711.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Computer Networks and Internetworking</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>cn_klausur08.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Softwareentwicklung für Parallele und Verteilte Systeme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner> 
</examiners>
  <file>protokoll_diplom_vertiefung_2011_sepvs.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Softwaretechnik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner> 
</examiners>
  <file>protokoll_diplom_vertiefung_2011_softwaretechnik.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Mathematik für Informatiker I und II</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Braack</examiner>   
</examiners>
  <file>VD_Mathe_fuer_Informatiker022012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Digitale Systeme, Datenbanken</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Schimmler</examiner>   
<examiner>Klein</examiner>   
</examiners>
  <file>VD_Digitale_Systeme_und_Datenbanken022012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Programmierung, Softwaretechnik</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner>   
</examiners>
  <file>VD_Programmierung_und_SWT022012.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Braack</examiner>   
</examiners>
  <file>MatheC_Braack_20102011.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Wilke</examiner>   
</examiners>
  <file>TheoretischeGrundlagenDerInformatik2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Berghammer</examiner>   
</examiners>
  <file>MatheA_fuer_Inf_11_12.png</file>
</log>
<log>
  <date>2011</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Berghammer</examiner>   
</examiners>
  <file>MatheA_fuer_Inf_10_11.png</file>
</log>
<log>
  <date>2012</date>
  <reading>Mathematik für Informatiker C (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Braack</examiner>   
</examiners>
  <file>MatheC2012.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Mathematik für Informatiker B (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Klein</examiner>   
</examiners>
  <file>MatheB2011.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Softwaretechnik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hasselbring</examiner>
  </examiners>
  <file>SWT_WS1516_1.ZR.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Wissenschaftliches Rechnen</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Börm</examiner>
  </examiners>
  <file>Prüfungsprotokoll_wissrech.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Betriebssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>Betriebssysteme_WS11-12(1.Termin).pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Logik_SS12(1.Termin).pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Modellierung nebenläufiger Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner> 
</examiners>
  <file>mcs.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Kommunikatonssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Kommunikationssysteme_Klausurtermin1_SS2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Kommunikatonssysteme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner> 
</examiners>
  <file>Kommunikationssysteme_Klausurtermin2_SS2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Semantik von Programmiersprachen, Synchrone Sprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Berghammer</examiner>   
<examiner>von Hanxleden</examiner> 
</examiners>
  <file>D_SemVonProg_SynchSpra_032012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Schimmler</examiner>   
</examiners>
  <file>DigisysKlausur_2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner> 
</examiners>
  <file>FortProg _2Termin_SS2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Algorithmen und Datenstrukturen</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>ADS_SoSe_2012_Versuch_1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Schimmler</examiner>   
</examiners>
  <file>DigiSysWS2010_11.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Braack</examiner>   
</examiners>
  <file>Mathematik_fuer_Informatiker_C_WS2011_12_Klausurenzeitraum_2.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner>   
</examiners>
  <file>Hasselbring_SEPVS_2012.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Srivastav</examiner>   
</examiners>
  <file>mathe_A_klausur_1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Srivastav</examiner>   
</examiners>
  <file>mathe_A_klausur_2.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Automaten, Logiken und Spiele</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Wilke</examiner>   
</examiners>
  <file>wilke_als_ws11-12.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Multimediale Informationsverarbeitung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Koch</examiner>
  </examiners>
  <file>multinf-2011-koch-1.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Binäre Entscheidungsdiagramme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Berghammer</examiner>   
</examiners>
  <file>bdd_pruefung_2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Software Engineering für parallele und verteilte Systeme</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hasselbring</examiner>   
</examiners>
  <file>SEPVS_Pruefung_2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner> 
</examiners>
  <file>FortProg_SS2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Fortgeschrittene Programmierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Hanus</examiner> 
</examiners>
  <file>Hanus_FortProg_2012.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Logik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Spinas</examiner>
  </examiners>
  <file>logik-infmath3-2010-spinas-1.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Betriebssysteme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>bs-sysinf3-2010-luttenberger-1.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>DSW</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
  </examiners>
  <file>dsw-infmath4-2010-srivastav-1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Internet Communications</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>intcom-2011-luttenberger-1.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Programmierung (Übungsklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>UebungsklausurProgrammierung2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Programmierung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>Hanus_Programmierung2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Digitale Systeme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_SysInfI_20102.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_Inf_DigitaleSysteme_2005.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Digitale Systeme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_SysInfI_20102.pdf</file>
</log>
<log>
  <date>2005</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_Inf_DigitaleSysteme_2005.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Prinzipien von Programmiersprachen</reading>
  <type>mündlich</type>
  <examiners>
<examiner>Hanus</examiner>   
</examiners>
  <file>Hanus_PPS_2012.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Organisation und Archtitektur von Rechnern (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>OAR-Klausur-SoSe2012Hanxleden.pdf</file>
</log>
<log>
  <date>2010</date>
  <reading>Digitale Systeme</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Schimmler_SysInfI_2010.pdf</file>
</log>
<log>
  <date>2008</date>
  <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>2008_ss_informatik_2_schriftlich_wilke_zeitraum1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum1.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Theoretische Grundlagen der Informatik</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Klausur_TGI_WS1516_1.jpg</file>
</log>
<log>
<date>2016</date>
  <reading>Computergraphik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Koch</examiner>
  </examiners>
  <file>CG-Klausur-WS1516.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Entwurf eingebetteter Echtzeitsysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Prüfungsprotokoll - Entwurf eingebetteter Echtzeitsysteme - WS15_16.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Deklarative Programmiersprachen1516 (1. Termin)</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>Deklarative Programmiersprachen1516.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Softwaretechnik (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Hasselbring</examiner> 
</examiners>
  <file>softwaretechnik_2012_2.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>Logik für Informatiker (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Logik_Informatiker_2012_21.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Theoretische Grundlagen der Informatik (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
<file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum2.pdf</file>
</log>
<log>
  <date>2009</date>
  <reading>Informatik III (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hasselbring</examiner> 
</examiners>
  <file>2008_ws_informatik_3_schriftlich_hasselbring_zeitraum1.pdf</file>
</log>
<log>
  <date>2011</date>
  <reading>Kombinatorische Optimierung</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Srivastav</examiner>   
</examiners>
  <file>2011_ss_kombinatorische_optimierung_1_muendlich_srivastav.pdf</file>
</log>
<log>
  <date>2015</date>
  <reading>Multimediale Signal- und Bildverarbeitung</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Koch</examiner>
  </examiners>
  <file>klausur multimediale signal und bildverarbeitung.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Koch</examiner>
    <examiner>Schnoor</examiner>
  </examiners>
  <file>KlausurSS2016-Koch-Schnoor.pdf</file>
</log>
<log>
  <date>2012</date>
  <reading>XML</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>luttenberger_xml_2012.pdf‎</file>
</log>
<log>
  <date>2013</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Srivastav</examiner>
  </examiners>
  <file>Mathe_Inf_A_Srivastav_12_13.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Graphentheorie</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Srivistav</examiner>   
</examiners>
  <file>srivastav_graphentheorie_032013.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Iterative Verfahren für große Gleichungssysteme</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Börm</examiner>   
</examiners>
  <file>Boerm_Iterative_2013.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Betriebssysteme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>luttenberger_betriebssysteme_2013_2Termin.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Computersysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Compsys-WS2016_1.compressed.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Mathematik für Informatiker C (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Langfeld</examiner>
  </examiners>
  <file>matheC_2013_2Termin.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Betriebs- und Kommunikationssysteme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Koch</examiner>
    <examiner>Schnoor</examiner>
  </examiners>
  <file>BSKS_SS16_2.ZR.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Web-Technologien (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>WebTech_SS16_1.ZR.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Mathe_A_WS16_17_1_Versuch.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Logik in der Informatik (1. Termin mit Lösung)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>Logik_Inf_SS16_Lsg.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Logik in der Informatik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner> 
</examiners>
  <file>Logik_Informatik_2013_1.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Algorithmen und Datenstrukturen (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>klausur_ads_ss2016.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>3D Szenerekonstruktion, Computer Grafik</reading>
  <type>mündlich</type>
  <examiners>
    <examiner>Koch</examiner> 
</examiners>
  <file>Koch_D_3D_ComputerGrafik_092013.pdf</file>
</log>
<log>
  <date>2014</date>
  <reading>Digitale Systeme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>DigitaleSysteme_2014_1.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Betriebs- und Kommunikationssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Luttenberger</examiner>
  </examiners>
  <file>Bsks_ss2017_1.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_2.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Machine Learning</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Prof. Dr. Carsten Meyer</examiner>
  </examiners>
  <file>Machine_Learning_Klausur_SS17.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Algorithmen und Datenstrukturen (Probeklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Jansen</examiner>
  </examiners>
  <file>Ads_ss2017_probe.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Mathematik für Informatiker A (Probeklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Mathe_inf_a_ws1617_probe.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Mathematik für Informatiker A (Probeklausur - Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Mathe_inf_a_ws1617_probe_loesung.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (2. Termin - Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_2_loesung.pdf</file>
</log>
<log>
  <date>2015</date>
  <reading>Programmierung (Probeklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_probe.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (Probeklausur)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1617_probe.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_1.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (1. Termin - Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_1_loesung.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Programmierung (Probeklausur - Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1617_probe_loesung.pdf</file>
</log>
<log>
  <date>2015</date>
  <reading>Programmierung (Probeklausur - Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1516_probe_loesung.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Computersysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>Compsys_ws1617_1.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Programmierung (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>von Hanxleden</examiner>
  </examiners>
  <file>Programmierung_ws1617_1.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Digitale Systeme (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>DigitaleSysteme_WS1213_2.pdf</file>
</log>
<log>
  <date>2013</date>
  <reading>Digitale Systeme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Schimmler</examiner>
  </examiners>
  <file>DigitaleSysteme_WS1213_1.pdf</file>
</log>
<log>
  <date>2014</date>
  <reading>Softwaretechnik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
<examiner>Nowotka</examiner> 
</examiners>
  <file>softwaretechnik_2014_1.pdf</file>
</log>
<log>
  <date>2014</date>
  <reading>IT-Sicherheit</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Wilke</examiner>
  </examiners>
  <file>it_sicherheit_2014_1.pdf</file>
</log>
<log>
  <date>2018</date>
  <reading>Einführung in die Wirtschaftsinformatik (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Einf_winf_thalheim_ws1718_pz1.pdf</file>
</log>
<log>
  <date>2018</date>
  <reading>Fortgeschrittene Programmierung (1. Termin, mit Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Hanus</examiner>
  </examiners>
  <file>Fortprog_hanus_ws1718_pz1.pdf</file>
</log>
<log>
  <date>2015</date>
  <reading>Mathematik Für Informatiker A (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>MatheA_WS1415_2PZ.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Huch</examiner>
  </examiners>
  <file>Fortprog_huch_ss16_pz2.tar.xz</file>
</log>
<log>
  <date>2016</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Huch</examiner>
  </examiners>
  <file>Fortprog_huch_ss16_pz1.tar.xz</file>
</log>
<log>
  <date>2016</date>
  <reading>Mathematik Für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>MatheA_WS1516_1PZ.pdf</file>
</log>
<log>
  <date>2016</date>
  <reading>Mathematik Für Informatiker A (2. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>MatheA_WS1516_2PZ.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Informationssysteme (2. Termin, mit Lösungen)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Infsys_ws1617_pz2_mit_loesung.pdf</file>
</log>
<log>
  <date>2015</date>
  <reading>Mathematik Für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>MatheA_WS1415_1PZ.pdf</file>
</log>
<log>
  <date>2018</date>
  <reading>Mathematik für Informatiker A (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Berghammer</examiner>
  </examiners>
  <file>Mathe_a_ws1718_pz1.pdf</file>
</log>
<log>
  <date>2017</date>
  <reading>Informationssysteme (1. Termin)</reading>
  <type>schriftlich</type>
  <examiners>
    <examiner>Thalheim</examiner>
  </examiners>
  <file>Infsys_ws1617_pz1.pdf</file>
</log>


<log>
    <log>
  <date>2018</date>
        <date>2009</date>
  <reading>Computersysteme (1. Termin)</reading>
        <reading>Informatik 1</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Schimmler</examiner>
        <examiners>
  </examiners>
            <examiner>Hanus</examiner>
  <file>Compsys_ws1718_pz1.pdf</file>
        </examiners>
</log>
        <file>Hanus Informatik I WS0809.pdf</file>
    </log>


<log>
    <log>
  <date>2017</date>
        <date>2002</date>
  <reading>Fortgeschrittene Programmierung (1. Termin)</reading>
        <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
      <extra>Testklausur</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Hanus</examiner>
  <file>Fortprog_hanus_ws1717_pz1.pdf</file>
        </examiners>
</log>
        <file>Hanus Inf ProgrammierungTestklausur 2002.pdf</file>
    </log>


<log>
    <log>
  <date>2018</date>
        <date>2002</date>
  <reading>Graphenthorie (1. Termin)</reading>
        <reading>Inf Programmierung</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Srivastav</examiner>
        <examiners>
  </examiners>
            <examiner>Hanus</examiner>
  <file>Graphentheorie_Srivastav_ws1718_1f_pz1.pdf</file>
        </examiners>
</log>
        <file>Hanus Inf Programmierung 2002.pdf</file>
    </log>


<log>
    <log>
  <date>2017</date>
        <date>2009</date>
  <reading>Mathematik für Informatiker A (Probeklausur)</reading>
        <reading>Mathematik für Informatiker 2</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Braack</examiner>
  <file>Mathe-a_berghammer_ws1617_probe.pdf</file>
        </examiners>
</log>
        <file>Braack MfI II Sose2009.pdf</file>
    </log>


<log>
    <log>
  <date>2017</date>
        <date>2009</date>
  <reading>Fortgeschrittene Programmierung (2. Termin)</reading>
        <reading>Mathematik für Informatiker 1</reading>
  <type>schriftlich</type>
      <extra>1. Termin</extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Hanus</examiner>
        <examiners>
  </examiners>
            <examiner>Braack</examiner>
  <file>Fortprog_hanus_ws1717_pz2.pdf</file>
        </examiners>
</log>
        <file>Braack WS0809 MathefuerInfosI.pdf</file>
    </log>


<log>
    <log>
  <date>2018</date>
        <date>2009</date>
  <reading>Mathematik für Informatiker A (2. Termin)</reading>
        <reading>Datenbanksysteme</reading>
  <type>schriftlich</type>
        <extra></extra>
  <examiners>
        <type>schriftlich</type>
    <examiner>Berghammer</examiner>
        <examiners>
  </examiners>
            <examiner>Klein</examiner>
  <file>Berghammer_MatheA_WS17_2PZ.pdf</file>
        </examiners>
</log>
        <file>Klein Inf Datenbanksysteme 2009.pdf</file>
    </log>


</logs>
    <log>
        <date>2014</date>
        <reading>XML</reading>
        <extra></extra>
        <type>schrftlich</type>
        <examiners>
            <examiner>Luttenberger</examiner>
        </examiners>
        <file>AufgabenXML.pdf</file>
    </log>
-->
  </logs>


</examinationlogs>
</examinationlogs>
<noinclude>
== Siehe auch ==
[[Protokolle/Klausuren | Protokolle und Klausuren]]
</noinclude>

Aktuelle Version vom 30. Juli 2026, 22:54 Uhr



Prüfungsprotokolle können nur aus dem Uni-Netz oder per VPN von zu Hause betrachtet werden.

Bitte auch den Abschnitt "Ich nutze VPN und kann keine Uni-Seiten aufrufen" beachten

Wir brauchen eure Hilfe!

Damit wir auch weiterhin aktuelle Prüfungsprotokolle und Klausuren anbieten können, sind wir auf eure Hilfe angewiesen! Nur wenn ihr uns eure Protokolle übermittelt, können wir diese für nachfolgende Studenten online stellen. Dabei ist es egal, ob ihr uns diese auf Papier oder in elektronischer Form zukommen lasst. Als Vorlage für eure Prüfungsprotokolle könnt ihr PruefungsprotokollVorlage.tex verwenden. Wir, und sicherlich auch alle Studenten nach euch, sind für jeden Beitrag dankbar. Für jedes Protokoll und jede Klausur bieten wir Schokolade zur Belohnung an.

Ich möchte eine Klausur abgeben, auf dieser stehen jedoch noch Daten von mir, wie Name oder Matrikelnummer

Bevor wir eine Klausur online stellen, löschen wir selbstvserständlich eure Daten.

Klausuren für andere Studiengänge als Informatik (Hauptfach) oder Mathematik (Hauptfach)

Wir sammeln nur Klausuren für Studierende mit Hauptfach Informatik oder Mathematik. Somit haben wir keine Klausuren für die Lehrverstanstaltungen "Mathematik für Ingenieure" oder "Informatik für Ingenieure". Für (Wirtschafts-)Ingenieure und Elektrotechniker sammelt die Fachschaft Ingenieurwissenschaften [1] Klausuren. Wir haben auch keine Mathematik-Klausuren für Naturwissenschaftler oder Wirtschaftswissenschaftler.

Habt ihr noch mehr Protokolle/Klausuren?

Nein. Wir besitzen nur die Protokolle/Klausuren, die ihr hier seht. Wir haben alles von Ende der 90er online gestellt. Falls es den Professor bis 2005 noch gegeben hat, so sind diese Protokolle noch vorhanden - außer die Themengebiete oder die Prüfungsformen haben sich verändert. Mehr gibt es leider nicht. Wir freuen uns sehr, wenn ein vermisstes Protokoll bei uns abgegeben wird. Es gibt dann natürlich auch Schoki!

Werden Klausuren per Mail verschickt?

Nein.

Studierende anderer Hochschulen

Die Protokolle und Klausuren werden nur Studierenden der Universität Kiel zur Verfügung gestellt und nicht an Studierende anderer Hochschulen herausgegeben - auch nicht, wenn der/die DozentIn vorher an der Universität Kiel lehrte.


Für Altklausuren der Pflichtmodule in der Informatik existiert hier auch ein OLat Modul von Herrn Wilke.


Protokolle und Klausuren der Informatik

Sie versuchen von außerhalb des Uni-Netzes auf die Protokolle zuzugreifen.



Siehe auch

Protokolle und Klausuren

Abgerufen von „https://www.fs-infmath.uni-kiel.de/w/index.php?title=Protokolle_Informatik&oldid=26049“