Theory of Table Algebras

Course: Informatics

Structural unit: Faculty of Computer Science and Cybernetics

Title
Theory of Table Algebras
Code
ДВС.2.03
Module type
Вибіркова дисципліна для ОП
Educational cycle
Second
Year of study when the component is delivered
2022/2023
Semester/trimester when the component is delivered
4 Semester
Number of ECTS credits allocated
4
Learning outcomes
PLO 21.2. Know and be able to apply program-oriented logical formalisms.
Form of study
Distance form
Prerequisites and co-requisites
Know: basic concepts of relational databases, formal methods of software systems development Be able to: apply formal methods of software systems development, formalize the development and research of relational databases. Have elementary skills: database development.
Course content
The goal of the discipline is to master basic knowledge of operations that expand the capabilities of tabular (relational) algebra: aggregation, grouping, sorting, semi-joins, outer joins. The learning course "Theory of Table Algebras" 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 4rd semester in the amount of 120 hours (4 ECTS credits) in particular: lectures – 28 hours, consultations - 2 hours, independent work – 90 hours. The course consists of 2 parts and 2 tests. The course ends with an exam in the 4th semester.
Recommended or required reading and other learning resources/tools
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan. Database System Concepts. – McGraw-Hill, 2020. – 1373 p. (https://db-book.com/) 2. C.J. Date. An Introduction to Database Systems. – Addison Wesley, 2003. – 1024 p. 3. S. C. Kleene. Introduction to metamathematics. – New York.: D.Van Nostrand Company, 1952. – 527 p. 4. V.N.Redko, Yu.I.Brona, D.B.Bui, S.A.Poliakov, Reliatsiini bazy danykh: tablychni alhebry ta SQL-podibni movy. – Kyiv: Vydavnytschyi dim «Akademperiodyka, 2001. – 198 s. 5. Bui D. B. Kompozytsiina semantyka rekursyvnykh zapytiv v SQL-podibnykh movakh / D. B. Bui, S. A. Poliakov // Visnyk Kyivskoho universytetu. Ser.: fiz.-mat. nauky. – 2010. – Vyp. 1. – S. 45–56. 6. Bui D. B. Vlastyvosti vidnoshennia konfinalnosti ta ustrii mnozhyny chastkovykh funktsii / D. B. Bui, N. D. Kakhuta // Visnyk Kyivskoho universytetu. Ser.: fiz.-mat. nauky. – 2006. – Vyp. 2. – S. 125–135.
Planned learning activities and teaching methods
Lecture, independent work.
Assessment methods and criteria
Semester assessment: 1. Test 1: PH 1.1., PH 1.2, PH 2.1 — 20 points/12 points. 2. Test 2: PH1.2, PH1.3, PH 2.2 - 20 points/12 points. 3. Preparation of a report (on the topics of lectures and independent work): PH 2.1, PH 2.2, PH 3.1, PH 4.1 — 20 points/12 points. The final assessment (in the form of an exam) indicates: - the maximum number of points that can be obtained by a student: 40 points; - learning outcomes that will be assessed: PH1.1, PH1.2, PH1.3, PH 2.1, PH 2.2; - form of conduct and types of tasks: written. Types of tasks: 8 theoretical questions with a maximum of 5 points for each. Criteria for evaluating the student's answer to a theoretical question: · completeness of the disclosure of the question 1-2 points; · logic of the presentation 1 point.
Language of instruction
Ukrainian

Lecturers

This discipline is taught by the following teachers

Olena V. Shyshatska
Theory and Technology of Programming
Faculty of Computer Science and Cybernetics

Departments

The following departments are involved in teaching the above discipline

Theory and Technology of Programming
Faculty of Computer Science and Cybernetics