| Module name (EN): Fundamentals of Informatics |
| Degree programme: Applied Informatics, Bachelor, ASPO 01.10.2011 |
| Module code: PIB115 |
| SAP-Submodule-No.: P221-0026 |
| Hours per semester week / Teaching method: 3V+1U (4 hours per week) |
| ECTS credits: 5 |
| Semester: 1 |
| Mandatory course: yes |
| Language of instruction: German |
| Assessment: Written examination [updated 08.05.2008] |
| Applicability / Curricular relevance: PIB115 (P221-0026) Applied Informatics, Bachelor, ASPO 01.10.2011, semester 1, mandatory course |
| Workload: 60 class hours (= 45 clock hours) over a 15-week period. The total student study time is 150 hours (equivalent to 5 ECTS credits). There are therefore 105 hours available for class preparation and follow-up work and exam preparation. |
| Recommended prerequisites (modules): None. |
| Recommended as prerequisite for: PIB220 Graph Theory PIB225 Digital Electronics PIB240 PIB330 Databases PIB420 Computer Networks PIB440 Project Work PIBWI19 Machine Learning PIBWI55 Compiler Construction [updated 26.04.2021] |
| Module coordinator: Prof. Dr. Klaus Berberich |
| Lecturer: Prof. Dr. Klaus Huckert Dipl.-Math. Wolfgang Braun (exercise) [updated 01.04.2006] |
| Learning outcomes: - Introduction to the basic terminology of informatics - Understanding the algorithm concept - Introduction to example problems used in the ‘Programming Languages I’ modulePreparatory work for the ‘Digital Electronics’ module [updated 08.05.2008] |
| Module content: Fundamentals of computer systems - The structural and functional principles underlying computer systems - Common applications and the related application software - Computer networks Introduction to algorithms - The ‘algorithm’ concept - The quality of algorithms - The Landau notation for classifying algorithms - Computability - Examples of algorithms (approx. 20 examples) - Run-time analysis of algorithms Logic and digital electronics - Binary logic - Minimization of logical functions - Boolean algebra - Analysis and synthesis of combinatorial circuits: the basic principlesExamples of synthesised combinatorial circuits [updated 08.05.2008] |
| Teaching methods/Media: PowerPoint slides, lecture notes [updated 08.05.2008] |
| Recommended or required reading: SOLYMOSI A., GRUDE U.: Grundkurs Algorithmen und Datenstrukturen, Vieweg, 2001 LAFORE, R.: Data Structures and Algorithms in JAVA, Waite Press, 1998 [updated 08.05.2008] |
| Module offered in: WS 2016/17, WS 2015/16, WS 2014/15, WS 2013/14, WS 2012/13, ... |
[Sat Oct 1 01:38:12 CEST 2022, CKEY=pinfog, BKEY=pi, CID=PIB115, LANGUAGE=en, DATE=01.10.2022]