Discrete Mathematics Course code: 100507 | 6 ECTS credits

Basic information

Level of Studies: Undergraduate applied studies

Year of Study: 1

Semester: 2

Requirements:

Goal: Introduction to the mathematics of computer science, or the synthesis of various mathematical disciplines, such as mathematical logic, theory of sets, graph theory, combinatorics, and others.

Outcome: Students will be able to solve the problems of discrete structures that are the basis of the work of modern computer systems.

Contents of the course

Theoretical instruction:

Graphs.
Trees. Applications of trees in computing.
Relations at finite sets. Relation representation.
Relations of equivalence and order.
Introduction to Combinatorics.
First colloquium.
State account.
Boolean functions.
Predicate account.
Finite state automaton and regular grammar.
Connecting and minimizing automata.
Code Theory.
Second colloquium.

Practical instruction (Problem solving sessions/Lab work/Practical training):

Practical classes follow the program of lectures and take place through exercises in the computer laboratory, using the software package Maple.

Textbooks and References

A. Savić, S.Štrbac-Savić, Diskretna matematika i algoritmi, VIŠER, Beograd, 2015.
A. Savić, S.Štrbac-Savić, I.Stefanović, Diskretna matematika i algoritmi – priručnik za laboratorijske vežbe, VIŠER, Beograd, 2015.

Number of active classes (weekly)

Lectures: 3

Practical classes: 2

Other types of classes: 0

Grading (maximum number of points: 100)

Pre-exam obligations

Points

activities during lectures

activities on practial excersises

seminary work

colloquium

Final exam