Introducing students to principles and techniques of creating programme procedures with a special emphasis on data structures.

Students should be trained to design programmes in a specific programme language.

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 practice. Consultations. 70 out of 100 points are awarded during the lectures, and 30 points in theoretical part of the examination. Pre-exam assignment include two small projects (15 points each) and four tests (10 points each) which amounts to 70 points. In order to pass the examination, student must collect at least 55 points. Students who don’t collect 25 points during the lectures (theoretical minimum) have to take written examination.