SylabUZ
| Course name | Database Systems 1 |
| Course ID | 11.3-WK-MATP-SBD1-Ć-S14_pNadGenONGCT |
| Faculty | Faculty of Mathematics, Computer Science and Econometrics |
| Field of study | Mathematics |
| Education profile | academic |
| Level of studies | First-cycle studies leading to Bachelor's degree |
| Beginning semester | winter term 2019/2020 |
| Semester | 4 |
| ECTS credits to win | 6 |
| Course type | optional |
| Teaching language | polish |
| Author of syllabus |
|
| The class form | Hours per semester (full-time) | Hours per week (full-time) | Hours per semester (part-time) | Hours per week (part-time) | Form of assignment |
| Class | 15 | 1 | - | - | Credit with grade |
| Laboratory | 30 | 2 | - | - | Credit with grade |
| Lecture | 30 | 2 | - | - | Exam |
The course introduces basic notions, definitions and problems related to the relational models of databases. At the end of the course each student should be able to design and create both database and database application.
Fundamentals of logic. Programming skills.
Lecture:
1. The basic notions and definitions related to the relational databases.
2. Operations on relation (union, difference, intersection, complement, projection, selection, join, division).
3. The functional dependencies and Armstrong’s axioms.
4. Relational schemes.
5. Decompositions.
6. Normalization through decomposition (1NF, 2NF, 3NF,B-CNF, 4NF, 5NF).
7. Multivalued dependencies.
8. Inference axiom for multivalued dependencies.
Class:
1. Operations on relation
2. Normalization through decomposition (2NF, 3NF,B-CNF).
3. Structured Query Language.
a. Data Manipulation Language,
b. Data Definition Language,
c. Data Control Language.
4. Creating the project of a database.
a. Data-Flow Diagram,
b. Entity-Relationship Diagrams,
c. Creating Database Scheme.
Laboratory:
1. The use of SQL.
2. Data types, expressions and operators, conditions, functions, procedures.
3. SELECT statement:
a. inner join,
b. outer join,
c. simple subqueries,
d. correlated subqueries,
e. grouping and aggregate functions.
4. Defining the database structure:
a. domain,
b. tables,
c. views,
d. indexes,
e. sequences/generators,
f. triggers,
g. referential integrity constraints.
5. Database user management and control of transactions.
Lecture: Seminar lecture.
Class: Method problematic, brainstorming.
Laboratory: Computer laboratory exercises.
| Outcome description | Outcome symbols | Methods of verification | The class form |
Lecture: The exam consists of two parts, written and oral, access to the oral part is getting 30% of the points of the written part, 50% of the points from the written part guarantees a positive evaluation.
Class: condition pass is 50% of the points of the four planned tests or final test covering all the material processed.
Laboratory: condition pass is 50% of the points of the four planned tests or final test covering all the material processed.
Final evaluation of the course is the arithmetic mean of the lecture, class and laboratory. However, a prerequisite for a positive final assessment is to obtain positive evaluations of the lecture, class and laboratory.
1. T. Pankowski, Podstawy baz danych, Wydawnictwo Naukowe PWN, W-wa, 1992.
2. D. Maier, The theory of relational databases, Computer Science Press, 1983.
3. M. Gruber, SQL, Helion, 1996.
4. M. Wybrańczyk, Delphi 7 i bazy danych, Helion, 2003.
5. G.Reese, Java. Aplikacje bazodanowe. Najlepsze rozwiązania, Helion, 2003.
1. W. Kim, Wprowadzenie do obiektowych baz danych, WNT, Warszawa, 1996.
2. J.D. Ullman, Podstawowy wykład z systemów baz danych, WNT, Warszawa, 1999.
3. P. Neil Gawroński, InterBase dla ,,delfinów'', Helion, 2001.
4. Jakubowski: SQL w InterBase dla Windows i Linuksa, Helion, Gliwice 2001.
5. R. Barker, CASE* Method. Modelowanie związków encji, WNT, Warszawa 2005
6. M. Marzec, JBuilder i bazy danych, Helion, 2005.
7. Mościcki, I. Kruk, Oracle 10g i Delphi. Programowanie baz danych, Helion, 2006.
Modified by dr Robert Dylewski, prof. UZ (last modification: 20-09-2019 09:54)
