Course: Algorithm Development and Programming

« Back
Course title Algorithm Development and Programming
Course code KID/XAAAP
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study 1
Semester Summer
Number of ECTS credits 4
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Hořeňovská Veronika, Ing.
  • Stehno Jan, Ing.
  • Škopová Eva, Ing.
  • Drvota Zdeněk, Ing.
  • Machalík Stanislav, Ing. Ph.D.
  • Greiner Karel, doc. Ing. Ph.D.
  • Baran Filip, Ing.
Course content
Introduction to the course. Algorithm and its notation. Flowchart symbols. Applications for drawing flowcharts. Program structure. Basic data types, variable declaration, basic operations with numbers, data inputs and outputs. Use of artificial intelligence tools in programming. Operators and expressions, logical data type, if statement and block. Algorithms with branching. Methods for mathematical operations. Algorithms with branching. While and do loop statements. Algorithms with loops without using arrays. For loop statement, jump statements. Algorithms with loops without using arrays. Array data type. One-dimensional array. Conversion between data types. Algorithms on one-dimensional array. Char and string data types. Operations with character strings. Program debugging. Algorithms on one-dimensional array. Multidimensional array. Algorithms for working with matrices. Algorithms for working with matrices. Methods - static method declaration, parameters, call, return statement. Algorithms using subroutines. Debugging a program with subroutines. Sorting and searching algorithms.

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Demonstration, Skills training
  • Participation in classes - 65 hours per semester
  • Preparation for a partial test - 18 hours per semester
  • Home preparation for classes - 13 hours per semester
  • Preparation for a final test - 24 hours per semester
Learning outcomes
Algorithmization simple tasks and basic programming in programming language C# in Microsoft Visual Studio development environment.
After finishing the course students will be able to design and realize algorithms of basic problems in programming language C#.
Prerequisites
The prerequisite of this course is knowledge of basic works with OS Windows.

Assessment methods and criteria
Written examination

For the course and conditions for granting credit, see the document available from the information system STAG.
Recommended literature
  • Bory, Pavel. C# bez předchozích znalostí. Brno: Computer Press, 2016. ISBN 978-80-251-4686-6.
  • Greiner, Karel. Algoritmizace a programování - přednášky.
  • Pšenčíková, Jana. Algoritmizace. Kralice na Hané: Computer Media, 2009. ISBN 978-80-7402-034-6.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester