Course syllabus EBC-TZI - Theoretical Foundations of Informatics (FBE - WS 2020/2021)


     Czech          English          


Course code: EBC-TZI
Course title in Czech:
Theoretical Foundations of Informatics
Course title in English:
Theoretical Foundations of Informatics
Semester:
WS 2020/2021
Mode of completion and number of credits: Exam (6 credits)
Mode of delivery and timetabled classes:
full-time, 2/2 (hours of lectures per week / hours of seminars per week)
part-time, 16/0 (lectures per period / seminars per period)
Level of course:
bachelor
Course type:
required
Type of delivery: usual, consulting
Mode of delivery for our mobility students abroad:
The course cannot be studied during the study foreign internship.
Language of instruction:
Czech, Slovak
Course supervisor:
Course supervising department:
Department of Informatics (FBE)
Faculty: Faculty of Business and Economics
Teachers: Ing. Mgr. Jana Dannhoferová, Ph.D. (instructor, tutor)
Ing. Dita Dlabolová, Ph.D. (instructor, tutor)
Mgr. Tomáš Foltýnek, Ph.D. (examiner, lecturer, supervisor, tutor)
Ing. Pavel Haluza, Ph.D. (examiner, instructor, lecturer, tutor)
Ing. Pavel Turčínek, Ph.D. (instructor, tutor)
Prerequisites:
 
Timetable in this semester:
-- item not defined --
 
Aim of the course and learning outcomes:
The course is established as a theoretical introduction to problems of informatics and computer technology. Mathematical logic, foundations of the set theory, graph theory and introduction to the theory of systems are emphasized. Students get acquainted with basic theoretical sciences used in analysis and projecting of software and information systems.
 
Course content:
1.
Mathematic logic (allowance 10/10)
 
a.
Propositional logic
b.
Predicate logic

2.
Set theory (allowance 10/12)
 
a.
Basic terms of set theory
b.
Set operations
c.Relations
d.Mappings
e.Operations

3.Graph theory (allowance 6/6)
 
a.
Basic terms of graph theory
b.
Graph algorithms
c.
Implementation of graphs

4.
Theory to system theory (allowance 2/0)
Learning activities and teaching methods:
Type of teaching methodDaily attendanceCombined form
lecture
28 h
16 h
practice28 h
0 h
consultation
0 h
40 h
preparation for exam56 h112 h
preparation for regular testing
56 h
0 h
Total
168 h168 h
 
Assessment methods:
Full-time students receive the credit according to the results of ongoing tests and activity.
There are 3 tests, maximum for each is 10 points, a student needs to get 4 points from each test, and at least 20 points in total from tests and activity.
Students have two repair possibilities (at each of them, 1 test to repair is chosen).

The final exam has two parts: theoretical (10 tasks of 2 points) and practical (8 task of 5 points).
For the successful completion 50 % of each part is needed.

The final evaluation is given by the sum of ongoing tests, activity and exam test:
A (at least 90 points), B (83 points), C (75 points), D (68 points), E (60 points).

Students in combined form of study are not required for credit tests.
Practical tasks for them are included in the exam test, from which 100 points can be obtained.
The final evaluation is given by the same scale as in the full-time form of study.

In the case of fraudulent conduct, student will be graded F and disciplinary proceedings will be initiated.
 
Assessment criteria ratio:
Requirement type
Daily attendance
Combined form
Active lecture/seminar/workshop/tutorial participation
10 %
0 %
Mid-term test(s)
30 %
0 %
Final test
60 %
100 %
Total
100 %
100 %
 
Recomended reading and other learning resources:
Basic:
VANÍČEK, J. et al. Teoretické základy informatiky. 1st ed. Praha: Kernberg, 2007. 431 p. Informatika studium. ISBN 978-80-903962-4-1.
FOLTÝNEK, T. -- DANNHOFEROVÁ, J. -- HALUZA, P. -- MIŠOVIČ, M. Teoretické základy informatiky (sbírka úloh do cvičení). 1st ed. Brno: Konvoj, 2011. 70 p. ISBN 978-80-7302-147-4.

Recommended:
FORSTER, T E. Logic, induction and sets. Cambridge: Cambridge University Press, 2003. 234 p. London Mathematical Society student texts. ISBN 0-521-82621-7.
GROSS, J L. -- YELLEN, J. Handbook of graph theory. Boca Raton: CRC Press, 2004. 1167 p. Discrete mathematics and its applications. ISBN 1-58488-090-2.
FOLTÝNEK, T. Teorie množin i pro úplné idioty. Brno: Konvoj, 2016. 111 p. ISBN 978-80-7302-171-9.
HABR, J. -- VEPŘEK, J. Systémová analýza a syntéza: (Moderní přístup k řízení a rozhodování) : Určeno [též] posl. vys. škol. ekon zaměření. 1st ed. Praha: SNTL, 1973. 271 p. Řada ekon. literatury.
PLESNÍK, J. Grafové algoritmy. Bratislava: VEDA, 1993.
TICHÝ, Z. -- ŠKRÁŠEK, J. Základy aplikované matematiky I. SNTL, 1983.
Výuková opora dostupná na https://mendelu.sharepoint.com/sites/AkreditaceUIPEF/Sdilene%20dokumenty/Forms/AllItems.aspx uživatel: akreditace.ui@pef.mendelu.cz heslo: rpy2vd8A

Course listed in study plans for this semester:
Programme B-AII Administration IS/ICT, full-time form, initial period WS 2020/2021
Programme B-AII Administration IS/ICT, part-time form, initial period WS 2020/2021
Field of study B-II-CAI Automation Control and Informatics, full-time form, initial period WS 2020/2021
Field of study B-SE-EI Economic informatics, full-time form, initial period WS 2020/2021
 
Course listed in previous semesters:
Teaching place:
Brno


Last modification made by Ing. Jiří Gruber on 07/08/2020.

Type of output: