Theoretical Computer Science (Bridging Course)(Tutorial) - SS 2015
Aims of the lectureThe participants should get a foundational knowledge of the theoretical aspects of computer science.
Contents of the lectureThis course will address theoretical aspects of computer science. It comprises the fundamental mathematical properties of computer hard- and software. We will see what can be computed and how efficiently, as well as what cannot. More specifically, the following topics will be included:
- Formal languages
- Formal grammars
- Turing machines
- Complexity theory
Rooms and TimesThere will be no classical face to face lectures. Instead, the participants are supposed to follow the video recordings themselves. We provide exercise sheets and tutorials every week, to make sure the material is understood properly.
- Mon 20 April 2015, 10-12 in building 52, SR 02-017: Introduction
- Mon, 10-12 in building 52, SR 02-017: By appointment
- Final Exam:
- Mon 31st August 2015, 10-12 in building 101, SR 01-016
LanguageLectures are held in English, course material and exercise sheets are in English. Students may ask questions and submit exercise sheets in English.
Credit Points6 ECTS points
Course BookMichael Sipser. "Introduction to the theory of computation". PWS Publishing Co., Boston, MA, 1996
- There is a QnA forum from the last semester for questions.
- Teaching is done in English.
|DFA, NFA, Regular Languages||03.pdf||MP4||Sheet1||Sheet1|
|Regular Languages and closure wrt elementary operations||---||---|
|Context Free Grammars||04.pdf||MP4||Sheet3||Sheet3|
|Context Free Grammars||MP4||---||---|
|Pumping Lemma for Context Free Grammars||MP4||Sheet5||Sheet5|
|Decidability and decidable languages.||06.pdf||MP4||---||---|
|Decidability, mathematical backgrounds on cardinality, Cantor's diagonal argument||MP4||Sheet7||Sheet7|
|Decidability and the halting problems.||MP4||---||---|
|Propositional Logic and basic definitions, CNF/DNF, logical entailment.||08.pdf||MP4||---||---|
|Propositional Logic. Deduction/Contraposition/Contradiction Theorems and Derivations.||MP4||Sheet11||Sheet11|
|Propositional Logic. Derivations, Soundness and Completeness of calculi.||MP4||---||---|
|Propositional Logic. Refutation-completeness and Resolution.||MP4||Sheet12||Sheet12|
|First Order Logic. Derivations.||09.pdf||MP4||---||---|
|First Order Logic. Satisfaction, closed formulae and brief overview on Normal Forms.||MP4||---||---|
|Review of some old exam questions. QnA.||Revision Sheet||n/a||---||Solutions|