Theoretical foundation and development methods of informational systems
Course: Software engineering
Structural unit: Faculty of Computer Science and Cybernetics
Title
Theoretical foundation and development methods of informational systems
Code
ОК.11
Module type
Обов’язкова дисципліна для ОП
Educational cycle
Second
Year of study when the component is delivered
2023/2024
Semester/trimester when the component is delivered
2 Semester
Number of ECTS credits allocated
8
Learning outcomes
PLO3. Know basic concepts and methodologies modeling of informational processes.
PLO8. To do analytical investigations of parameters of software systems for their validation and verification and perform the analysis taken methods and possibly mechanisms automatization of development software.
PLO15. Extract new scientific and professional knowledges, prognosed development and improvement understanding.
Form of study
Full-time form
Prerequisites and co-requisites
1. Know: basic concepts of discrete mathematics, mathematical logics and theory of algorithms, main principles of program development and programming.
2. Be able to: design, develop and test programs at a basic level.
3. Have basic skills: programming in C, C ++, Java, Pyton.
Course content
The purpose of the discipline is the acquisition of knowledge, skills and abilities (competencies) in accordance with the qualification of information specialist technologies. In particular, to develop: the ability to abstract thinking, analysis and synthesis (ZK01); ability to conduct theoretical and applied research at the appropriate level; ability to develop and implement new competitive ideas in software engineering; ability to analyze subject areas, form, analyze and model software requirements; ability to design software, including modeling of its architecture, behavior and operation of individual systems and modules.
Recommended or required reading and other learning resources/tools
1. Glushkov V.М., Zejtlin G.E., Juschenko E.L. Algebra, languages, porgramming. К.: Naukowa dumka. - 1989. – 376 p.
2. Kryvyi S.L. Finite automata: theory, algirithms, complexity. – Cherniovzy-Kyiv; Bukrek. - 2020. – 427 p.
3. Thomas W. Automata on Infinite Objects. – Handbook of Theoretical and Computer Science. Ed by
van Leeuven. - Elsevier Science Pablisherrs B.V. -1990. – 135- 194 p.
4. Clarke E., Grumberg O., Peled D. Верификация моделей програм: Model checking. – The MIT
Press. – Cambridge, Massachusetts, London, England. -2001.- 376 p.
5. J.A. Anderson Automata theory with Modern Applicatiopns Cambridge University Press.- 2006. –
255 p.
6. Karpov Ju. G. Model Checking: Verification of parallel ang distributed systems. Sankt-Petersburg: BXV. -2010. - 551 p.
Planned learning activities and teaching methods
Lectures, laboratory classes, independent work, tests, homework, defense of laboratory work, exam.
Assessment methods and criteria
- Semester assessment:
1. Test 1: LO 1.1, LO1.2 - 10 points / 6 points.
2. Test 2: LO1.3 - 10 points / 6 points.
3. Homework 1-7: LO1.1, LO1.2, LO1.3-10 points / 6 points.
4. Protection of laboratory work 1 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 11 points / 6 points.
5. Protection of laboratory work 2 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 8 points / 5 points.
6. Protection of laboratory work 3 (project): LO2.1, LO3.1, LO4.1, LO4.2 - 11 points / 6 points.
In one of the forms of control, the student has the right to replace it with a certificate with the possibility of obtaining 9 points. To exercise this right, the student must, by 1st of January of the current year, write and attach to the classroom a statement with his personal signature.
Final assessment (in the form of an exam):
- maximum number of points: 40 points;
- learning outcomes which shall be assessed: LO1.1, LO1.2, LO1.3, LO2.1.
Language of instruction
Ukrainian
Lecturers
This discipline is taught by the following teachers
Departments
The following departments are involved in teaching the above discipline