Submitted:
03 July 2024
Posted:
04 July 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Mathematics I
2.1. Topics of Mathematics I
2.2. Semester Exam in Mathematics I
2.3. Example of a Semester Exam in Mathematics I
2.4. Students’ Success in the Mathematics I Exam
2.5. Students’ Success in Solving Single Types of Tasks in the Mathematics I Exam
3. Mathematics II
3.1. Topics of Mathematics II
3.2. Semester Exam in Mathematics II
3.3. Example of a Semester Exam in Mathematics II
3.4. Students’ Success in the Mathematics II Exam
3.5. Students’ Success in Solving Single Types of Tasks in the Mathematics II Exam
4. Mathematics III
4.1. Topics of Mathematics III
4.2. Semester Exam in Mathematics III
4.3. Example of a Semester Exam in Mathematics III
is given. Write the state-transition table and decide which of the words , , , , , the finite-state machine recognizes. [10 points]4.4. Students’ Success in the Mathematics III Exam
4.5. Students’ Success in Solving Single Types of Tasks in the Mathematics III Exam
5. Graph Theory
5.1. Topics of Graph Theory
5.2. Classified Credit in Graph Theory
5.3. Example of a Classified Credit Test in Graph Theory

5.4. Students’ Success in the Classified Credit Test in Graph Theory
5.5. Students’ Success in Solving Single Types of Tasks in the Classified Credit Test in Graph Theory
6. Discussion
6.1. the Least and Most Successful Types of Tasks in the Mathematics I Exam
6.2. the Least and Most Successful Types of Tasks in the Mathematics II Exam
6.3. the Least and Most Successful Types of Tasks in the Mathematics III Exam
6.4. the Least and Most Successful Types of Tasks in the Graph Theory Classified Credit
7. Conclusions
Funding
Acknowledgments
Conflicts of Interest
Abbreviations
| AS | Average score |
| AY | Academic year |
| CC | Laboratory exercises in a computer classroom |
| EX | Exercises |
| GCD | Greatest common divisor |
| HS | Hourly subsidy |
| LCM | Least common multiple |
| LE | Lecture |
| NS | Number of students |
References
- Jánský, J.; Potůček, R. The Tradition and New Approach to the Mathematical Education of Officers in the Czech Army. Studies in Systems, Decision and Control, Flaut, D. et al. (Eds): Decision Making in Social Sciences: Between Traditions and Innovations, Switzerland: Springer International Publishing. 2020; 247, 155–168ISBN 978-3-030-30658-8. [Google Scholar] [CrossRef]
- Abdulwahed, M.; Jaworski, B.; Crawford, A.R. Innovative Approaches to Teaching Mathematics in Higher Education: A Review and Critique. Nordic Studies in Mathematics Education 2012, 17 (2), 49–68. Available online: https://dspace.lboro.ac.uk/dspace-jspui/handle/2134/11988 (accesed on 28-05-2024).
- Intranet of University of Defence – Accredited Study Programs. Available online: https://apl.unob.cz/Akreditace/Programy.aspx (accesed on 28-05-2024).
- Hošková-Mayerová, Š.; Potůček, R. Qualitative and quantitative evaluation of the entrance draft tests from mathematics. Studies in Systems, Decision and Control Antonio Maturo et al. (Eds): Recent Trends in Social Systems: Quantitative Theories and Quantitative Models, Switzerland: Springer International Publishing, ISBN 978-3-319-40583-4. 2017, 66, 53–46. [Google Scholar]
- Arney, C.; Vanatta, N.; Nelson, T. Cyber Education via Mathematical Education. The Cyber Defence Review Fall 2016, 49-59. Connolly, J.C. (Editor in Chief), West Point, New York. ISSN 2474-2120. Available online: https://cyberdefensereview.army.mil/Portals/6/Documents/CDR-FALL2016.pdf (accesed on 28-05-2024).
- Carriegos, M.V. Main challenges in teaching/learning of mathematics for cyber-security. Conference: INDRUM 2016: First conference of the International Network for Didactic Research in University Mathematics, Montpellier, France. Available online: https://hal.archives-ouvertes.fr/hal-01337917 (accesed on 28-05-2024).
- Byrd, R. Cybersecurity: 1) what math is necessary and 2) developing ubiquitous cybersecurity in current computing programs. Journal of Computing Sciences in Colleges 2018, 33/4, 53–59. [Google Scholar] [CrossRef]
- Knijnenburg, B.P.; Bannister, N.; Caine, K. Using Mathematically-Grounded Metaphors to Teach AI-Related Cybersecurity. IJCAI-21 Workshop on Adverse Impacts and Collateral Effects of Artificial Intelligence Technologies (AIofAI), Montréal, Canada. Available online: https://par.nsf.gov/biblio/10273277-using-mathematically-grounded-metaphors-teach-ai-related-cybersecurity (accesed on 28-05-2024).
- Neri, F. Teaching Mathematics to Computer Scientists: Reflections and a Case Study. SN COMPUT. SCI. 2021, 2(75). [Google Scholar] [CrossRef]
- Koziuk, Y. Application of Mathematics in Cyber security. Thesis, Vinnytsia National Technical University, Ukraine, June 2023. [CrossRef]
- MOOC BLOG TEAM: How is math used in cybersecurity? 2024. Available online: https://www.edx.org/resources/how-is-math-used-in-cybersecurity (accesed on 28-05-2024).
- Bowcut, S. Why math matters in cybersecurity. Cybersecurity Guide 2024. Available online: https://cybersecurityguide.org/resources/math-in-cybersecurity (accesed on 28-05-2024).




