Document Actions

Computer Science Theory (Bridging Course) (Tutorial)

The course introduces the foundations of theoretical computer science. The first part covers automata theory and formal languages and grammars. The second part provides a precise definition of the term "computability" and shows the limitations of computational models. The third part introduces complexity theory, especially the class of NP-complete problems.

News

July 29th: There will be a two-hour meeting where we answer your questions on Friday, August 8th, 14:00-16:00, building 101 room 02-016/18.

July 22nd: Details about the final exam were updated (topics: everything including the topics of the intermediate exam).

July 8th:

We change the course interval back to one-week.

The last exercise of the intermediate exam is considered a bonus exercise.

June 15th: The time for the intermediate exam was corrected (12:15).

June 3rd: A mistake in the second lecture notes, chapter Closure Properties, was fixed.

May 30th: The intermediate exam was added to the exam section. Please note the different room.

May 19th:

Starting on May 26th, we will change the course interval from one-week to two-week. This means that tutorials are only visited every second week, but for 60 minutes instead of 30 minutes. Accordingly, exercise sheets will be designed for two weeks of work. However, lectures are still given weekly.

The hint in exercise 3 on sheet 3 was misleading. It was removed.

May 15th: The section "Lectures" was added.

May 9th:

The lecture script was updated (this will only be announced in the "Script" section below in the future).

A typo was corrected on exercise sheet 1.

April 30th:

The introduction slides were updated. They now contain a page with all relevant email addresses. These were also added below.

A test file and an exercise sheet solution template for TeX was added.

April 29th:

The section "Formalities" was updated according to the introductory presentation. The slides can be found below.

A short introduction to TeX was added.

April 10th: The course script has been relocated on our web server. The link below was updated accordingly.

Formalities

There will be no classical lecture. Instead, the participants are supposed to work through the course script (see below) themselves. We provide exercise sheets and tutorials every week to make sure the contents were understood correctly.

Admission criterion

Each exercise sheet will contain several exercises.

We have two criteria for exam admission.

All tutorials are attended.

All exercises are solved.

In case a tutorial cannot be attended (illness etc.), the tutors must be informed in advance. To contact the tutors, use this email address: csBridgeTutors@david-zschocke.de

Exercises & Tutorials

Every week we publish a new exercise sheet and offer an individual tutorial for each participant of half an hour. The participants have to weekly perform the following algorithm.

Exercises

Presentations

TeX / LaTeX

To typeset documents in TeX, a distribution is needed. There are many packages for different applications. Altogether, they require much disk space. Usually a thin version with just the most important packages is enough. Packages can be installed separately if needed. Here are the three most prominent distributions (cf. Wikipedia "Distributions").