Lecturer(s)


Zahrádka Jaromír, RNDr. Ph.D.

Course content

Numeration systems, numeration in the floating point, standard IEEE. Congruence and its aplications. Mathematical logic, disjunctive and conjunctive forms. Boolean algebra. Combinatorics, the binomial and multinomial theorem. Sets, principle of inclusionexclusion. Undirected and directed graphs. Paths and circuits in the graph. Metric of graph, searching for the shortest or optimum way. Trees, spanning tree, cryptography, Kruskal's algorithm. Graphs coloring. Numerical methods for solving linear and nonlinear equations and systems. Numerical methods for calculating derivations, partial derivations and particular integrals. Numerical solving of differential equations.

Learning activities and teaching methods

Monologic (reading, lecture, briefing), Methods of individual activities, Projection, Skills training
 unspecified
 39 hours per semester

Learning outcomes

To follow up with the previous mathematical and mathematiceconomical courses and acquaint the students with the topics of mathematical sets and logic, graphs theory and numerical methods with the view to economics and informatics.
Students will be able to solve basic as well as followup applied problems in the area of mathematical sets, logic, theory of graphs and numerical methods by the use of EXCEL programming environment.

Prerequisites

Basic mathematical knowns and skills of the mathematics of the middle schools, subjests of mathematics of the bachelor study and EXCEL programing language.

Assessment methods and criteria

Home assignment evaluation, Student performance assessment, Workrelated product analysis
Assignment  two successful written exams and six semestr projects.

Recommended literature


Feil, Todd. Essential discrete mathematics for computer science. Upper Saddle River: Pearson Education, 2003. ISBN 0130186619.

Goodaire, Edgar G. Discrete mathematics with graph theory. Upper Saddle River: Prentice Hall, 2002. ISBN 0130920002.

Leader, J. J. Numericel Analysis and Scientific Computation. Boston, 2004. ISBN 032122337.
