Protokolle Informatik: Unterschied zwischen den Versionen
Aus Fachschaften Informatik & Mathematik
Michel (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Yorik (Diskussion | Beiträge) ERP Systeme |
||
| (143 dazwischenliegende Versionen von 8 Benutzern werden nicht angezeigt) | |||
| Zeile 4: | Zeile 4: | ||
</noinclude> | </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. | |||
<noinclude> | <noinclude> | ||
== Protokolle und Klausuren der Informatik== | == 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</reading> | <reading>Vorlesungstitel</reading> | ||
<extra>Attribute z.B. Nachschreibklausur</extra> | <extra>Attribute z.B. Nachschreibklausur, Musterlösung, ...</extra> | ||
<type>schriftlich/mündlich</type> | <type>schriftlich/mündlich</type> | ||
<examiners> | <examiners> | ||
| Zeile 30: | Zeile 29: | ||
</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> | <date>2025</date> | ||
<reading> | <reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | <examiner>Renz</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>EAES_SoSe_2025_1.PZ-qehre3weewg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Data Visualization</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Zelenka</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>Data_Visualization_WiSe24-25_2.PZ.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Informationsmanagement</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kulczynski</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>IM-sose25-ewiubwewe.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Big Data Management and Analytics</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kröger</examiner> | ||
</examiners> | </examiners> | ||
<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> | |||
<log> | |||
<date> | |||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>PMWS25_Klausur1-weghiuhweiugwegewg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Process Mining</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kulczynski</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>PMWS25_Klausur2-weghniuwegiuwegwge.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2024</date> | ||
<reading> | <reading>Einführung von ERP Systemen</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Gottschalk</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>EERP24_1-ewoighoiuhwoegoihweg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2024</date> | ||
<reading> | <reading>Einführung von ERP Systemen</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Gottschalk</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>EERP24_2.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Einführung von ERP Systemen</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Gottschalk</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>EERP25_2-ewgoihwiuegwe.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Berechnungen und Logik - 2F</reading> | ||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>BuL-2026-2-2F-esgihwkelhglewgwe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Berechnungen und Logik - 1F</reading> | |||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>BuL-2026-2-1F-rsewukghweligwegweg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Mathematik für die Informatik C</reading> | |||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kliemann</examiner> | |||
</examiners> | |||
<file>MatheC_2026_2_musterloesung-eawoighouiewhgoiwheiew.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Wissensmanagement und Wissenstechnologien</reading> | |||
<extra>2. Termin - gemeinsame Prüfung (2 Personen)</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Tochtermann</examiner> | |||
</examiners> | |||
<file>WmWt_2026_1-ewiguho8uigviqwuew.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Mathematik für die Informatik A</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Braack</examiner> | |||
</examiners> | |||
<file>Inf-Math-A_2026_1-weugiuwegweg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Foundations of Deep Learning</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Pirk</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>FDL_2026_1-kjeabguhweguoihiowqeg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Computer Graphics</reading> | ||
<extra>1. Termin</extra> | |||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Pirk</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>CG_2026_1-ewiohiwuhqwgqg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Data Science</reading> | ||
<extra>1. Termin</extra> | |||
<type>schriftlich | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Köser</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>DaSci_2026_1-sewkghiuwegweggew.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Computersysteme</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>von Hanxleden</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>CompSys_2026_1-eqwoiufhoiuwhegoi.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Big Data Management and Analytics</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kröger</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>BDMA_2026_1-weuighiuwehgwegwe.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Database Systems</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Renz</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>db_2025_1-welgnwkegweg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Algorithms on Sequences</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Fleischmann</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>AlgSeq_2025_2-ewegubwegiuwg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Mathematik für die Informatik C</reading> | ||
<extra> | <extra>2. Termin - Musterlösung</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kliemann</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>MatheC_2025_2_musterloesung-weguiiuewguw.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2026</date> | ||
<reading> | <reading>Mathematik für die Informatik C</reading> | ||
<extra> | <extra>1. Termin - Musterlösung</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Kliemann</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>MatheC_2026_1_musterloesung-weughiuweghweg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2023</date> | ||
<reading> | <reading>Algorithmische Methoden in der Praxis</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Esquivel</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>AlgMetP_2023_1_ungeloest-soeiwghweg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2023</date> | ||
<reading> | <reading>Algorithmische Methoden in der Praxis</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Esquivel</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>AlgMetP_2023_2_ungeloest-saynvwbeg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2024</date> | ||
<reading> | <reading>Algorithmische Methoden in der Praxis</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Esquivel</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>AlgMetP_2024_1_ungeloest-wegiojioweg.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2025</date> | ||
<reading> | <reading>Algorithmische Methoden in der Praxis</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Esquivel</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>AlgMetP_2025_1_ungeloest-wegiqjwf.pdf</file> | ||
</log> | </log><log> | ||
<log> | <date>2025</date> | ||
<date> | <reading>Algorithmische Methoden in der Praxis</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Esquivel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>AlgMetP_2025_2_ungeloest-egwkegwe.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2020</date> | ||
<reading> | <reading>Computersysteme</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Koch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Compsys_2020_1_ungeloest-herhhreerhh4.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2021</date> | ||
<reading> | <reading>Einführung in die Bildverarbeitung</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>Koch</examiner> | ||
</examiners> | </examiners> | ||
<file> | <file>Bildverarbeitung_2021_1-wegwegwegwge.pdf</file> | ||
</log> | </log> | ||
<log> | <log> | ||
<date> | <date>2020</date> | ||
<reading> | <reading>Objektorientierte Programmierung</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner> | <examiner>von Hanxleden</examiner> | ||
</examiners> | |||
<file>Progoo_2020_1-wegwgewqfqwgh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Introduction to Cryptography</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Crypto_exam-weguhwegiuweg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Geo-Informationssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>Geo-Informationssysteme_PZ1_25-26_siuhgiuwegwegwe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Knowledge Discovery and Data Mining</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>KDDM-1-25_26-ewuiaghiuweghuiweg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2026</date> | |||
<reading>Automata and Logics</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
<examiner>Nowotka</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Exam_autlog.pdf</file> | ||
</log> | </log> | ||
<log> | |||
<date>2022</date> | |||
<reading>Knowledge Discovery and Data Mining</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>KDDM_Exam_WS22_23_2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Algorithmische Methoden in der Praxis</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Esquivel</examiner> | |||
</examiners> | |||
<file>AlgMetP_sose25_1pz_jsdvsbviuhbvuhxdgkjjbsdg.zip</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>InfEAlg-01a_sose25_1pz_ksdnvkjnskjvnkjsnkjn.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</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_sose25_1pz_sjdhviuhsuvhkehrdkhbnkerh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>InfProgOO-01a_sose25_pz2_nvsdjusvhiuhhskvhnkjjkbjk.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Datenschutz</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Bremert</examiner> | |||
</examiners> | |||
<file>Inf-DatSchutz_wise2425_sdjbuishuksskjbnkjsbku.pdf</file> | |||
</log> | |||
<log> | |||
<date>2022</date> | |||
<reading>Datenschutz</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Bremert</examiner> | |||
</examiners> | |||
<file>Inf-DatSchutz_w2122-1pz-jvniuviuhuishdvhsdjv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Computer Networks</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Grossmann</examiner> | |||
<examiner>Harms</examiner> | |||
</examiners> | |||
<file>Infcn01a-sose25-1pz-ajvbsvhbasjkbkjfn.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Analyse von Algorithmen und Komplexität</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>InfAAK-01a-sose2025-pz1-siughviuwbvbvbzbj.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Neural Networks and Deep Learning</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Meyer</examiner> | |||
</examiners> | |||
<file>Inf-nndl-s2025-1pz-fhniuweviubvbjwbs.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Discrete Optimization</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Deppert</examiner> | |||
</examiners> | |||
<file>DiscOpt_SS25_PZ1-sdbvuzsbvuzgsbzugh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Discrete Optimization</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Deppert</examiner> | |||
</examiners> | |||
<file>DiscOpt_SS25_PZ1-solution-acsbiucbezgfbuzvwgz.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung von ERP Systemen</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Gottschalk</examiner> | |||
</examiners> | |||
<file>Erpsysteme-25_1-fdiubhiurehbvkujb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Informationsmanagement</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | |||
<file>IMSS25_Klausur1-sfuhbviuwrhviuh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Ethik in der Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Große-Bölting</examiner> | |||
</examiners> | |||
<file>Ethik_klausur_25PZ1-aviuwevbkjbzugzg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Compiler Construction</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Infcc-01a_s2025-pz1-svbubrghwvsnub.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung in die nichtlineare Optimierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>Einführung_in_die_nichtlineare_Optimierung-2025-1pz-ievbniuerveivbzbveu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>OOP25-Klausur1-2025-wigunbieniuebiuerbe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>OOP25-Klausur1-Lsg-2025-nuvebveukvbnuwbveb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</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_sose25_1pz-unvshesuvwhvushv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</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_sose25_1pz-sduivhiurnbvrer.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Algorithms on Sequences</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Fleischmann</examiner> | |||
</examiners> | |||
<file>AoS2025-1-musterloesung-sdvhwriubvbrsv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Algorithms on Sequences</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Fleischmann</examiner> | |||
</examiners> | |||
<file>AoS_PZ1_SS25-vbwzebvuwhupser.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Social Media und Web Science</reading> | |||
<extra>1. Termin</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Peters</examiner> | |||
</examiners> | |||
<file>2025-Social_Media_und_Web_Science-Gedächtnisprotokoll-vbwuebvbrjvbejbebjvezvbrjwzgef.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Data Science</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Köser</examiner> | |||
</examiners> | |||
<file>data_science_2025_pz2-whgiuwhviuwniubuewbv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>InfProgOO-01a_SoSe23_Klausur_PZ1-ungeloest-wihvwiuhvuiwhuivhuihiv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>2. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>InfProgOO-01a_SoSe23_Klausur_PZ2-ungeloest-evuiwubvwbvbwv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>InfProgOO-01a_SoSe24_Klausur_PZ1-ungeloest-fiuvrneuhgberhth.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>2. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>InfProgOO-01a_SoSe24_Klausur_PZ2-ungeloest-sbviwbvbrevberbteh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Ethik in der Informatik</reading> | |||
<extra>2. Termin - Bewertungsschema</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Große-Bölting</examiner> | |||
</examiners> | |||
<file>InfEthik-01a_SoSe24_Klausur_PZ2-Bewertungsschema-udvbsiurbiui.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Ethik in der Informatik</reading> | |||
<extra>2. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Große-Bölting</examiner> | |||
</examiners> | |||
<file>InfEthik-01a_SoSe24_Klausur_PZ2-aisufhcurhwb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Ethik in der Informatik</reading> | |||
<extra>1. Termin - Bewertungsschema</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Große-Bölting</examiner> | |||
</examiners> | |||
<file>InfEthik-01a_SoSe24_Klausur_PZ1-Bewertungsschema-siuvwrbv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Ethik in der Informatik</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Große-Bölting</examiner> | |||
</examiners> | |||
<file>InfEthik-01a_SoSe24_Klausur_PZ1-iweughiurhbviu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung in die Wirtschaftsinformatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Cordes</examiner> | |||
</examiners> | |||
<file>Infewinf-w2425-1-sjbviuwrbvunbviusbwbvwebv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Distributed Systems</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>infds-01a2025-2-iuwgvuibniuuhweuhb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>infdp-01a-2025-2-anviwubneriuun.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Cryptography</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>infcryp-01a-2025-2-abvwebviuwhgiwueghiurw.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Berechnungen und Logik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>infbl-01a-2025-2-kabvuaqebzbwev.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Computersysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Inf-CompSyS_ws2425_1pz.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung in die Informatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Mühling</examiner> | |||
</examiners> | |||
<file>InfEInf-01a_ws2425_klausur-2-sdvuzbzbvzeverbvjze.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Mathematik für die Informatik A</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<file>Inf-Math-A wise2425 1pz-siubvwiuebvwqfhw.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Mobile Robotics</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Köser</examiner> | |||
</examiners> | |||
<file>InfMobRob_wise2425_1pz-sxdiviuwevbwubevwegf.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Operating Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Tomforde</examiner> | |||
</examiners> | |||
<file>OS-WS2425-PZ1_sbaiuberb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Distributed Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>Distributed_Systems_2025_1PZ-jvnurebvdbte.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Data Science</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Köser</examiner> | |||
</examiners> | |||
<file>Data_Science_2025_1PZ-egbuvwurejb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Funktionale Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Funktionale-programmierung-protokoll-2025-1-wenwurngiebnbine.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Data Visualization</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Zelenka</examiner> | |||
</examiners> | |||
<file>DataVis_ws2425_PZ1-egniubruszvzewg.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Tiny Machine Learning (Edge AI)</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>InfEDAI-01a_2025_Klausur_1_a7eNwGGs4doLCJDdf8vIOj_34M_f.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP-ws2425-klausur1-siuvbuwirbiurewnbiuer.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Mathematik für die Informatik C</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kliemann</examiner> | |||
</examiners> | |||
<file>05_Klausur1_InfC_Loesung-evbwuzbvwzbv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-frueher-4-sdvubuewbuvbweuv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-frueher-3-suwibiuartbtrbntunbe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-frueher-2-yajsnvrwunsewvnu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-frueher-1-wurnunubjnuern.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-w21-2-fionbiuebnerbui.pdf</file> | |||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>Probeklausur/Altklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg-w21-1-hbvueierbvuireb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP-Klausurloesung-w24-2-xcabuwenviernibniu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP-Klausurloesung-w24-1-uhdviurbineriubiuerb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP-Klausurloesung-w23-2-sdjbvuweanieruibuier.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP-Klausurloesung-w23-1-vbiuwevbiuweuvbewuv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Einführung in die Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Mühling</examiner> | |||
</examiners> | |||
<file>InfEInf-01a-wise2425-1pz-uiewbgiuvbwezvw2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Algebraic Automata Theory</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Fleischmann</examiner> | |||
</examiners> | |||
<file>InfAAT-01a-wise2425-1pz-isbviubrwuibuirerb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2025</date> | |||
<reading>Text Mining</reading> | |||
<extra>Probeklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Krestel</examiner> | |||
</examiners> | |||
<file>InfTM-01a-wise2425-probleklausur-rhbvewbvzbwjzbvv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Informatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Mühling</examiner> | |||
</examiners> | |||
<file>EInf_Klausur_WS23_24_PZ2-ebuiwebvbwsdbvh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Computer Networks</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>CNSS24-Klausur2-avbewvibwirbvrwbu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Algorithms on Sequences</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Fleischmann</examiner> | |||
</examiners> | |||
<file>AlgSeqSS24-Klausur2-siudbvwiubvwbv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>3D Computer Vision</reading> | |||
<extra>Protokoll</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Köser</examiner> | |||
</examiners> | |||
<file>CV3DSS24-Protokoll-divuweubvwbzvbz.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Informatikrecht</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Lindhorst</examiner> | |||
</examiners> | |||
<file>InfRechtWS24-Klausur1-esbvuweviueriubvui.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Operating Systems</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Tomforde</examiner> | |||
</examiners> | |||
<file>OSWS23-Klausur2-siuvbwubvuwrvu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Wirtschaftsinformatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Speck</examiner> | |||
<examiner>Kröger</examiner> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | |||
<file>EWIWS23-Klausur2-saibvwebvwrvuwhfu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Wirtschaftsinformatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Speck</examiner> | |||
<examiner>Kröger</examiner> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | |||
<file>EWIWS23-Klausur1-ajfvweubwkwb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Einführung in die Wirtschaftsinformatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Cordes</examiner> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | |||
<file>EWIWS22-Klausur2-jsdbvuwbuebv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Einführung in die Wirtschaftsinformatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Cordes</examiner> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | |||
<file>EWIWS22-Klausur1-oewhgihoioirweb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Database Systems</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>DBS-SoSe24-PZ2-ufudjzdzrdjzdztdf1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading> | |||
<extra>2. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>EAES_Exam_dsjbvuwbeiuvbzuewzfuv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Mathematik für die Informatik B</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<file>MathB_K1_loes_mit_Punkten-eriubviuwbvub.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Software Technik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schnoor</examiner> | |||
</examiners> | |||
<file>ST-24-PZ1-ZvKONPFQFAc7hBv4qNVcNh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Advanced Data Mining and Machine Learning Methods</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>ADMMLM_SS24_PZ1-fPyb9Nkso1l3e4ir7wlcyB.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<extra>"3". Termin (2023)</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>EinfAlg 23 3-AIBBUiewfbzu=GUOhh.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>EinfAlg_23_2-wfqweiguu3b.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Slawig</examiner> | |||
</examiners> | |||
<file>Progoo202401-hvbwiwdcqeuhv4b.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Internet of Things</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>IoT241-fuidbhuhvuhuirhkrhb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Computer Networks</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>ComputerNetworks24PZ1-efihwiugbvrvbuer.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Algorithms on Sequences</reading> | |||
<extra>1. Termin + Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Fleischmann</examiner> | |||
</examiners> | |||
<file>AoS2024-1_rwdZrmTN58uTT2JjNfwY.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Algorithms on Sequences</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | <examiners> | ||
<examiner>Fleischmann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-AlgSeq_24_Klausur_1_PljsyvoMVbKcw7JZJfV74QME.pdf</file> | ||
</log> | |||
<log> | |||
<date>2024</date> | |||
<date> | <reading>Algorithms on Sequences</reading> | ||
<reading> | <extra>1. Termin - ungelöst</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Fleischmann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-AlgSeq_24_Klausur_1_ungeloest_mnpp8_n2ZcG3hNnUu-KP.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Computer Networks</reading> | |||
<extra>2. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>Computer_Networks_Exam_2023_SS_2_without_solutions-siuvbbewv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Ealg-SS24-PZ1-jvbiwbeubvu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Operating Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Tomforde</examiner> | |||
</examiners> | |||
<file>OS_WiSe_23_24-dvbzbvuuzbiwefqoi.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Methoden der Effizienten Ähnlichkeitssuche in Großen Datenbeständen</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>EAeS_SS24_PZ1-hsdbvwbjv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Quantum Computing</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>InfQComp-01a_24_Klausur_1_K2RmanXAWDqSk5z0FVnSwG-5.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Neural Networks and Deep Learning</reading> | |||
<extra>1. Termin - Gedächtnisprotokoll</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Meyer</examiner> | |||
</examiners> | |||
<file>2024-1_NNDL-abschrift-ghvuierhguiherui.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Database Systems</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>DBS_20232PZ_ocred-weivbuzadfybb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Cryptography</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>2023_WiSe_exam_cryptography-dsviubvbsbv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Computer Networks</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>Computer_Networks_2023_PZ1_ungelöst-iuwbvbvfb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Database Systems</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>Klausur_DBS_SS2024_1PZ_blanko-u31fbiub4uvbrefvbi.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Database Systems</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>DBS20241PZ-musterloesung-eviuenbiuersjvb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<extra>1. Termin - ungelöst</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Infealg24-1-12345676543rwefdght6u5w.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Database Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>InfDB-2024-Klausur-1_ocred_compressed_uhafivuhsriueghieuahcng.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Analyse von Algorithmen und Komplexität</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>AAK_SS23_PZ2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Data Science</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>DataScience2024-2-kjvcdrtzujhbvcdtzu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Big Data Management and Analytics</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kröger</examiner> | |||
</examiners> | |||
<file>BDMA_2324_PZ1-djvbiuwau38fvhwba.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Mathematik für die Informatik A</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<file>MatheA_2024-uerv87wqg4bfiwq.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Analyse von Algorithmen und Komplexität - Komplexitätsteil</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>AAK_K_2024-rueihubieriubriuebv.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DP_2024_PZ2_eughiuhwaefbvriz.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Computer Graphics</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Pirk</examiner> | |||
</examiners> | |||
<file>InfCG-02a_24_Klausur1_DBInUFWSIHdg3fXW.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Computer Graphics</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Pirk</examiner> | |||
</examiners> | |||
<file>InfCG-02a_24_Klausur2_5BhBlHL9ZxWh8-PIkWtGpwNN.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Methoden der Effizienten Ähnlichkeitssuche in großen Datenbeständen</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<type>schriftlich</type> | <examiners> | ||
<examiners> | <examiner>Renz</examiner> | ||
</examiners> | |||
<file>Klausur_EAS_SS23-oztijohiewees5vz54nfew.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Data Science</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>Klausur_DataScience_WS2324-weiguiwugwegwerqadxchtjto.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Berechnungen und Logik - 2F</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Nowotka</examiner> | |||
</examiners> | |||
<file>BuL_23_24_2F1PZ-iudsvgigzavgueru.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Data Visualization</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Zelenka</examiner> | |||
</examiners> | |||
<file>DataVis-Klausur-w2023-1 hwiuiuebicuiwzegf.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Berechnungen und Logik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Nowotka</examiner> | |||
</examiners> | |||
<file>BuL-20232-1.PZ-uvbubhvdbvubjsd.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Einführung in die Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Mühling</examiner> | |||
</examiners> | |||
<file>W23einf1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Computersysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>W23compsys1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>2024W DekProg_1-PZ_qrKuTpfHW6fLb692wR2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2022</date> | |||
<reading>Distributed Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>InfDS-01a_22_Klausur1_qXZ2azQ6GmY5lVMb.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Embedded Real-Time Systems</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Inf-EntEinSys_23_Klausur1_X8jgpH5OKj-_dhxe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Einführung in die Informatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Mühling</examiner> | |||
</examiners> | |||
<file>EinfInf2223 Klausur2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Data Visualization</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Zelenka</examiner> | |||
</examiners> | |||
<file>InfDataVis-01a_2023_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Data Visualization</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Zelenka</examiner> | |||
</examiners> | |||
<file>InfDataVis-01a_23_Klausur2_vYgjPlTaQRZYc82b5U3Ca7X3.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Computational Intelligence</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Tomforde</examiner> | |||
</examiners> | |||
<file>InfCI-01a_23_Klausur1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Computer Networks</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Landsiedel</examiner> | |||
</examiners> | |||
<file>InfCN-01a_22-23_Klausur2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024-04-10</date> | |||
<reading>Mathematik für die Informatik C</reading> | |||
<extra>2. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Lasse Kliemann</examiner> | |||
</examiners> | |||
<file>Inf-Math-C_2023-24_PZ2_Musterlösung.pdf</file> | |||
</log> | |||
<log> | |||
<date>2024-02-19</date> | |||
<reading>Mathematik für die Informatik C</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Lasse Kliemann</examiner> | |||
</examiners> | |||
<file>Inf-Math-C_2023-24_PZ1_Musterlösung.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Mathematik für die Informatik C</reading> | |||
<extra>1. Termin - Musterlösung</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kliemann</examiner> | |||
</examiners> | |||
<file>Inf-Math-C_22-23_Klausur1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Informationsmanagement</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IMSS23-Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Informationsmanagement</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IMSS23-Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Algorithms on Sequences</reading> | ||
<reading> | <extra>2. Termin + Musterlösung</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Fleischmann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>AoS2023-2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Theoretische Grundlagen der Informatik</reading> | ||
<reading> | |||
<extra>2. Termin</extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>TGISS23-Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Theoretische Grundlagen der Informatik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>TGISS23-Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Informationsmanagement</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IMSS23-Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Informationsmanagement</reading> | |||
<extra>Probeklausur</extra> | |||
<date> | |||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kulczynski</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IMSS23-Probe.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Einführung von ERP Systemen</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>EERPSS23-Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Einführung von ERP Systemen</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>EERPSS23-Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Softwaretechnik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hasselbring</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ST_23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Slawig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfProgOO-01a_23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2023</date> | ||
<reading> | <reading>Einführung in die Algorithmik</reading> | ||
<extra> | <extra>1. Termin - mängelexemplar</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEAlg-01a_23_Klausur1_maengelexemplar.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Einführung in die Algorithmik</reading> | |||
<date> | <extra>1. Termin - ungelöst</extra> | ||
<reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEAlg-01a_23_Klausur1_ungeloest.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Internet of Things and Wireless Networks</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfIoT-01a_23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Computer Networks</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Computer_Networks_2023_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Einführung in die Algorithmik</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEAlg-01a_2023_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Database Systems</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Kröger</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>DBS_2023_1PZ_Kroeger.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung in die Algorithmik</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEAlg-01a_22_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Objektorientierte Programmierung</reading> | ||
<reading> | <extra>2. Termin - ungelöst</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Slawig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfProgOO-01a_22-Klausur2_ungeloest.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<reading>Objektorientierte Programmierung</reading> | |||
<date> | <extra>1. Termin - ungelöst</extra> | ||
<reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Slawig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfProgOO-01a_22-Klausur1_ungeloest.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung von ERP Systemen</reading> | ||
<reading> | <extra>1. Termin - gelöst</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfERP-01a_22_Klausur1_geloest.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung von ERP Systemen</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEERP-01a_22_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Operating Systems</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Tomforde</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>OS_Altklausur_WiSe2022-23.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung von ERP Systemen</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEERP-01a_22_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Data Science</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra> | <type>schriftlich/online</type> | ||
<type>schriftlich</type> | |||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfDaSci-01a_21-22_Klausur1.png</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Hochleistungsrechnen</reading> | ||
<reading> | <extra></extra> | ||
<extra></extra> | |||
<type>mündlich</type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Börm</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Gedaechnisprotokoll_infHPC_22_23_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Computersysteme</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>von Hanxleden</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-CompSys_22-23_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Deklarative Programmierung</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfDP-01a_22-23_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Big Data Management and Analytics</reading> | ||
<reading> | <extra>Probeklausur - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Kröger</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfBDMaA-01a_22-23_Probeklausur_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Big Data Management and Analytics</reading> | ||
<reading> | <extra>Probeklausur</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Kröger</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfBDMA-01a_22-23_Probeklausur.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<reading>Mathematik für die Informatik B</reading> | |||
<date> | <extra>2. Termin</extra> | ||
<reading> | <type>schriftlich</type> | ||
<extra></extra> | |||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_20_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_20_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>2. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_20_Klausur2_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<reading>Mathematik für die Informatik B</reading> | |||
<date> | <extra>1. Termin - Musterlösung</extra> | ||
<reading> | <type>schriftlich</type> | ||
<extra></extra> | |||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_20_Klausur1_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>2. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_19_Klausur2_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>1. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-B_19_Klausur1_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Mathematik für die Informatik C</reading> | ||
<reading> | <extra>1. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>Klausurersatzleistung</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Braack</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-C_21-22_Klausurersatzleistung_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Mathematik für die Informatik C</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>Klausurersatzleistung</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Braack</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-C_21-22_Klausurersatzleistung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Informationssysteme</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kröger</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-IS_21-22_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Informatikrecht</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Lindhorst</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-InfRecht_22-23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<reading>Informatikrecht</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Lindhorst</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-InfRecht_21-22_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Betriebs- und Kommunikationssysteme</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-BSKS_20_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>1. Termin - Musterlösung</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_21_Klausur1_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<date> | <extra>2. Termin - Musterlösung</extra> | ||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_20_Klausur2_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_20_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<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> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_20_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>2. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_19_Klausur2_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>1. Termin - Musterlösung</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_19_Klausur1_loesung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_18_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-ADS_18_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Mathematik für die Informatik A</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-Math-A_22-23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Data Science</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfDaSci-01a_22-23_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Data Science</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfDaSci-01a_22-23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Mathematik für die Informatik C</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Kliemann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheCWS22_23_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Computersysteme</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>von Hanxleden</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-CompSys_22-23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<reading>Deklarative Programmierung</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | <type>schriftlich</type> | ||
<extra></extra> | |||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfDP-01a_22-23_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2023</date> | |||
<date> | <reading>Einführung in die Informatik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Mühling</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEInf-01a_ws2223_klausur-1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Fortgeschrittene Programmierung</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | <type>schriftlich/online</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-FortProg_20-21_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Fortgeschrittene Programmierung</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich/online</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-FortProg_20-21_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Fortgeschrittene Programmierung</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | <type>schriftlich/online</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Inf-FortProg_21-22_Klausur2.zip</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<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> | <reading>Softwaretechnik</reading> | ||
<extra></extra> | <extra>1. Termin - Lösungen</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hasselbring</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Klausur-SWT-2022-pz-1-mit-loesung-und-korrekturhinweisen.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Softwaretechnik</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hasselbring</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Klausur-SWT-2021-pz-2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Softwaretechnik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hasselbring</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Klausur-SWT-2021-pz-1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung in die Informatik</reading> | ||
<reading> | <extra>1. Termin - Lösungen</extra> | ||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Mühling</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>EinfInf2122_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Datenschutz</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich/online</type> | ||
<examiners> | <examiners> | ||
<examiner>ULD</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Datenschutzrecht_I_2022_Klausur_zensiert.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Complexity Theory</reading> | ||
<reading> | |||
<extra>2. Termin</extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>compltheo_wilke_ss22_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Complexity Theory</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>compltheo_wilke_ss22_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading>Logik | <reading>Fortgeschrittene Logik</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>fortlog_wilke_ss22_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Fortgeschrittene Logik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>fortlog_wilke_ss22_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Algorithms on Sequences</reading> | ||
<extra></extra> | <extra>1. Termin + Musterlösung</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Fleischmann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>AlgorithmsOnSequencesKlausur2022_1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Algorithms on Sequences</reading> | ||
<extra></extra> | <extra>Probeklausur + Musterlösung</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Fleischmann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>AlgorithmsOnSequencesProbeKlausur2022.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Computer Networks</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ComputerNetworks_2022S_ZR1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Mathematik für die Informatik B</reading> | ||
<extra></extra> | <extra>1. Termin - Korrekturhinweise</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>2022S_MatheB_K1_Musterlösung.pdf</file> | ||
</log> | |||
<log> | |||
<date>2022</date> | |||
<date> | <reading>Einführung in die Algorithmik</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>EAlgo_SS22_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Objektorientierte Programmierung</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Slawig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ProgOO_SS22_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Einführung in die Wirtschaftsinformatik</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich/online</type> | ||
<examiners> | <examiners> | ||
<examiner>Koschmider</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>WInf_22_PZ1.zip</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Einführung in die Informatik</reading> | ||
<extra></extra> | <extra>1. Termin unvollständig</extra> | ||
<type> | <type>schriftlich/online</type> | ||
<examiners> | <examiners> | ||
<examiner>Mühling</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>InfEinf_22_PZ1_unvollständig.zip</file> | ||
</log> | |||
<log> | |||
<date> | <date>2022</date> | ||
<reading> | <reading>Einführung in die Informatik</reading> | ||
<extra></extra> | <extra>Probleklausur + Musterlösung</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Mühling</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>EinfInf2122_Probeklausur.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Knowledge Discovery and Data Mining </reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>Open Book Klausur</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>KDDM_Klausur_WS21-22_PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Mathematik für die Informatik C </reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>Take Home Klausur</type> | ||
<examiners> | <examiners> | ||
<examiner>Braack</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheCWS20-21_1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Mathematik für die Informatik C </reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type> | <type>Take Home Klausur</type> | ||
<examiners> | <examiners> | ||
<examiner>Braack</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheCWS20-21_2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>IT-Recht</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Lindhorst</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IT-Recht_Klausur_1_SS21.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>1. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Langfeld_Mathe_B_SoSe21_1-fixed.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>1. Termin - gelöst</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ADS_Klausur_1_SS21.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>1. Termin - ungelöst</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ADS_Klausur_1_SS21-unsolved.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Einführung von ERP Systemen</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Gottschalk</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Einführung_ERP_2021_1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra>Probleklausur</extra> | |||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informationssysteme_Probeklausur_WS19-20.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra> | <extra>Probleklausur - Lösung</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informationssysteme_Probeklausur_WS19-20_-_Musterlösung.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Informatik I</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informatik_I_WS18-19_PZI.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Programmiertechniken</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Programmiertechniken_SS19_PZI.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Computersysteme</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Koch</examiner> | |||
</examiners> | |||
<file>Computersysteme_WS20-21_PZII.pdf</file> | |||
</log> | |||
<!-- | |||
Die will Koch nicht online haben | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Computersysteme</reading> | ||
<extra></extra> | <extra>2. Termin - Lösung 1</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Koch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Computersysteme_WS20-21_PZII_-_Musterlösung_Aufgabe_1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<date> | <reading>Computersysteme</reading> | ||
<reading> | <extra>2. Termin - Lösung 2</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Koch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Computersysteme_WS20-21_PZII_-_Musterlösung_Aufgabe_2.pdf</file> | ||
</log> | |||
--> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Informatik 1</reading> | ||
<reading> | <extra>Probeklausur</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Huch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informatik_I_Probeklausur_WS18-19.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Fortgeschrittene Programmierung</reading> | ||
<reading> | <extra>2. Termin - Musterlösung</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Fortgeschrittene_Programmierkonzepte_WS19-20_PZII.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Mathematik für die Informatik A</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Klein</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheA-WiSe20-21-PZ2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Klausur_Infsys_1920.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type> | <type>schriftlich/online</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Klausur_Inf-IS_WS20_21.pdf</file> | ||
</log> | |||
<log> | |||
<date>2021</date> | |||
<reading>Informationssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich/online</type> | |||
<examiners> | |||
<examiner>Renz</examiner> | |||
</examiners> | |||
<file>InfSys_Lösungsreduziert-2021.png</file> | |||
</log> | |||
<date> | <log> | ||
<reading> | <date>2021</date> | ||
<reading>Deklarative Programmiersprachen</reading> | |||
<extra></extra> | <extra></extra> | ||
<type>mündlich</type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>DPS-protokoll-2021.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2021</date> | ||
<reading> | <reading>Mathematik für die Informatik A</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Klein</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Mathe_A_PZ1_2021.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Internet of Things and Wireless Networks</reading> | ||
<reading> | <extra>2. Termin</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>IOT_Klausur_2020_PZ2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading> | <reading>Methoden der Effizienten Ähnlichkeitssuche in großen Datenbeständen</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Effiziente_suche.pdf</file> | ||
</log> | |||
<date> | <log> | ||
<reading> | <date>2020</date> | ||
<reading>Synchronous Languages</reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>von Hanxleden</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>SyncSpr-SoSe2020-PZ1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>AdsSS20191PZ.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Mathematik für die Informatik C</reading> | ||
<reading>Mathematik für | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Srivastav</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheCWS19_20_1PZ.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading> | <reading>Einführung in Operations Research</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Slawig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Op_research.pdf</file> | ||
</log> | |||
<log> | |||
<date>2020</date> | |||
<date> | <reading>Distributed Systems</reading> | ||
<reading> | <extra>2. Termin - ungelöst</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Exam_Distributed_Systems_WS1920.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2020</date> | ||
<reading>Mathematik für | <reading>Mathematik für die Informatik A</reading> | ||
<extra> | <extra>2. Termin - gelöst</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheA_Langfeld_19-20W_1PZ.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<reading>Mathematik für die Informatik B</reading> | |||
<date> | <extra>2. Termin - gelöst</extra> | ||
<reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
</examiners> | </examiners> | ||
<file> | <file>Mathe_B_19-20-Gelöst-2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading> | <extra>2. Termin - ungelöst</extra> | ||
<extra></extra> | <type>schriftlich</type> | ||
<type> | |||
<examiners> | <examiners> | ||
</examiners> | </examiners> | ||
<file> | <file>Mathe_B_19-20-Ungelöst-2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>2. Termin - ungelöst</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ADS_19-20-Ungelöst.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>2. Termin - gelöst</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ADS_19-20-Gelöst.pdf</file> | ||
</log> | |||
<date> | <log> | ||
<reading> | <date>2019</date> | ||
<extra></extra> | <reading>Softwaretechnik</reading> | ||
<extra>1. Termin - ausgefüllt</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Schnoor</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Softwaretechnik-SS19-1PZ-ohne-Name.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Softwaretechnik</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin - unausgefüllt</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Schnoor</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Softwaretechnik-SS19-1PZ-ohne-Name-ungelöst.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Mathematik für die Informatik B</reading> | ||
<extra> | <extra>1. Termin - ausgefüllt</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Mathematik-für-die-Informatik-B-SS19-1PZ-ohne-Name.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<reading>Mathematik für die Informatik B</reading> | |||
<date> | <extra>1. Termin - unausgefüllt</extra> | ||
<reading> | |||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Mathematik-für-die-Informatik-B-SS19-1PZ-ohne-Name-ungelöst.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Betriebs- und Kommunikationssysteme</reading> | ||
<extra></extra> | <extra>1. Termin - ausgefüllt</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Betriebs-und-Kommunikationssysteme-SS19-1PZ-ohne-Name.pdf</file> | ||
</log> | |||
<log> | |||
<date>2016</date> | |||
<date> | <reading>Mathematik für die Informatik B</reading> | ||
<reading>Mathematik für | <extra>2. Termin - Lösungen</extra> | ||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-b_langfeld_ss16_pz2_loes.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2016</date> | ||
<reading> | <reading>Mathematik für die Informatik B</reading> | ||
<extra></extra> | <extra>1. Termin - Lösungen</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-b_langfeld_ss16_pz1_loes.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2016</date> | ||
<reading>Mathematik für | <reading>Mathematik für die Informatik B</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-b_langfeld_ss16_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2016</date> | ||
<reading>Mathematik für | <reading>Mathematik für die Informatik B</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-b_langfeld_ss16_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Mathematik für die Informatik A</reading> | ||
<extra></extra> | <extra>Probeklausur - Lösungen</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-a_langfeld_ws1819_probe_loes.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Mathematik für die Informatik A</reading> | ||
<extra></extra> | <extra>Probeklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-a_langfeld_ws1819_probe.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<reading>Mathematik für die Informatik A</reading> | |||
<date> | <extra>1. Termin</extra> | ||
<reading> | <type>schriftlich</type> | ||
<extra></extra> | |||
<type> | |||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe-a_langfeld_ws1819_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2019</date> | |||
<date> | <reading>Betriebs- und Kommunikationssysteme</reading> | ||
<reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Landsiedel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>bsks_landsiedel_ss19_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>Probeklausur - Lösungen</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ads_jansen_ss19_probe_loes.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>Probeklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ads_jansen_ss19_probe.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra>2. Termin - mit Lösungen</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>ads_jansen_ss18_pz2_loes.pdf</file> | |||
</log> | |||
<log> | |||
<date>2018</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>1. Termin - mit Lösungen</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ads_jansen_ss18_pz1_loes.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2017</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ads_jansen_ss17_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2016</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>ads_jansen_ss16_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Datenschutz</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>ULD</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>datenschutz_uld_ws1819_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2017</date> | ||
<reading> | <reading>Mathematik für die Informatik B</reading> | ||
<extra></extra> | <extra>Probeklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hellwig</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>mathe_b_hellwig_ss17_probe.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2013</date> | ||
<reading>Theoretische Grundlagen der Informatik</reading> | <reading>Theoretische Grundlagen der Informatik</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>TheoInf121321.pdf</file> | ||
</log> | |||
<date> | <log> | ||
<reading> | <date>2019</date> | ||
<extra> | <reading>Fortgeschrittene Programmierung</reading> | ||
<extra>Probeklausur</extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>fortprog_hanus_ws1819_probe.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>infsys_renz_ws1819_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Informationssysteme</reading> | ||
<extra> | <extra>1. Termin - Lösungen</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Renz</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>infsys_renz_ws1819_pz1_lsg.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2015</date> | ||
<reading> | <reading>Programmierung</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Programmierung-Klausur_2014_2015.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2013</date> | ||
<reading> | <reading>Mathematik für Informatiker C</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheC_WiSe1213_Klausur1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2009</date> | ||
<reading> | <reading>Theoretische Informatik</reading> | ||
<extra></extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf TheoretischeInformatik 2009.PDF</file> | ||
</log> | |||
<log> | |||
<date> | <date>2008</date> | ||
<reading> | <reading>Theoretische Informatik</reading> | ||
<extra> | <extra>Nachschreibklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf TheoretischeInformatikNachschreiber 2008.pdf</file> | ||
</log> | |||
<log> | |||
<date>2008</date> | |||
<date> | <reading>Effiziente Algorithmen</reading> | ||
<reading> | <extra></extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf EffizienteAlgorithmen 2008.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2008</date> | ||
<reading> | <reading>Theoretische Informatik</reading> | ||
<extra></extra> | <extra></extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf TheoretischeInformatik 2008.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2006</date> | ||
<reading> | <reading>Approximative Algorithmen</reading> | ||
<extra></extra> | <extra></extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf ApproximativeAlgorithmen 2006.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2007</date> | ||
<reading> | <reading>Approximative Algorithmen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Jansen Inf ApproximativeAlgorithmen 2007.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2008</date> | ||
<reading> | <reading>Betriebssysteme</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>von Hanxleden</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>VonHanxleden Inf Betriebssysteme 2008.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2007</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf AlgorithmenDatenstrukturen 2007.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2009</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>von Hanxleden</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>VonHanxleden InformatikII Sose2009.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2005</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf AlgorithmenDatenstrukturen 2005.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2002</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf AlgorithmenDatenstrukturen 2002.pdf</file> | ||
</log> | |||
<log> | |||
<date>2008</date> | |||
<date> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<reading> | <extra>Probleklausur</extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf AlgorithmenDatenstrukturenProbeklausur 2008.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2007</date> | ||
<reading>Algorithmen und Datenstrukturen</reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra>Nachschreibklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf AlgorithmenDatenstrukturenNachschreiber 2007.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2009</date> | ||
<reading> | <reading>Logik für Informatiker</reading> | ||
<extra></extra> | <extra></extra> | ||
<type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf MathematikfuerInformatikerIII Logik 2009.pdf</file> | ||
</log> | |||
<log> | |||
<date>2005</date> | |||
<date> | <reading>Kryptographie</reading> | ||
<reading> | <extra></extra> | ||
<extra> | |||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf Kryptographie 2005.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2009</date> | ||
<reading> | <reading>Logik für Informatiker</reading> | ||
<extra> | <extra>Nachschreibklausur</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Mathematik fuer Informatiker III Nachholklausur 2009.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2004</date> | ||
<reading> | <reading>Theoretische Informatik</reading> | ||
<extra></extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Wilke Inf TheoretischeInformatik 2004.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2010</date> | ||
<reading>Algorithmen und Datenstrukturen</reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Alg_Dat_2010.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2011</date> | ||
<reading> | <reading>Qualitätsmanagement</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Speck</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Qualitätsmanagement.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2011</date> | ||
<reading> | <reading>IT-Sicherheit</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>protokoll_itsec.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2011</date> | ||
<reading> | <reading>Informations- und Wissensmanagement</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Tochtermann</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informations-_und_Wissensmanagement.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2011</date> | ||
<reading> | <reading>Mathematik für Informatiker A</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Berghammer</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Berghammer math a ws1011 nachschreibe.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Softwaretechnik</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Nowotka</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Softwaretechnik 18.2.14.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Börm</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Informatik ADS Börm 2014.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Betriebssysteme</reading> | ||
<extra> | <extra></extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Luttenberger</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Betriebssysteme 11.2.14.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2013</date> | ||
<reading> | <reading>Theoretische Grundlagen der Informatik</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Jansen</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>TheoInf12131.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Logik</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>logik_klausur_termin1_lsg.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2013</date> | ||
<reading> | <reading>Fortgeschrittene Programmierung</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>2-Nachklausur_Fortgeschrittene_Programmierung_pdf_exercises.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Deklarative Programmiersprachen</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <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> | |||
<date>2014</date> | <date>2014</date> | ||
<reading> | <reading>Mathematik für Informatiker C</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheC_WS1314_Klausur2.pdf</file> | ||
</log> | |||
<log> | |||
<date>2014</date> | <date>2014</date> | ||
<reading> | <reading>Mathematik für Informatiker C</reading> | ||
<extra></extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheC-WS1314-2PZ.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Mathematik für Informatiker C</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Langfeld</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>MatheC_WS1314_Klausur1.pdf</file> | ||
</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> | |||
<date> | <date>2014</date> | ||
<reading> | <reading>Kryptographie</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Wilke</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Kryptographie 2014 2. Prüfungszeitraum.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2013</date> | ||
<reading> | <reading>Compilerbau</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Compilerbau-SS13.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading>Fortgeschrittene Programmierung</reading> | <reading>Fortgeschrittene Programmierung</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>fortprog_hanus_ws1819_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2018</date> | ||
<reading>Fortgeschrittene Programmierung</reading> | <reading>Fortgeschrittene Programmierung</reading> | ||
<extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>fortprog_hanus_ws1718_pz2.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Computersysteme</reading> | ||
<extra>2. Termin</extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Koch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>CompSys2_Koch_1819.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2019</date> | ||
<reading> | <reading>Computersysteme</reading> | ||
<extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Koch</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Koch_Compsys_WS1819_1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2018</date> | ||
<reading> | <reading>Numerische Programmierung</reading> | ||
<extra> | <extra></extra> | ||
<type> | <type>mündlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Börm</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>Numprog_SS18_boerm.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | <date>2018</date> | ||
<reading> | <reading>IT Recht</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Lindhorst</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>it-recht_lindhorst_ss18_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date> | <date>2018</date> | ||
<reading> | <reading>Betriebs- und Kommunikationssysteme</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Sandro Esquivel</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>BSKS_Klausur_SS_2018.1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | <date>2018</date> | ||
<reading> | <reading>Softwaretecknik</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hasselbring</examiner> | |||
</examiners> | </examiners> | ||
<file> | <file>swt_hasselbring_ss18_pz1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2017</date> | <date>2017</date> | ||
<reading> | <reading>Algorithmen und Datenstrukturen</reading> | ||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Ads_jansen_ss17_pz2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2018</date> | |||
<reading>Computersysteme</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schimmler</examiner> | |||
</examiners> | |||
<file>Computersysteme_WS1718_2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2014</date> | |||
<reading>Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>Klausur--Programmierung--2014-04-08.pdf</file> | |||
</log> | |||
<log> | |||
<date>2014</date> | |||
<reading>Mathematik für Informatiker A</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>MathematikA_2014_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2014</date> | |||
<reading>Programmierung</reading> | |||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Hanus</examiner> | |||
</examiners> | </examiners> | ||
<file>Fortprog_hanus_ws1717_pz1.pdf</file> | <file>Programmierung_2014_1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2018</date> | <date>2014</date> | ||
<reading>Graphenthorie</reading> | <reading>Graphentheorie</reading> | ||
<extra>1. Termin</extra> | <extra>1. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Srivistav</examiner> | |||
</examiners> | </examiners> | ||
<file>Graphentheorie_Srivastav_ws1718_1f_pz1.pdf</file> | <file>srivastav_graphentheorie_2014_1.pdf</file> | ||
</log> | |||
<log> | |||
<date>2017</date> | <date>2014</date> | ||
<reading>Mathematik für Informatiker A</reading> | <reading>Mathematik für Informatiker A</reading> | ||
<extra>Probeklausur</extra> | <extra>2. Termin</extra> | ||
<type>schriftlich</type> | <type>schriftlich</type> | ||
<examiners> | <examiners> | ||
<examiner>Berghammer</examiner> | |||
</examiners> | </examiners> | ||
<file>Mathe-a_berghammer_ws1617_probe.pdf</file> | <file>MatheA_WS1314_2PZ.pdf</file> | ||
</log> | |||
<date>2017</date> | <log> | ||
<reading>Fortgeschrittene Programmierung</reading> | <date>2013</date> | ||
<extra>2. Termin</extra> | <reading>Mathematik für Informatiker A</reading> | ||
<type>schriftlich</type> | <extra>Probeklausur</extra> | ||
<examiners> | <type>schriftlich</type> | ||
<examiners> | |||
</examiners> | <examiner>Berghammer</examiner> | ||
<file>Fortprog_hanus_ws1717_pz2.pdf</file> | </examiners> | ||
<file>MaInf_A_PrKl_WS1314.pdf</file> | |||
</log> | |||
<date>2018</date> | <log> | ||
<reading>Mathematik für Informatiker A</reading> | <date>2013</date> | ||
<extra>2. Termin</extra> | <reading>Kommunikatiossysteme</reading> | ||
<type>schriftlich</type> | <extra>2. Termin</extra> | ||
<examiners> | <type>schriftlich</type> | ||
<examiners> | |||
</examiners> | <examiner>Luttenberger</examiner> | ||
<file>Berghammer_MatheA_WS17_2PZ.pdf</file> | </examiners> | ||
<file>Kommunikationssysteme_SoSe13_(erster_Zeitraum).pdf</file> | |||
</log> | |||
<log> | |||
<date>2013</date> | |||
<reading>Mathematik für Informatiker B</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<file>MatheB_SS_2013_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2013</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Börm</examiner> | |||
</examiners> | |||
<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> | |||
<date>2013</date> | |||
<reading>Informationssysteme - Hauptfach</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schnoor</examiner> | |||
</examiners> | |||
<file>informationssyteme_hauptfach_sose2013.pdf</file> | |||
</log> | |||
<log> | |||
<date>2013</date> | |||
<reading>Nebenläufige und verteilte Programmierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Huch_NVP_2013.pdf</file> | |||
</log> | |||
<log> | |||
<date>2013</date> | |||
<reading>Betriebssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Luttenberger</examiner> | |||
</examiners> | |||
<file>BS_Klausur_WS2013_P1.pdf</file> | |||
</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>2013</date> | |||
<reading>Informationssysteme - Nebenfach</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schnoor</examiner> | |||
</examiners> | |||
<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> | |||
<date>2016</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>Softwaretechnik-Prüfungsprotokoll1516.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Informationssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Thalheim</examiner> | |||
</examiners> | |||
<file>InfSys_WS2015_Klausur.pdf</file> | |||
</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> | |||
<date>2015</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>Softwaretechnik-Nachklausurneu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2007</date> | |||
<reading>Prinzipien von Programmiersprachen, Logikprogrammierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>D_Hanus_Programmierung_032007.pdf</file> | |||
</log> | |||
<log> | |||
<date>2006</date> | |||
<reading>Prinzipien von Programmiersprachen und Funktionale Programmierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>DiplPruefungHanus.pdf</file> | |||
</log> | |||
<log> | |||
<date>2007</date> | |||
<reading>Synchrone Sprachen, Internet Communication</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Luttenberger, von Hanxleden</examiner> | |||
</examiners> | |||
<file>D_Luttenberger_vonHanxleden_032007.pdf</file> | |||
</log> | |||
<log> | |||
<date>2008</date> | |||
<reading>Effiziente Algorithmen, Approximative Algorithmen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<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>Übersetzerbau, Funktionale Programmierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>Hanus_D__PrakInf.pdf</file> | |||
</log> | |||
<log> | |||
<date>2007</date> | |||
<reading>Deklarative Programmiersprachen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>Hanus_VL_DPS_082007.pdf</file> | |||
</log> | |||
<log> | |||
<date>2006</date> | |||
<reading>Effiziente Algorithmen, Approximative Algorithmen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Jansen_D_EffApprAlg_082006.pdf</file> | |||
</log> | |||
<log> | |||
<date>2004</date> | |||
<reading>Effiziente Algorithmen, Approximative Algorithmen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Jansen_D_Theo_012004.pdf</file> | |||
</log> | |||
<log> | |||
<date>2004</date> | |||
<reading>Effiziente Algorithmen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Jansen_D_Theo_072004.pdf</file> | |||
</log> | |||
<log> | |||
<date>2004</date> | |||
<reading>Effiziente Algorithmen, Kryptographie</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Jansen_D_Theo_102004.pdf</file> | |||
</log> | |||
<log> | |||
<date>2009</date> | |||
<reading>Effiziente Algorithmen, Kombinatorische Optimierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
<examiner>Srivastav</examiner> | |||
</examiners> | |||
<file>Jansen_Srivastav_D_EffizienteAlg_KombOpt_042009.pdf</file> | |||
</log> | |||
<log> | |||
<date>2006</date> | |||
<reading>Effiziente Algorithmen, Kryptographie</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<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>2015</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>2015SS_FortProg_Hanus.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Software Engineering für parallele und verteilte Systeme</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>Prüfungsprotokoll zu SEPDS.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Theoretische Grundlagen der Informatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Srivastav</examiner> | |||
</examiners> | |||
<file>TGI_Srivastav_WS14-15_PZ2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>Softwaretechnik-Klausur1415neu.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Theoretische Grundlagen der Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<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> | |||
<date>2015</date> | |||
<reading>Modellierung von Echtzeitsystemen</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<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>2012</date> | |||
<reading>Synchrone Sprachen</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>SynchroneSprachenKlausurWS 20112012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Programmierung</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<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> | |||
<date>2011</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>Jansen_Algorithmen_und_Datenstrukturen2011.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Software-Architektur</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>PruefungsprotokollSoftArch032012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2006</date> | |||
<reading>Computer Graphik</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
<examiner>Berghammer</examiner> | |||
</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>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> | |||
<date>2011</date> | |||
<reading>Semantik von Programmiersprachen, Effiziente Algorithmen</reading> | |||
<extra></extra> | |||
<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>Logik für Informatiker</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Logik_Klausur_SS11.pdf</file> | |||
</log> | |||
<log> | |||
<date>2009</date> | |||
<reading>Logik, DSW</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<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> | |||
<date>2006</date> | |||
<reading>Theoretische Informatatik, Logik</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Wilke_VD_InfIV_Logik022006.pdf</file> | |||
</log> | |||
<log> | |||
<date>2008</date> | |||
<reading>Synchrone Sprachen</reading> | |||
<extra>Testprüfung</extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Traulsen</examiner> | |||
</examiners> | |||
<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> | |||
<date>2007</date> | |||
<reading>Echzeitsysteme</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>vonHanxleden_D_PrakTech_022007.pdf</file> | |||
</log> | |||
<log> | |||
<date>2002</date> | |||
<reading>Effiziente Algorithmen, Transitionssysteme</reading> | |||
<extra></extra> | |||
<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> | |||
<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>2008</date> | |||
<reading>Synchrone Sprachen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>vonHanxleden_D_SynchroneSprachen_042008.pdf</file> | |||
</log> | |||
<log> | |||
<date>2005</date> | |||
<reading>Effiziente Algorithmen, Moderne Kryptographie</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Wilke_VD_InfoA_102005_2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2011</date> | |||
<reading>NVP, PrinzProg</reading> | |||
<extra></extra> | |||
<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> | |||
<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> | |||
<date>2010</date> | |||
<reading>Theoretische Grundlagen der Informatik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>klausur-nachschreib.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> | |||
<date>2010</date> | |||
<reading>Funktionale Programmierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>FunktionaleProg-Huch-2010.pdf</file> | |||
</log> | |||
<log> | |||
<date>2010</date> | |||
<reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading> | |||
<extra></extra> | |||
<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>Nebenläufige und verteilte Programmierung, Funktioniale Programmierung</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Huch_neb_vert_funkt_Programmierung_062011.pdf</file> | |||
</log> | |||
<log> | |||
<date>2011</date> | |||
<reading>Nebenläufige und verteilte Programmierung, Prinzipien von Programmiersprachen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Prüfungsprotokoll_PPS_NVS_230211.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> | |||
<date>2011</date> | |||
<reading>Übersetzerbau, Semantik von Programmiersprachen</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Salski</examiner> | |||
</examiners> | |||
<file>Salski_KI_0711.pdf</file> | |||
</log> | |||
<log> | |||
<date>2011</date> | |||
<reading>Softwareentwicklung für Parallele und Verteilte Systeme</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Braack</examiner> | |||
</examiners> | |||
<file>VD_Mathe_fuer_Informatiker022012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Programmierung, Softwaretechnik</reading> | |||
<extra></extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>TheoretischeGrundlagenDerInformatik2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Mathematik für Informatiker A</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Braack</examiner> | |||
</examiners> | |||
<file>MatheC2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2011</date> | |||
<reading>Mathematik für Informatiker B</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Klein</examiner> | |||
</examiners> | |||
<file>MatheB2011.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>SWT_WS1516_1.ZR.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Wissenschaftliches Rechnen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Börm</examiner> | |||
</examiners> | |||
<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> | |||
<date>2012</date> | |||
<reading>Logik in der Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<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> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<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> | |||
<date>2012</date> | |||
<reading>Kommunikatonssysteme</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Luttenberger</examiner> | |||
</examiners> | |||
<file>Kommunikationssysteme_Klausurtermin2_SS2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>FortProg _2Termin_SS2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Jansen</examiner> | |||
</examiners> | |||
<file>ADS_SoSe_2012_Versuch_1.pdf</file> | |||
</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> | |||
<date>2012</date> | |||
<reading>Software Engineering für parallele und verteilte Systeme</reading> | |||
<extra></extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>2. Termin</extra> | |||
<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> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Koch</examiner> | |||
</examiners> | |||
<file>multinf-2011-koch-1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Software Engineering für parallele und verteilte Systeme</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>SEPVS_Pruefung_2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<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>2012</date> | |||
<reading>Programmierung</reading> | |||
<extra>Übungsklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>UebungsklausurProgrammierung2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Programmierung</reading> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>Hanus_Programmierung2012.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Prinzipien von Programmiersprachen</reading> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<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> | |||
<date>2011</date> | |||
<reading>Theoretische Grundlagen der Informatik</reading> | |||
<extra></extra> | |||
<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> | |||
<extra></extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Klausur_TGI_WS1516_1.jpg</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Computergraphik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Koch</examiner> | |||
</examiners> | |||
<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> | |||
<date>2012</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hasselbring</examiner> | |||
</examiners> | |||
<file>softwaretechnik_2012_2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2012</date> | |||
<reading>Logik für Informatiker</reading> | |||
<extra>2. Termin</extra> | |||
<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</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>2011_ws_theoretische_grundlagen_der_informatik_schriftlich_wilke_zeitraum2.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Multimediale Signal- und Bildverarbeitung</reading> | |||
<extra></extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Koch</examiner> | |||
<examiner>Schnoor</examiner> | |||
</examiners> | |||
<file>KlausurSS2016-Koch-Schnoor.pdf</file> | |||
</log> | |||
<log> | |||
<date>2013</date> | |||
<reading>Mathematik für Informatiker A</reading> | |||
<extra>1. Termin</extra> | |||
<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> | |||
<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> | |||
<date>2016</date> | |||
<reading>Computersysteme</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Langfeld</examiner> | |||
</examiners> | |||
<file>matheC_2013_2Termin.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Betriebs- und Kommunikationssysteme</reading> | |||
<extra>2. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</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>2013</date> | |||
<reading>Logik in der Informatik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Wilke</examiner> | |||
</examiners> | |||
<file>Logik_Informatik_2013_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra>1. Termin</extra> | |||
<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> | |||
<extra></extra> | |||
<type>mündlich</type> | |||
<examiners> | |||
<examiner>Koch</examiner> | |||
</examiners> | |||
<file>Koch_D_3D_ComputerGrafik_092013.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Betriebs- und Kommunikationssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Luttenberger</examiner> | |||
</examiners> | |||
<file>Bsks_ss2017_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<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> | |||
<date>2017</date> | |||
<reading>Algorithmen und Datenstrukturen</reading> | |||
<extra>Probeklausur</extra> | |||
<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</reading> | |||
<extra>Probeklausur</extra> | |||
<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</reading> | |||
<extra>Probeklausur - Lösungen</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>Mathe_inf_a_ws1617_probe_loesung.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Programmierung</reading> | |||
<extra>2. Termin - Lösungen</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Programmierung_ws1516_2_loesung.pdf</file> | |||
</log> | |||
<log> | |||
<date>2015</date> | |||
<reading>Programmierung</reading> | |||
<extra>Probeklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Programmierung_ws1516_probe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Programmierung</reading> | |||
<extra>Probeklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Programmierung_ws1617_probe.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<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> | |||
<date>2016</date> | |||
<reading>Programmierung</reading> | |||
<extra>Probeklausur - Lösungen</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<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> | |||
<date>2017</date> | |||
<reading>Computersysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schimmler</examiner> | |||
</examiners> | |||
<file>Compsys_ws1617_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>von Hanxleden</examiner> | |||
</examiners> | |||
<file>Programmierung_ws1617_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2014</date> | |||
<reading>Softwaretechnik</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Nowotka</examiner> | |||
</examiners> | |||
<file>softwaretechnik_2014_1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2014</date> | |||
<reading>IT-Sicherheit</reading> | |||
<extra></extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Thalheim</examiner> | |||
</examiners> | |||
<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> | |||
<date>2015</date> | |||
<reading>Mathematik Für Informatiker A</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>MatheA_WS1415_2PZ.pdf</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Huch</examiner> | |||
</examiners> | |||
<file>Fortprog_huch_ss16_pz2.tar.xz</file> | |||
</log> | |||
<log> | |||
<date>2016</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>MatheA_WS1516_2PZ.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Informationssysteme</reading> | |||
<extra>2. Termin mit Lösungen</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<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</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>Mathe_a_ws1718_pz1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Informationssysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Thalheim</examiner> | |||
</examiners> | |||
<file>Infsys_ws1617_pz1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2018</date> | |||
<reading>Computersysteme</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Schimmler</examiner> | |||
</examiners> | |||
<file>Compsys_ws1718_pz1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Fortgeschrittene Programmierung</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Hanus</examiner> | |||
</examiners> | |||
<file>Fortprog_hanus_ws1717_pz1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2018</date> | |||
<reading>Graphenthorie</reading> | |||
<extra>1. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Srivastav</examiner> | |||
</examiners> | |||
<file>Graphentheorie_Srivastav_ws1718_1f_pz1.pdf</file> | |||
</log> | |||
<log> | |||
<date>2017</date> | |||
<reading>Mathematik für Informatiker A</reading> | |||
<extra>Probeklausur</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<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> | |||
<date>2018</date> | |||
<reading>Mathematik für Informatiker A</reading> | |||
<extra>2. Termin</extra> | |||
<type>schriftlich</type> | |||
<examiners> | |||
<examiner>Berghammer</examiner> | |||
</examiners> | |||
<file>Berghammer_MatheA_WS17_2PZ.pdf</file> | |||
</log> | |||
<!-- | |||
| Zeile 3.568: | Zeile 5.989: | ||
<examiner>Luttenberger</examiner> | <examiner>Luttenberger</examiner> | ||
</examiners> | </examiners> | ||
<file>luttenberger_xml_2012. | <file>luttenberger_xml_2012.pdf</file> | ||
</log> | </log> | ||
| Zeile 4.681: | Zeile 7.102: | ||
<examiner>Schimmler</examiner> | <examiner>Schimmler</examiner> | ||
</examiners> | </examiners> | ||
<file>Klausur1-DigiSys-WS2013-14. | <file>Klausur1-DigiSys-WS2013-14.pdf</file> | ||
</log> | </log> | ||
| Zeile 4.714: | Zeile 7.135: | ||
<examiner>Speck</examiner> | <examiner>Speck</examiner> | ||
</examiners> | </examiners> | ||
<file>EBusiness_eMarketing. | <file>EBusiness_eMarketing.pdf</file> | ||
</log> | </log> | ||
| Zeile 4.746: | Zeile 7.167: | ||
<examiner>Berghammer</examiner> | <examiner>Berghammer</examiner> | ||
</examiners> | </examiners> | ||
<file>Berghammer_Inf_Programmierung_1999_01. | <file>Berghammer_Inf_Programmierung_1999_01.pdf</file> | ||
</log> | </log> | ||
| Zeile 4.757: | Zeile 7.178: | ||
<examiner>Berghammer</examiner> | <examiner>Berghammer</examiner> | ||
</examiners> | </examiners> | ||
<file>Berghammer_Inf_Programmierung_2003_01. | <file>Berghammer_Inf_Programmierung_2003_01.PDF</file> | ||
</log> | </log> | ||
| Zeile 5.124: | Zeile 7.545: | ||
</log> | </log> | ||
--> | --> | ||
</logs> | |||
</logs> | |||
</examinationlogs> | </examinationlogs> | ||
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.