## Professional study programme

Back   Loomen   Schedule   Hrvatski

## Course groups

Prikaži sve grupe na predmetu

## Course description

Mathematical logic. Operations in logic. Truth tables. Tautolog. Predicate calculus. Whole numbers (integers). Divisibilty, prime numbers, congruence. Eulers function. Binary relations. Equivalence relations, set partition. Order relations, networks. Binary operations. Algebraic structures. Groups. Examples of finite groups. Rings. Rings of whole numbers (integers). Boolean algebras. Representation of Boolean algebra. Boolean functions. Combinatorics. Finite sets. Product of sets. Denumeration methods. Permutations. Permutation groups. Combinations. Variations. Recursion relations. Fibonacci sequence. Stirling number. Linear recursion formulae. Block designs. Finite projection planes.

## Knowledge and skills acquired

Students will be introduced to the fundamental concepts and simple examples from the fields of logic, algebraic structures, relations and combinatorics. They will also be trained and prepared for long-life learning and use of mathematical structures, relations and operations as application tools.

## Teaching methods

Students are obliged to attend both lectures and laboratory practice.

## Student requirements

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

## Monitoring of students

Defined by the Student evaluation criteria of the Faculty of Electrical Engineering, Computer Science and Information Technology Osijek and paragraph 1.9

## Student assessment

During the semester, students can take several tests which replace the written examination. This ensures continuous assessment of studentsâ€™ work and knowledge.

## Obligatory literature

1. 1 D. Žubrinić Diskretna matematika Element, Zagreb,2001

2. 2 Anderson, I. A first Course in Discrete Mathematics Springer Verlag, 2001.

Pretraži literaturu na:

1. 1 D. Veljan Kombinatorna I diskretna matematika Algoritam, Zagreb, 2001.

2. 2 S. Lipschutz Discrete Mathematics McGraw Hill, New York, 1986.

## Examination methods

Final exam consists of the written and oral exam.

## Course assessment

Conducting university questionnaires on teachers (student-teacher relationship, transparency of assessment criteria, motivation for teaching, teaching clarity, etc.). Conducting Faculty surveys on courses (upon passing the exam, student self-assessment of the adopted learning outcomes and student workload in relation to the number of ECTS credits allocated to activities and courses as a whole).

## Overview of course assesment

Learning outcomes
Upon successful completion of the course, students will be able to:

1. design and simplify CNF and DNF

2. define, discuss and use the basic facts in the set theory

3. construct the solution for the given problem based on number theory by using Euler's and Fermat's little theorem

4. develop software solving a specific task in popular discrete mathematics related to logical reasoning

Aktivnosti studenta: Vidi tablicu aktivnosti