Infopaket

Programming tools and technologies

ДВС.2.04

Вибіркова дисципліна для ОП

Second

2023/2024

3 Semester

5

LO18.2. To analyze, evaluate and select methods, modern hardware-software instrumental and computing tools, technologies, algorithmic and software solutions in the efficient solving the industrial software development problems. LO20.2. To reasonably choose the programming technologies to solve the problems of software development and maintaining.

Distance form

To know: general concepts of programming languages (syntax, program semantics, object-oriented programming style), basics of the theory of algorithms (recursive functions and recursive calculations), basic concepts of mathematical logic, in particular, concepts of resolvent, resolute inference. Be able to: use environments for development, editing and execution of programs. Possess elementary skills: programming or program specifications, in particular, which are based on recursive calculations.

The goal of the learning course is to acquire basic knowledge and master the skills of designing and developing software systems using various programming paradigms with appropriate data structures, control mechanisms and technologies. The learning course "Instrumental means and programming technologies" is a component of the educational and scientific program for the training of specialists at the "master's" educational level in the field of knowledge 12 "Information technologies" in the specialty 122 "Computer science", the program "Informatics". It is a specialization course "Theory and technology of programming". It is taught in the 3rd semester in the amount of 150 hours. (5 ECTS credits) in particular: seminar classes – 44 hours, independent work – 106 hours. The discipline ends with a credit in the 3rd semester.

1. М.S. Nikitchenko, S.S. Shkilnyak. Matematychna logika ta teoriya algorytmiv. – Кyiv, 2008. 2. Kryvyi S.L. Vstup do metodiv stvorennia programnykh produktiv: [Tutorial for students of specialties "Computer Science" and @Software engineering"] / – Kyiv: NaUKMA, 2018. – 449 p. 3. Schneider K.: Verification of Reactive Systems. Formal Methods and Algorithms. Springer-Verlag Berlin Heidelberg (2004). 4. Hoare C.A.R., Jifeng He. Unifying Theories of Programming. – London: Prentice Hall Europe, 1998. – 298 p. 5. Clarke E.M., Grumberg O., Peled D.: Model Checking. MIT Press (1999).

Seminar, individual work.

Англійською Semester assessment: 1. Control work (test) 1: LO 1.1., LO 1.2 – 35 points/35 points. 2. Control work (test) 2: LO 1.2, LO 1.2 - 35 points/35 points. 3. Preparation of the report: LO 2.1, LO 2.2, LO 3.1, LO 4.1 – 30 points/30 points. Final assessment in the form of credit (test). It is awarded based on the results of students' work throughout the semester and does not provide for additional assessment measures for successful students.

Ukrainian