|
|
A BDD Library
Troška, Karol ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible representation of BDD in a computer. The propose is focused mainly on a reduction speed of number of memory allocation and on a simplicity and an intuitive system of using a library. There are several examples of a library usage and warnings which programmer should avoid of in the thesis. Proposed representation was implemented in C language.
|
|
|
Minimisation of Logical Functions
Horký, Miroslav ; Davidová, Olga (referee) ; Šeda, Miloš (advisor)
For minimisation of logical functions, laws of the Boolean algebra and the Karnaugh maps are mostly used. However, use of Karnaugh's maps is based on visual recognition of adjacent cells for functions with no more than 6 variables and, therefore, the method is not suitable for automated processing on computers. A direct application of the Boolean algebra laws is not restricted in this way, but there is no general algorithm defining the sequence of their application and thus this approach is not suitable for computer implementation either. The well-known method usable on computers is the algorithm proposed by E. J. McCluskey and W. Orman Quine.
|
|
|
Aplikace matematických znalostí při výuce biologie
STUDENÁ, Lucie
The Theses deals with applications of mathematical knowledge in teaching biology and it is divided into four chapters. Each chapter is dedicated to another application: 1. Application of conditional probability in medical diagnostics, 2. Application of exponential function in population ecology, 3. Application of logic functions in mathematical modelation of neuron and 4. Aplication of binomial theorem and binomial distribution in genetics. Each application contains solved problems, a worksheet for students and a solution for each worksheet. Two application (1. and 2.) have been tested in teaching and as an assessment of my lessons students filled questionnaires. Results of these questionnaires are processed in the end of these chapters. This Thesis can be used in teaching or self-studying.
|
|
|
A BDD Library
Troška, Karol ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible representation of BDD in a computer. The propose is focused mainly on a reduction speed of number of memory allocation and on a simplicity and an intuitive system of using a library. There are several examples of a library usage and warnings which programmer should avoid of in the thesis. Proposed representation was implemented in C language.
|
|
|
Minimisation of Logical Functions
Horký, Miroslav ; Davidová, Olga (referee) ; Šeda, Miloš (advisor)
For minimisation of logical functions, laws of the Boolean algebra and the Karnaugh maps are mostly used. However, use of Karnaugh's maps is based on visual recognition of adjacent cells for functions with no more than 6 variables and, therefore, the method is not suitable for automated processing on computers. A direct application of the Boolean algebra laws is not restricted in this way, but there is no general algorithm defining the sequence of their application and thus this approach is not suitable for computer implementation either. The well-known method usable on computers is the algorithm proposed by E. J. McCluskey and W. Orman Quine.
|
guest ::
