Course INFO 201 · Year II · Autumn 2019-2020

DATABASES

Compulsory course in Computer Science (in English), taught by Emil Olteanu.

This course page is from 2019-2020 and is archived.
See this course for the current academic year

Overview

Lecturer
Emil Olteanu
Seminar tutor
Maria Viorela Muntean
Type of course
Compulsory
Language of instruction
English
Erasmus language
English
Domain
Computer Science
Field of study
Computer Science (in English)
Form of education
Full-time
Form of instruction
Class
Credit awarded by
Grade
Teaching methods
Lecture, Power Point presentations, conversation, exemplification.
Entry requirements
Introduction to Databases.

Aims

• Database design;

• Database normalization;

• Implementing databases, tables, primary and foreign keys and foreign key relationships;

• Modifying structure of tables;

• Adding, modifying and deleting table data;

Course contents

1. Database Architecture 2. Data models 3. Relational database 4. Relational algebra 5. Relational keys 6. Database normalization • The First Normal Boyce-Codd Form (1NF). Steps and examples. • The Second Normal Boyce-Codd Form (2NF). Steps and examples. • The Third Normal Boyce-Codd Form (3NF). Steps and examples. 7. SQL Select 8. Relational database schemes 9. Conceptual design of databases • Logical database design

Learning outcomes

• Organizing data in databases. • Querying databases. • Development of various database related projects.

Assessment

Written paper – interpretative essay – 50%; continuous assessment Laboratory activities portfolio – 50%.

Recommended reading

• Colin Titchie, Relational Database Principle, 2nd edition, UK by TJ International, Padslow, Cornwall, 2004.
-
-, -, - · -
• Terry Halpin, Tony Morgan, Information Modeling and Relational Databases, second edition, Morgan Kaufmann Publishers is an imprint of Elsevier. 30 Corporate Drive, Suite 400, Burlington, MA 01803, USA.
-
-, -, - · -
• Mark Levene and George Loizou, A Guided Tour of Relational Databases and Beyond, Springer-Verlag Berlin Heidelberg.
-
-, -, - · -