|
|
Tool for programming in a physical environment
Křen, Tomáš ; Hnětynka, Petr (advisor) ; Ježek, Pavel (referee)
The subject of this work is to implement the game conceived as an interactive physical environment in which a user creates a virtual world in hierarchical two-dimensional space by inserting, moving and connecting objects. However, the world, or his parts, also represents the syntax of a program. This is achieved mainly because the game includes different kinds of objects called functions, which occupy the same role, as a function in classic programming languages. The program also includes active agents controlled by an internal program, which is made up of these functions.
|
|
|
Design and implementation of a language for code-golf challenge
Kliber, Filip ; Parízek, Pavel (advisor) ; Kratochvíl, Miroslav (referee)
Code-golf is one of types of programming competitions. Primary objective of such competition is to provide a solution to relatively simple programming task, such that the length of the source code is minimal in terms of bytes. The goal of my thesis is to design and implement a programming language that is suited for code-golf challenges. The language is designed with respect to beginners in the code-golf domain. It preserves readability and intelligibility, and it is based on popular programming languages, but still provides facilities for concise writing of algorithmical solutions for code-golf tasks. The work also contains implementation of a standard library as support for runtime environment of the language. 1
|
|
|
Programming tools for development of algorithms and programs at elementary school
Dümont, Jan ; Novák, Jaroslav (advisor) ; Vaňková, Petra (referee)
The bachelor thesis is centred on an educational area algorithm development and programming at basic schools. The main aim is an overview and a description of teaching methods and programmes which promote the development of student's computional thinking. The thesis contains an analysis of researches which describes the situation of teaching algorithm development and programming at basic schools in 2006-2007 and in 2013. The analysis was realized by Department of Information Technology and Education at Faculty of Education at Charles University. Next part is a definition of basic concepts relating to this topic and at the end there are two examples of worksheets prepared for concrete methods.
|
|
|
Implementation of a Language Interpreter for Mathematical Calculations
Kobelka, Martin ; Šátek, Václav (referee) ; Veigend, Petr (advisor)
The main goal of this bachelor thesis is to design and implement the new programing language, which can be used for mathematical computations, implement the demonstration interpret of this language and design a graphical user interface for it. The user interface makes it easy to write the calculation, enables effective and clear visualization of calculation results and basic debugging of calculation. The properties of the resulting language are described in the thesis with the several experiments with the interpret, which implements a~subset of the language. Differences between designed solution and other platforms are also described in the thesis.
|
|
|
Programming tools for development of algorithms and programs at elementary school
Dümont, Jan ; Novák, Jaroslav (advisor) ; Vaňková, Petra (referee)
This thesis monitors the past and current status of the educational area of algorithms and computer programming in elementary school, on the basis of research carried out at the Department of Information Technology and Technical Education of the Pedagogical Faculty of Charles University in Prague. It provides an overview of the different teaching methods and programs that contribute to the development of the skills of pupils, due to their age and skills achieved in this area. In the theoretical part of the thesis are explained the basic concepts of the topic of algorithms and programming, which follows the practical part with the use of these procedures in the ICT lessons and in other school subjects.
|
|
| |
|
|
The database solution for storing measurement data
Holeček, Ivan ; Andrš, Ondřej (referee) ; Kovář, Jiří (advisor)
Diploma thesis is focused on elaboration of database solution for saving measured data. In theory part analyses database query language and database management system Microsoft SQL Server 2017. Further in theory part is focused on programming environment for application development using C# .NET. Thesis includes database solution for saving measured data, service console application for saving data into the database and user application for creating new measuring, representation of data and user administration.
|
|
| |
|
| |
|
|
Advanced programming constructs and techniques in the Swift language
Čislinský, Jan ; Pecinovský, Rudolf (advisor) ; Oraný, Vladimír (referee)
The thesis focuses on advanced programming constructs and techniques of the Swift programming language. At the beginning programming paradigms that are supported by the Swift design (object-oriented and functional) are introduced. Concepts of each paradigm are described and Swift is then evaluated by the level of support for these paradigms. Following programming constructs are described in-depth: working with variables, optional types, enumerated types, functions and closures. Creating of custom operators and subscripts. Operations with protocols, generic types and parallel program execution. Error handling with throwing functions. Detailed explanation of value types and their differences from reference type is given too. Thesis also explains nested types and all higher-order functions in Swift. At the end are described extensions; specifically extension of computed property, initialization function, function, subscript, nested type and protocol and generic types extensions. In the last section of the thesis these advanced programming techniques are described; function chaining and composition, structure saving, performance optimization of value types, reflection in the Swift programming language and how modules and namespaces work. At the end protocol-oriented programming is introduced.
|
guest ::
