|
Lecturer(s)
|
-
Machalík Stanislav, Ing. Ph.D.
|
|
Course content
|
Introduction to the course. Algorithm and its notation. Program structure, local variable and constant declaration, basic operation with numbers, data input and output. Operators and expressions. Summary of statements. Block and if statement. Algorithms with branching. Switch statement. Algorithms with branching. Methods for mathematical operation. Iteration statements. Algorithms with iterations without arrays. Value data types. Enum type. Conversion among data types. Data type array. One dimensional array. Operations with strings. Generating random numbers. Algorithms with one dimensional arrays. Program debugging. Multidimensional array. Algorithms for work with matrix. Subroutines, static method declaration, parameters, method calling. Classes - signification, declaration, instantiation, using. Text files - classes for work with files, data reading and writing. Additional C# language options, form application programming.
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Methods of individual activities, Demonstration, Graphic and art activities, Řízená praxe
- Practical training
- 45 hours per semester
- Home preparation for classes
- 45 hours per semester
|
|
Learning outcomes
|
The subject is focused on deepening and practical mastering of the subject matter Algorithm Development and Programming. It is designated mainly for students without sufficient practical experience with algorithm development, with programming in C# language and with creating simple console as well as window applications in the Microsoft Visual Studio environment.
After finishing the course student manages to design and implement algorithms in Visual Studio IDE.
|
|
Prerequisites
|
Active approach to study
|
|
Assessment methods and criteria
|
Student performance assessment
Given assignment confirms that a student has attended lessons to the extent required and fulfilled qualified requirements. Conditions for credit are: active work at exercises, min. 75% presence, credit test..
|
|
Recommended literature
|
-
Greiner, Karel. Studijní materiály z přednášek a cvičení předmětu Algoritmizace a programování.
|