Introducing students to principles and techniques of creating programme procedures. It is necessary to emphasize the use of adequate data structures.

Students should be trained to design programmes in a specific programme language. Ability to select and implement appropriate data structure.

An overview of programme languages. Programming language syntax.: BNF, EBNF and sytax diagrams. Basic and derived data types. Operations. Sequences. Selections. Cycles. Jumps. Modules. Files. Algorithms and algorithm structures. Turing machine. Markov normal algorithms. Recursive functions. Algorithm analysis and structural programming. Data structures. Abstract data types. Program testing. User interface. Program documentation.

Lectures. Computer exercises. Consultations. Out of a total of 100 points, a section of 70 points is achieved during the course, and 30 on the theoretical part of the exam. 1. Predictive Obligation - Test - 10.00; 2. Prerequisite - Test - 10.00; 3. Predictive Obligation - Test - 10.00; 4. Prerequisites - Test - 10.00; 5. Prerequisite - Complex Practices - 30.00. Which makes a total of 70 points; 6. Final exam - Theoretical part of the exam - 30.00. To pass the exam the student must collect at least 55 points.