Theory: 50 %

Practice: 50 %

Recommended semester: 1

Study mode: full-time

Prerequisites: -

Evaluation type: term mark

Course category: compulsory

Language: english

Responsible instructor: Dobjánné dr. Antal Elvira Mercédesz

Responsible department: Department of Basic Sciences

Instructor(s): Dr. Végh Attila , Dr. Végh Attila, Dr. Nagy Gábor

Course objectives:
Introduction to the basic concepts, terminology, theorems and connections of mathematical logic, set theory, combinatorics, and graph theory.

Course content - lectures:

1. Fundamentals of logic I.: propositions, equivalence. 2. Fundamentals of logic II.:predicates and quantifiers. 3. Rules of inference and proofs. 4. Sets, cartesian product of sets, set operations. 5. Correspondences, relations, functions. 6. Relations: Equivalence relations and partitions. 7. Permutations. 8. Combinatorics of finite sets. 9. Binomial theorem and multinomial theorem. 10. Mathematical induction. 11. Graphs, trees, graph coloring. 12. Basic graph algorithms. 13. Knowledge test.

Course content - seminars:

Problem solving relating to the lecture syllabus.

Acquired competences:
Knowledge:

- Knowledge of the principles and methods of natural sciences (mathematics, physics, other natural sciences) relevant to the field of IT.

Skills:

- He/she uses the principles and methods of natural sciences (mathematics, physics, other natural sciences) relevant to the field of information technology in his/her engineering work for the design of information systems.

Attitude:

- He/she makes decisions with full respect for the law and ethical standards in decision-making situations requiring a complex approach. - He/she makes an effort to work efficiently and to high standards.

Autonomy and responsibilities:

Additional professional competences:

- Efficient use of digital technology, knowledge of digital solutions to fulfill educational objectives

Requirements, evaluation, grading:
Mid-term study requirements:
Visiting lectures, taking notes, preparation for seminars and active participation in problem solving. Two written examinations during the course.
Exam requirements:

-

Study aids, laboratory background:

Lecture slides, concept checks and learning goals will be posted for each lectures.

Compulsory readings:

Recommended readings:

R.P. Grimaldi: Discrete and Combinatorial Mathematics: Pearson New International Edition. 5th edition, Pearson, 2013 ISBN: 978-1292035994 E. Lehman, F.T. Leighton, A.R. Meyer: Mathematics for Computer Science. Creative Commons electronic edition, revised 18th May, 2015 http://people.csail.mit.edu/meyer/mcs.pdf K.H. Rosen: Handbook of Discrete and Combinatorial Mathematics. 2nd edition, Chapman and Hall/CRC, Discrete Mathematics and Its Applications Series (Book 8), 2016 ISBN: 978-1584887805