- describe basic concepts of imperative programming with Java

- recognise imperative programming terminology and use the appropriate terms accurately in discussions

- recognise basic terminology of object-oriented programming

- describe what programs presented to them do

- independently develop programs to solve small problems

- systematically examine their own and other people's programmes for errors

- use modern programme development environments to develop and test programmes

- create algorithms with general design concepts (e.g. Greedy method, divide-and-conquer method)

- name algorithms and data structures for solving common problems and evaluate their applicability

- name problems of efficiency of algorithmic solutions of concrete problems and evaluate them

- make a well-founded choice of an algorithm and a data structure for solving a concrete problem

- solve given problems from the point of view of imperative or object-oriented programming

- communicate the structure and mode of operation of self-developed programmes to others

- organise themselves in finding algorithmic solutions to small and medium-sized problems in computer science

In the first part, general basic concepts of programming are introduced:

- Algorithm, programming languages, computer

- development tools, development phases

- compilers

- grammars

- logic

The second part deals with basic programming concepts:

- data types

- variables

- Expressions, statements

- control structures

- Methods, parameters

- recursion

- Reference data types, arrays

- Classes, objects

- Documentation

- Testing

The third part contains an introduction to data structures and algorithms as well as a discussion of their efficiency, i.e. the computational effort or memory requirements depending on the amount of data to be processed. The module introduces known, efficient algorithms and data structures for various, frequently occurring problems. These include in particular: