Students are able to:
- propose algorithms of simple tasks,
- use basic elements of the program (variables, mathematical operations, conditions, loops, etc.),
- use an iterative and recursive procedures,
- designed algorithms written in the programming language Python,
- work with the basic data structures,
- create a search function and basic methods of sorting by known algorithms,
- create own toolboxes of functions,
- to describe and explain custom programs. 

Students must obtain at least 50 points out of total 100 points in the sub-activities:
1. midterm test (min. 15 points, max. 30 points),
2. final test (min. 25 points, max. 50 points),
3. home works (10 x 2 points, max. 20 points).
Individual activities to check students' ability to design algorithms for solving simple problems and demonstrate the implementation of the relevant programs. 

1. Programming, algorithm, introduction to Python
2. Review of basic data types and their use, strings
3. Basic elements of the program, conditions, lists and their use
4. Basic elements of the program, for loops and examples I.
5. Basic elements of the program, while loops and examples II.
6. Function and modules
7. Git basics
8. File handling in Python
9. Review of basic data structures and their use
10. Performance analysis of algorithms, time complexity
11.Search algorithms
12. Sorting algorithms
13. Recursion, divide and conquer 

The aim of the course is to introduce basic programming habits. Further to introduce Python programming language and basics of algorithmic problem solving. 

• Programme SPC-STC Bachelor's 1 year of study, summer semester, compulsory