Introduction to Computer Science

Lecturer:

Jan Mareš (gar.)

Tutor:

Jan Mareš (gar.)

Supervisor:

Department of Mathematics

Synopsis:

Fundamental notions of computer science: algorithms, various types of automata, introduction to information theory and coding theory.

Requirements:

Syllabus of lectures:

Algorithms and algorithmically computable functions, algorithmically definable sets. Markov?s normal algorithms, Turing machines, pushdown storage automata, finite automata.

Sequential machines, analysis, synthesis and minimization. Introduction to information theory and coding theory.

Syllabus of tutorials:

Study Objective:

To acquaint the students with fundamentals parts of computer science.

Study materials:

povinná

H.R. Lewis, C.H.Papadimitriou: Elements of the Theory of Computation. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.

doporučená

Z. Manna: Mathematical Theory of Computation. Mc.Graw-Hill,Inc. 1974.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: