Undergraduate study programme

Back   Schedule   Hrvatski

Mathematical Basics of Computing PR101

ECTS 5 | P 45 | A 0 | L 15 | K 0 | ISVU 174586 | Academic year: 2019./2020.

Course groups

Prikaži sve grupe na predmetu

Course lecturers



The aim of the course is to introduce students to the basics of mathematical logic, mathematical language, set theory, graph theory and networks, mathematical structures and complexity algorithms with the final aim of applying acquired knowledge in solving complex computer problems by using the algorithmic approach.

Conditions for enrollment

Requirements met for enrolling in the study programme

Course description

Basics of mathematical language - theorems and proofs. Basics of mathematical logic. Traditional logic. Propositional calculus. Alphabet of propositional calculus. Semantics and Syntax. Connectives and implementation in programming languages. Basics of the set theory. Element, subset, partitive set, set operations. Empty set. Basic algebraic structures. Basics of the graph theory. Types of graphs. Methods of assignments. Paths, cycles, trees and walks. Problems in the graph theory. Basics of the network theory. Definitions and examples. Problems in the network theory and algorithms for solving. Search and sorting. The complexity of problem solving algorithms for the mentioned computing areas.

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

Obligatory literature

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

2. 2 O. Levin Discrete Mathematics: An Open Introduction (2nd. Ed.) CreateSpace Independent Publishing Platform, 2016.

3. 3 S. Epp Discrete Mathematics with Applications (4th Ed.) Cengage Learning, 2010.

Pretraži literaturu na:

Recommended additional literature

1. 1 M. W. Baldoni, C. Ciliberto, G.M.P. Cattane Elementary Number Theory, Cryptography and Codes Springer, 2009.

2. 2 S. S. Skiena The Algorithm Design Manual (2nd Ed.) Springer, 2009.

3. 3 R. Graham, D.E. Knuth, O. Patashnik Concrete Mathematics (2nd Ed.) Addison-Wesley, 2004.

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. understand the principles of mathematical logic, set theory, graph theory and networks

2. understand the mathematical structure and language when studying these structures

3. create an algorithm for a given problem using mathematical logic, set theory and graph and network theory

4. create algorithms using laws of basic mathematical structures

5. analyse the complexity of developed algorithms

6. construct a new algorithm of less time complexity based on the data of the given algorithm

Aktivnosti studenta: Vidi tablicu aktivnosti