SYLLABUS
University: Technical University of Košice
Faculty: Faculty of Electrical Engineering and Informatics
Department: Department of Mathematics and Theoretical Informatics
Course Number: 2619611 Course Name: Discrete Mathematics
Type, scope and method of learning activities:
Course Type: Lecture, Seminar, Numerical exercises
Recommended scope of the course content (in hours):
Full-time study (hours per week): 3,1,2
Part-time study (hours per semester): 39,13,26
Study Method: Attendance
Number of credits: 6
Recommended semester of study: WT
Recommended semester Study programme Study grade Study Method
2.rok WT Informatics (INF_Bc_D_sk)
Business informatics (HI_Bc_D_sk)
Informatics (INF_Bc_D_en)
Computer networks (PS_Bc_D_sk)
Cybersecurity (KB_Bc_D_sk)
Business informatics (HI_Bc_D_en)
Bachelor
Bachelor
Bachelor
Bachelor
Bachelor
Bachelor
Attendance
Attendance
Attendance
Attendance
Attendance
Attendance
Level of study: Bachelor
Prerequisites:
Course completion requirements:
Assessment and completion of the course: Credit test and examination
Continuous assessment: Student passes the continuous assessment and receives credits when he or she meets the requirement to obtain at least 1u out of 1u16% out of 30%.
written form test
Final assessment: Student passes the final assessment and passes the examination when he or she meets the requirement to obtain at least 36% out of 70%.
oral form exam
Overall assessment: Overall assessment is the sum of the assessments obtained by students in the assessment period. The overall result is determined in accordance with the internal regulations of the Technical University in Košice. (Study Regulations, the internal regulation principles of doctoral studies)
Learning outcomes:
To present the basic theoretical knowledge from Boolean algebra and to show the applications of the boolean functions. To introduce the basic algebraic structures and combinatorial princples and methods for algorithms evaluation.
Brief course content:
- Some set properties, theory of numbers,
- Binary relations and mappings, partially ordered sets,
- Lattices, Boolean algebras, Boolean functions,
- Propositional logic
- Formulas of a propositional logic, predicate logic, predicate calculus,
- Graphs, special graphs,
- Directed graphs, acyclic directed graphs and trees,
- Planar graphs, graph colloring,
- Acyclic graphs, spanning trees, binary graphs,
- Graph applications, graph algorithms, network flows.
Recommended Reference Sources:
Rosen, K. H.: Discrete Mathematics and its Applications. AT@T Information systems, New York, 1988.
Recommended optional program components:
Languages required for the course completion: Slovak
Notes:
Course assessment:
Total number of students assessed: 2467
  A B C D E FX  
  3% 6% 10% 21% 27% 32%  
Teacher:
doc. RNDr. Marián Klešč, PhD.
RNDr. Emília Draženská, PhD.
prof. RNDr. Ján Plavka, CSc.
RNDr. Mária Timková, PhD.
RNDr. Juraj Valiska, PhD.
Last modified: 01.09.2022
Approved by: person(s) responsible for the study program