CSC2203 Database Systems
COURSE INFORMATION SHEET
PROGRAMME: Computer DEGREE: B.S
Science
COURSE: Database Systems SEMESTER: IV CREDITS:03
COURSECODE: CSC2203 COURSE TYPE: CORE
COURSE AREA/DOMAIN: CONTACTHOURS: 03 hours/Week.
Computer Science
CORRESPONDINGLAB LAB COURSENAME: Nil
COURSECODE(IFANY): Nil
Course Objectives
The main objective of this course is to understand user requirements/views analyze existing and future
data processing needs, develop an enterprise data model that reflects the organization's fundamental
business rules, develop and refine the conceptual data model, including all entities, relationships,
attributes, and business rules, integrate and merge database views into conceptual model, apply
normalization techniques, identify data integrity and security requirements.
Course Description
This course covers fundamentals of database architecture, database management systems, and database
systems, Principles and methodologies of database design, and techniques for database application &
development.
SYLLABUS:
Week Topics
1. Introduction to Databases: What is a Database/ DBMS? Characteristics of the Database
Approach. When to/not to use a Database? Actors on the Scene.
2. Overview of Database Languages and Architectures: - Data Models, Schema, and
Instances. Three Schema Architecture. - Data Independence. - DBMS Component Module.
- DBMS Architectures.
3. Conceptual Data Modeling Using Entities and Relationships: Entity Types, Entity Sets,
Attributes, and Keys. Relationship Types, Relationship Sets, and Multiplicity.
4. Weak Entity Types. ER Diagrams, Naming Conventions, and Design Issues.
Relationship Types of Degree Higher than two. Enhanced ERD, Case Samples.
5. Mapping a Conceptual Design into a Logical Design:, Relational Database Design
Using ER-to-Relational Mapping
6. Relational Model: Relational Model Concepts, Relational Model Constraints and
Relational Database Schemas, Update Operations, Transactions, and Dealing with
Constraints Violations.
7. Relational Algebra: Introduction., Select, Project, and Rename, Relational Algebra
Operations from Set Theory: Union, Intersection, and Minus, Cartesian Product Operation
8. Join and its types: Inner Join, Outer Join (Left, right and full), Aggregate Functions and
Grouping, Examples of Queries in Relational Algebra
9. SQL: Create Table, Data Types, Basic SQL Queries, Renaming ,Substring Pattern
Matching and Arithmetic Operators, Insert, Delete, and Update
10. IS Null, Like, Between, IN, Order By, Advanced SQL: Nested Queries, Join, Aggregate
Functions, Group By and Having Clauses
11. Database Design Theory (Normalization ): Informal Design Guidelines for Relation
Schemas, Functional Dependencies: Fully, partial dependencies, transitive dependency,
Normal Forms Based on Primary Keys
12. General Definitions of Second Normal Form, Third Normal Forms
Advantages and disadvantages of Normalization
13. Overview of Storage and Indexing, Types of indexing: Primary, secondary, clustered
indexing, disk and file organization
14. Overview of Transaction Management, Concurrency Control and Recovery, Backup, types
of backups: Full database backup
15. Differential backup, Transaction log backup, File or File group backup, And Review
TEXT/REFERENCE BOOKS:
Database Systems Models, Languages, Design, and Application Programming. 6th edition,
Ramez Elmasri & Shamkant Navathe
An Introduction to Database Systems, 8th Edition, C. J. Date
COURSE LEATNING OUTCOMES (CLOs):
CLO DESCRIPTION
CLO.1 Understand database concepts and applications, Understand data models,
schemas and instances, storage organizations concepts, database languages
and interfaces and the database system environment
CLO.2
Implement the relational database design and data modeling using entity
relationship (ER) model.
CLO.3 Implement SQL: Data definition, constraints, schema, queries and operations
in SQL.
CLO.4
Produce well-structured database using functional dependencies and
normalization, Build, design and tune databases.
MAPPING COURSE LEARNING OUTCOMES (CLOs)
ANDPROGRAM LEARNINGOUTCOMES (PLOs)
PROGRAM LEARNING OUTCOMES (PLOs)
a b c d e f g h i j k
CLO.1 X
CLO.2 X
CLO.3 X
CLO.4 X
CLO.5
CLO.6
PROGRAM LEATNING OUTCOMES (PLOs):
PLO DESCRIPTION
a The ability to utilize logic, mathematics, and physical sciences to model and solve
Computer Science problems.
b An ability to analyze a problem, and identify and define the computing requirements
appropriate to its solution
c The ability to think critically, perform scientific analysis and develop solutions for typical
Computer Science problems.
k An ability to apply design and development principles in the construction of software
applications and Database systems.