| # | Topic | HS | LE/EX/CC |
|---|---|---|---|
| 1 | Mathematical logic | 8 | 4/4/0 |
| 2 | Set theory | 8 | 4/4/0 |
| 3 | Binary relations | 8 | 4/2/2 |
| 4 | Mapping | 4 | 2/2/0 |
| 5 | Partially ordered sets | 4 | 2/2/0 |
| 6 | Combinatorics | 8 | 4/4/0 |
| 7 | Fields nad vector spaces | 8 | 4/4/0 |
| 8 | Matrices and matrix operations | 8 | 4/4/0 |
| 9 | Solving systems of linear equations | 10 | 4/4/2 |
| 10 | Vector subspaces and linear span | 4 | 2/2/0 |
| 11 | Intersection and sum of vector subspaces | 4 | 2/2/0 |
| 12 | Basis and dimension of vector space | 8 | 4/4/0 |
| 13 | Linear mapping | 8 | 4/4/0 |
| AY | A | B | C | D | E | F/E | F/F/E | TN |
|---|---|---|---|---|---|---|---|---|
| 2019/2020 | 3 | 3 | 2 | 1 | 4 | 3 | 1 | 17 |
| 2020/2021 | 3 | 1 | 4 | 4 | 4 | 1 | 1 | 18 |
| 2021/2022 | 4 | 6 | 6 | 11 | 3 | 0 | 0 | 30 |
| 2022/2023 | 0 | 1 | 2 | 4 | 3 | 3 | 1 | 14 |
| 2023/2024 | 1 | 0 | 4 | 5 | 6 | 6 | 4 | 26 |
| 2019/20–2023/24 | 11 (10.5%) | 11 (10.5%) | 18 (17.1%) | 25 (23.8%) | 20 (19.0%) | 13 (12.4%) | 7 (6.7%) | 105 |
| # | Type of exam task | NS | AS |
|---|---|---|---|
| 1 | Checking whether a propositional formula is a tautology/contradiction/consis- tent, conversion to disjunctive | ||
| normal form. | 20 | 6.95 | |
| 2 | Proof of the equality of expressions with natural numbers | ||
| by mathematical induction. / Proof of the statement of divisibility by mathematical induction. | 29 | 4.59 | |
| 3 | Combinatorics – combinatorial principles (product, sum, inclusion and exclusion), permutation, variation, combination | ||
| without repetition/with repetition. | 49 | 5.14 | |
| 4 | Binary relations and their properties. / Verification that the given relation is an equivalence relation, | ||
| decomposition into equivalence classes. | 49 | 3.67 | |
| 5 | Basic operations with matrices. / Determination the rank of a matrix depending on a parameter. | 22 | 6.23 |
| 6 | Verification that vectors/polynomials/matrices form a basis of the vector space. / Coordinates of a vector/polynomial/matrix | ||
| with respect to the basis. | 34 | 4.47 | |
| 7 | Determination the dimension and basis of a vector subspace and its completion based on the vector space. / Determination the basis and dimension of | ||
| the intersection and the sum of two vector subspaces of the given vector space. | 49 | 4.16 | |
| 8 | Determination the kernel, image, defect, and rank of a linear map. / Verification of the linearity of the | ||
| map and determination of its matrix. | 42 | 3.17 |
| # | Topic | HS | LE/EX/CC |
|---|---|---|---|
| 1 | Determinants, their calculation and application | 8 | 4/4/0 |
| 2 | Inverse matrices, their calculation and applications | 4 | 2/2/0 |
| 3 | Linear transformation, transition matrix | 8 | 4/4/0 |
| 4 | Eigenvalues and eigenvectors of a matrix and their calculation | 8 | 4/2/2 |
| 5 | Similar matrices, diagonalization of matrices, matrix functions | 4 | 2/2/0 |
| 6 | Scalar product, Euclidean space, orthogonal vectors | 8 | 4/4/0 |
| 7 | Finite and iterative methods of solving systems of linear equations | 8 | 4/2/2 |
| 8 | Divisibility criteria, Euclidean algorithm, Bézout’s identity | 4 | 2/2/0 |
| 9 | Prime numbers and composite numbers, Euclid’s theorem | 4 | 2/2/0 |
| 10 | Congruence relation, linear congruence equations and their systems | 6 | 2/4/0 |
| 11 | Euler’s totient function, Fermat’s little theorem, Euler’s theorem | 4 | 2/0/2 |
| 12 | Groupoids, semigroups, monoids, groups | 8 | 4/4/0 |
| 13 | Subgroups, cyclic groups, factor groups | 8 | 4/4/0 |
| 14 | Rings, polynomial rings, Galois fields, lattices, Boolean algebras | 8 | 4/4/0 |
| AY | A | B | C | D | E | F/E | F/F/E | TN |
|---|---|---|---|---|---|---|---|---|
| 2019/2020 | 7 | 3 | 1 | 1 | 2 | 2 | 0 | 16 |
| 2020/2021 | 4 | 3 | 4 | 4 | 1 | 2 | 1 | 19 |
| 2021/2022 | 4 | 8 | 10 | 5 | 3 | 0 | 0 | 30 |
| 2022/2023 | 1 | 2 | 1 | 4 | 3 | 2 | 0 | 13 |
| 2019/20–2022/23 | 16 (20.5%) | 16 (20.5%) | 16 (20.5%) | 14 (17.9%) | 9 (11.5%) | 6 (7.7%) | 1 (1.3%) | 78 |
| # | Type of exam task | NS | AS |
|---|---|---|---|
| 1 | Solving a matrix equation of type or or using an inverse matrix. | 23 | 6.35 |
| 2 | Determination the transition matrix from basis to basis, determination of the coordinates of the vector on a given basis. | 7 | 6.57 |
| 3 | Determination the orthogonal and orthonormal | ||
| bases of the subspace of Euclidean space products. / Geometric applications of scalar, vector and triple products. | 27 | 4.33 | |
| 4 | Determination eigenvalues and eigenvectors of a given matrix. / Calculation of the power of the | ||
| matrix using its diagonalization. | 27 | 4.56 | |
| 5 | Determination GCD and LCM of two integers, Euclidean algorithm, Bézout’s identity. / Solving a system of linear congruence | ||
| equations by an elimination method. | 24 | 6.75 | |
| 6 | Solving the linear congruence equation using Euler’s theorem. / Determination the remainder after dividing two natural numbers, determination | ||
| the latest digits of the natural number in the form of a power. | 14 | 6.00 | |
| 7 | Creating Cayley tables of two algebraic structures, verification of the properties of the group, determination its subgroups and the justification of whether | ||
| these groups are isomorphic or determination group generators. | 27 | 7.52 | |
| 8 | Determination GCD and Bézout’s identity for polynomials in . / Solving the linear polynomial equation | ||
| in the factor ring. | 16 | 2.31 |
| # | Topic | HS | LE/EX/CC |
|---|---|---|---|
| 1 | Propositonal logic, disjunctive and conjunctive normal form | 8 | 4/4/0 |
| 2 | Algebraic minimization of normal forms, the Karnaugh maps | 8 | 4/4/0 |
| 3 | Deductive system, deduction, correctness and completeness theorems | 4 | 2/2/0 |
| 4 | Predicate logic | 6 | 2/4/0 |
| 5 | Proofs in predicate logic, model theory | 4 | 2/2/0 |
| 6 | Finite-state machines, languages recognized by the finite-state machine | 8 | 4/4/0 |
| 7 | Real function of one real variable, elementary functions | 8 | 4/4/0 |
| 8 | Limit of a function, continuous functions | 4 | 2/2/0 |
| 9 | Derivative of a function, L’Hôspital’s rule | 8 | 4/4/2 |
| 10 | Applications of differential calculus, Taylor polynomials | 8 | 4/4/0 |
| 11 | Indefinite integral, integration of some special functions | 8 | 4/4/0 |
| 12 | Definite integral and its computation | 4 | 2/2/0 |
| 13 | Improper integral and its computattion | 4 | 2/0/2 |
| 14 | Sequences, infinite series | 4 | 2/2/0 |
| 15 | Power series, generating functions | 4 | 2/2/0 |
| AY | A | B | C | D | E | F/E | F/F/E | TN |
|---|---|---|---|---|---|---|---|---|
| 2020/2021 | 4 | 2 | 5 | 0 | 0 | 5 | 0 | 16 |
| 2021/2022 | 3 | 3 | 5 | 2 | 1 | 2 | 3 | 19 |
| 2022/2023 | 9 | 6 | 4 | 6 | 3 | 2 | 0 | 30 |
| 2023/2024 | 0 | 0 | 3 | 4 | 5 | 1 | 0 | 13 |
| 2020/21–2023/24 | 16 (20.5%) | 11 (14.1%) | 17 (21.8%) | 12 (15.4%) | 9 (11.5%) | 10 (12.8%) | 3 (3.9%) | 78 |
| # | Type of exam task | NS | AS |
|---|---|---|---|
| 1 | Verification of logical equivalence/logical consequence by using a truth table. / Reformulating sentences | ||
| into logical formulas and decisions whether a given logical formula is their logical consequence. | 15 | 9.67 | |
| 2 | Determination of minimal disjunctive forms of 3 or 4 propositional variables using algebraic minimization/Karnaugh map. | 15 | 7.40 |
| 3 | Formal notation of the predicate formula, its negation and verbal expression of negation. | 7 | 8.14 |
| 4 | Determination the state-transition table of the finite-state machine and words that it recognizes. | 8 | 9.88 |
| 5 | Determination the inverse function, its domain and range and drawing graphs of the function and inverse function. | 8 | 5.50 |
| 6 | Determination local minima and maxima, intervals of monotony and inflexion points of a given function. | 14 | 3.71 |
| 7 | Evaluation the definite integral by a suitable integration method. / Calculation the indefinite integral using partial fraction decomposition. / Geometric | ||
| applications of a definite integral. | 15 | 3.27 | |
| 8 | Decision on convergence of two given series using a suitable convergence criterion. | 8 | 4.00 |
| # | Topic | HS | LE/EX/CC |
|---|---|---|---|
| 1 | Basic terminology, basic types of graphs, simple graphs, degree sequence | 4 | 2/2/0 |
| 2 | Subgraphs, graph representation, operations on graphs | 4 | 2/2/0 |
| 3 | Walks, trails, paths, and cycles in graphs, connectivity in graphs | 4 | 2/0/0 |
| 4 | Trees, spanning trees, Cayley’s formula, Prüfer sequence, Laplacian matrix | 4 | 2/2/0 |
| 5 | Graph labeling, depth-first search, breadth-first search | 4 | 2/0/2 |
| 6 | Isomorphism of graphs and rooted trees, tree code | 4 | 2/2/0 |
| 7 | Vertex and edge connectivity, blocks of a graph, articulation points | 4 | 2/2/0 |
| 8 | Matchings and covers in bipartite graphs, perfect matching | 4 | 2/2/0 |
| 9 | Edge colorings, chromatic index, Vizing’s theorem | 4 | 2/2/0 |
| 10 | Vertex colorings, chromatic number, Brooks’ theorem | 4 | 2/0/2 |
| 11 | Planar graphs, Kuratowski’s theorem, Euler’s formula, dual graph | 4 | 2/2/0 |
| 12 | Eulerian and Hamiltonian graphs, Chinese postman problem | 4 | 2/2/0 |
| 13 | Digraphs, basic terminology, digraph connectivity, Eulerian digraphs | 4 | 2/2/0 |
| 14 | Flow networks, algorithm for finding a maximal flow | 4 | 2/2/0 |
| 15 | Critical Path Method, Project Evaluation and Review Technique | 4 | 2/0/2 |
| AY | A | B | C | D | E | F/E | F/F/E | TN |
|---|---|---|---|---|---|---|---|---|
| 2020/2021 | 8 | 2 | 3 | 1 | 2 | 0 | 0 | 16 |
| 2021/2022 | 12 | 5 | 1 | 1 | 0 | 0 | 0 | 19 |
| 2022/2023 | 18 | 7 | 5 | 0 | 0 | 0 | 0 | 30 |
| 2020/21–2022/23 | 38 (58.5%) | 14 (21.5%) | 9 (13.8%) | 2 (3.1%) | 2 (3.1%) | 0 (0.0%) | 0 (0.0%) | 65 |
| # | Type of exam task | NS | AS |
|---|---|---|---|
| 1 | Verification that the degree sequence is a graph sequence, drawing an example of such a graph, and determining the Eulerian trail | ||
| in this graph. | 30 | 9.67 | |
| 2 | Determination the distance matrix and the reachability matrix for the graph and directed graph. | 0 | — |
| 3 | Determination of the number of spanning trees of the graph using subdeterminants of the incidence matrix and | ||
| using Kirchhoff’s theorems. | 0 | — | |
| 4 | Determination all the cheapest maximum matchings in a bipartite graph with a given cost matrix using the Hungarian algorithm. | 30 | 9.13 |
| 5 | Solving the problem of the Chinese postman with a given weighted graph and determining the length of the shortest | ||
| walk covering all the edges. | 30 | 9.30 | |
| 6 | Finding isomorphic graphs, plane drawing of the graph, verifying the Euler’s formula, determining the chromatic number of the graph and | ||
| its minimum vertex coloring. | 30 | 9.20 | |
| 7 | Determination and drawing the maximum flow in the network using the Ford-Fulkerson algorithm. | 30 | 9.80 |
| 8 | Determination of the critical path, the crash duration and the total time reserves of individual project activities by the CPM method. | 30 | 9.60 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).