This is the main course website for the lecture "Bits, Bytes, and Beyond: Foundations of Computer Science" given in winter term 2024/25 at University of Bayreuth.
News¶
- 18. October 2024: Lecture starts! See the schedule to access material.
Syllabus¶
This course provides insights into basic methods and concepts from computer science, such as lists, search and sorting methods, binary trees, search trees, graphs, complexity of algorithms, and algorithm theory.
Students will learn to structure and dynamically represent data as well as to analyze the complexity of algorithms.
This course is part of the philosopher’s track of the (M.A./M.Sc. Philosophy & Computer Science program)[https://www.uni-bayreuth.de/en/master/philosophy-computer-science] and provides philosophers with basic computer science knowledge for more advanced courses.
Schedule¶
In this section, you will find the outline of the lecture together with slides, code, and additional material.
Introduction¶
Title | Slides | |
---|---|---|
Motivation of the lecture |
Legend:
Session was a lecture | |
Session was a practical | |
Find a video here | |
Find slides here | |
Find code material here | |
Find external material here | |
This session has a self assessment quiz attached | |
This session has a script with gap text attached |
References¶
- Till Tantau. Algorithmendesign. Online, 2018. https://www.tcs.uni-luebeck.de/de/mitarbeiter/tantau/lehre/lectures/Algorithmendesign-2016.pdf.
- Till Tantau. Komplexitätstheorie. Online, 2018. https://www.tcs.uni-luebeck.de/de/mitarbeiter/tantau/lehre/lectures/Komplexitaetstheorie-2018.pdf.
- Till Tantau. Einführung in die Informatik. Online, 2016. https://www.tcs.uni-luebeck.de/de/mitarbeiter/tantau/lehre/lectures/EinfuehrungindieInformatik-2016.pdf.