Zał.
nr 4 do ZW 64/2012
FACULTY of Informatics and Management / DEPARTMENT………………
SUBJECT CARD
Name in Polish: Teoria obliczeń
Name in English: Theory of Computation
Main field of study (if applicable): Informatics
Specialization (if applicable): ……………………..
Level and form of studies: 1st/ 2nd* level, full-time / part-time*
Kind of subject: obligatory / optional / university-wide*
Subject code INZ0294Wc
Group of courses YES / NO*
Lecture Classes Laboratory Project Seminar
Number of hours of 30 30
organized classes in
University (ZZU)
Number of hours of 60 90
total student workload
(CNPS)
Form of crediting Examination / Examination / Examination / Examination / Examination /
crediting with crediting with crediting with crediting with crediting with
grade* grade* grade* grade* grade*
For group of courses X
mark (X) final course
Number of ECTS points 2 3
including number of 0 0
ECTS points for practical
(P) classes
including number of 1,2 1,8
ECTS points for direct
teacher-student contact
(BK) classes
*delete as applicable
PREREQUISITES RELATING TO KNOWLEDGE, SKILLS AND OTHER COMPETENCES
1. Logic, set theory.
2. Discrete mathematics.
3. Algorithms and data structures.
\
SUBJECT OBJECTIVES
C1 Introduce basic models of computation.
C2 Prove fundamental limits on computation (the halting problem, incomputability).
SUBJECT EDUCATIONAL EFFECTS
relating to knowledge:
PEK_W01 Student knows basic models of computation.
PEK_W02 Student understands fundamental limits on computation.
PEK_W03 Student understands mathematical proofs.
relating to skills:
PEK_U01 Student is able to make use of formal models, e.g. finite automata, formal grammars.
PEK_U02 Student builds formal models of computation with given properties.
PEK_U03 Student manipulates formal models of computation (minimization, transformation).
PEK_U04 Student carries out simple proofs.
relating to social competences:
PEK_K01 Students knows the limitations of his/her knowledge and understands the need for
further studies.
PROGRAMME CONTENT
Form of classes - lecture Number of hours
Lec 1 Overview. 2
Lec 2 Reminder of set theory. 2
Lec 3 Formal languages and grammars. 2
Lec 4 Propositional logic. 2
Lec 5 Predicate logic. 2
Lec 6 Predicate logic and induction, cont. 2
Lec 7 Deterministic finite automata. 2
Lec 8 Applications of the Myhill-Nerode theorem. 2
Lec 9 Nondeterministic finite automata. 2
Lec 10 Countability and uncountability. 2
Lec 11 Encoding. 2
Lec 12 Computability. 2
Lec 13 Computability, cont. 2
Lec 14 Written test. 2
Lec 15 Nondeterminism in computability theory. 2
Total hours 30
Form of classes - class Number of hours
Cl 1 Administrative class. Grading policy. 2
Cl 2 Set theory. 2
Cl 3 Formal languages and grammars. 2
Cl 4 Formal languages and grammars. 2
Cl 5 Propositional logic. 2
Cl 6 Predicate logic. 2
Cl 7 Predicate logic and induction. 2
Cl 8 Deterministic finite automata. 2
Cl 9 Written test. 2
Cl 10 Applications of the Myhill-Nerode theorem. 2
Cl 11 Nondeterministic finite automata. 2
Cl 12 Countability and uncountability. 2
Cl 13 Encoding. 2
Cl 14 Computability. 2
Cl 15 Computability. 2
Total hours 30
TEACHING TOOLS USED
N1. Lecture supported by multimedia presentations.
N2. E-learning system used to publish teaching materials and messages.
EVALUATION OF SUBJECT EDUCATIONAL EFFECTS ACHIEVEMENT
Evaluation (F – Educational Way of evaluating educational effect achievement
forming (during effect number
semester), P –
concluding (at
semester end)
F1 PEK_W01 Grading homework exercises solved at classes and declared
- PEK_W03 as solved.
PEK_U01
- PEK_U04
PEK_K01
F2 PEK_W01 Written tests.
- PEK_W03
PEK_U01
- PEK_U04
C The overall grade of the course is (C+T)/2 rounded off. H is the grade for classes, and T is the grade
for two written tests.
PRIMARY AND SECONDARY LITERATURE
PRIMARY LITERATURE:
[1] Hopcroft J.E., Motwani R., Ullman J.D., Automata Theory, Languages, and Computation, 3rd ed., Pearson 2007.
[2] Rosenberg A.L., The Pillars of Computation Theory. State, Encoding, Nondeterminism, Springer 2009.
SECONDARY LITERATURE:
[1] M.Sipser, Introduction to the Theory of Computation, 2nd ed., Thomson Course Technology 2006.
SUBJECT SUPERVISOR (NAME AND SURNAME, E-MAIL ADDRESS)
Zdzisław Spławski,
[email protected] MATRIX OF CORRELATION BETWEEN EDUCATIONAL EFFECTS FOR
SUBJECT
Theory of Computation
AND EDUCATIONAL EFFECTS FOR MAIN FIELD OF STUDY
Informatics
AND SPECIALIZATION ……………………………..
Subject educational effect Correlation between subject Subject Programme Teaching tool
educational effect and objectives*** content*** number***
educational effects defined for
main field of study and
specialization (if applicable)**
PEK_W01 (knowledge) K1INF_W02 C1Lec1-Lec9 N1, N2
PEK_W02 K1INF_W02 C1, C2
Lec10-Lec13, N1, N2
Lec15
PEK_W03 K1INF_W02 C1, C2 Lec2-Lec15 N1, N2
PEK_U01 (skills) K1INF_W02 C1 Cl3-4, Cl8-11, N2
Lec14
PEK_U02 K1INF_W02 C1 Cl3-4, Cl8-11, N2
Lec14
PEK_U03 K1INF_W02 C1 Cl3-4, Cl8-11, N2
Lec14
PEK_U04 K1INF_W02 C1, C2 Cl2-Cl15, Lec14 N2
PEK_K01 (competences) K1INF_K01 C2 Lec10-Lec15, N1, N2
Cl12-Cl15
** - enter symbols for main-field-of-study/specialization educational effects
*** - from table above
