|
|
Program walkthough simulation through flowchart for teaching algorithms
BARTYZAL, Miroslav
The work is concerned with development of application for fast and efficient way of assembling algorithms using flowcharts and their subsequent walkthrough visualization for purpose of teaching algorithms. First part of the work consists of basic terminology description, which describes in particular the different flowchart symbols. Other parts of the work are devoted to the analysis of the treated subject, application design and interesting sections of development. The last part of the thesis summarizes the verification of the application in practice and the results of this work.
|
|
|
Current situation in teaching of algorithmization in secondary school
BROMOVÁ, Jana
The aim of this thesis is mapping of current state of teaching of algorithmization in secondary school. Basic information about the subject is given in theoretical part - a relation between teaching of algorithmization and RVP ZV, and basic assupmtions of teaching of algorithmization: a historical aspect, methods, aims and possibilities of teaching of algorithmization (and an approach on teaching). The essential part of teaching of algorithmization is an education support - a textbook about algorithmization and programming, programming support, projects and competitions for students. Practical part is a pedagogical research. This research consists of five themes A. A quantitative research of teaching of algorithmization in secondary school in České Budějovice. B. A review of extra curricural teaching of algorithmization in ČB. C. A statewide mapping of teaching of algorithmization in Czech Republic. D. A statewide research on a success rate of the competition ?Bobřík informatiky? (informatics beaver). E. A teacher's experience with a textbook.
|
|
| |
|
|
Online Password Manager
Ort, Štěpán ; Buchalcevová, Alena (advisor) ; Mészáros, Jan (referee)
The objective of this thesis is to show on which principles a modern password manager works. The introductory theoretical part describes cryptographic algorithms and evaluates whether they are suitable for use in current applications. At the same time it presents methods how to create a password which is strong and also easily remembered. The second part explains the key characteristics of a password manager. The last chapter illustrates the architecture of online password storage and the way of communicating with the password manager. Measures that have to be taken in order to make such storage secure are also described here.
|
|
|
Support of management decision-making on transport networks
Přibyl, Vladimír ; Černý, Jan (advisor) ; Kavička, Antonín (referee) ; Peško, Štefan (referee)
The presented thesis is focused on a set of problems related to managerial decision-making concerning networks (particularly transportation networks), respectively - if we put it more precisely - the thesis focuses on the support of this decision-making by means of quantitative methods. A set of problems related to nets and decision-making concerning their individual parts or elements represents a very complex sphere which has been a subject of research for a number of decades. Out of this sphere, the thesis formulates and elaborates in great detail two problems, which - from the point of view of their practical significance - are important for the decision-making of managers of carriers, or the public sphere, and which have not been published in this form yet. The main point is the problem of how to find a subnet with a limited prolongation of routes between important pairs of vertices. Another problem is a design of a bus route in an area with a low demand. For each of these problems, the thesis offers an exact combinatorial solution method, furthermore a method based on integer linear programming, and - last but not least - also, of course, heuristic methods of solution. All these methods have been tested on a set of networks, which has been created for this purpose in a pseudo-random way in the frame of this thesis. The testing has been focused primarily on the comparison of the results provided by heuristic methods, which are of great importance - with regard to a great computational difficulty of exact methods - for feasible tasks on a larger scale. The tests have proved that the proposed heuristic methods are practically applicable and show results whicheven represent the optimal solution in a number of cases, or are only slightly distant from the optimal solution.
|
|
|
The implementation of multicriteria evaluation methods into the IZAR software application
Vilánková, Veronika ; Kalčevová, Jana (advisor) ; Kuncová, Martina (referee)
This thesis describes the implementation methods for multi-criteria evaluation into the software application. IZAR is a software product that solves decision problems. IZAR solves single and multi-criteria, continuous and discrete decision problems. This thesis describes the extension of application IZAR. Several methods of multi-criteria evaluation were added into application. Supplemented methods were chosen so that the extended applications use the most basic methods from the decision theory. Introductory part of the thesis describes the basic methods that have been implemented into IZAR. There is summarized the theoretical basis of each method. The central part deals with the description of each method in terms of implementation. Attention is paid to the parts of the algorithms that have been modified or extended so that the methods are universal. Finally, the thesis shows the test examples in which functionality of methods was verified. There is described a group of complicated decision problems and control conditions that were created for these problems to find the right results.
|
|
|
Design and application of heuristics in distribution of ordered products to the consumers of NIKOL NÁPOJE a. s. company
Solnická, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of products to consumers based on a real case study of a particular company from Opava. For this purpose, a mathematical optimization model is used to illustrate the vehicle routing problem. The study will also offer an explanation on the relevancy of heuristic methods, mainly with respect to their application in solving real life situations analogous to the one surveyed. On the basis of chosen heuristic methods (i.e. the nearest neighbour algorithm and the savings algorithm) and having taken into account the restricting conditions of the company, four algorithms were designed. These four algorithms are programmed in Visual Basic for Applications MS Excel 2007. They are aimed at solving the real problems with the distribution of ordered products that the particular company must deal with. The thesis compares the results provided by an employee of this company, and the results presented by the designed algorithms.
|
|
| |
|
| |
|
| |
guest ::
