SRM University – AP, Andhra Pradesh

Neerukonda, Mangalagiri Mandal

Guntur District, Mangalagiri, Andhra Pradesh 522240

Database Management Systems

Course Core Course
Course Code CSE 209 L-T-P-C 3 0 1 4
Category (C)
Pre-Requisite Co-Requisite Progressive
Data Structures
Course(s) Course(s) Course(s)
Course Professional /
Offering CSE Licensing
Department Standards

Course Objectives / Course Learning Rationales (CLRs)

Objective 1: Understand the advantages of DBMS over traditional file system and characteristics of DBMS.
Objective 2: Design ER-models to represent data of the organization.
Objective 3: Design relational database and execute various queries on the database using SQL.
Objective 4: Gain knowledge various anomalies that can occur in database and overcome those with the
help of normal forms.
Objective 5: comprehend the purpose of transaction processing and concurrency control protocols.
Objective 6: Learn indexing schemes used in DBMS for the fast retrieval of data from the database.
Course Outcomes / Course Learning Outcomes (CLOs)
At the end of the course the learner will be able Expected
to Proficienc Expected
Bloom’s
y Attainment
Level
Percentag Percentage
e
Outcome 1 Identify and design database structure for a system. 4 70% 65%
Outcome 2 Design relational database and execute queries on
3 70% 65%
the database using SQL.
Outcome 3 Implement concurrency control protocols for
3 70% 65%
transaction processing system.
Outcome 4 Use indexing schemes for fast retrieval of data from
3 70% 65%
the database.
Course Articulation Matrix (CLO) to Program Learning Outcomes (PLO)
Program Learning Outcomes (PLO)
Sel PS PS PS
So En Ind f- O 1 O 2 O
An Mo Pro
De ciet vir Mo ivi Dir 3
En aly der Co ject
sig y on ral, dua ect
gin Pro sis, n m Ma
n and me and l ed
eer ble De To mu nag
and Mu nt Eth and and
CLOs ing m sig ol nic em
De ltic and ical Te Lif
Kn An n and ati ent
vel ult Sus Aw am e
ow aly and IC on and
op ura tai are wo Lo
led sis Re T Ski Fin
me l nab nes rk ng
ge sea Us lls anc
nt Ski ilit s Ski Le
rch age e
lls y lls arn
ing
Outcome 1 3 3 3 2 1 1 3 3 1
Outcome 2 3 3 3 2 1 1 1 3 3 1
Outcome 3 3 2 3 2 1 1 3 3 1
Outcome 4 3 2 2 2 1 1 1 3 3 1
Course Average 3 3 3 2 1 1 1 3 3 1

Course Unitization Plan - Theory

Unit Unit Name Require CLOs Referenc
No. d Addresse es Used
Contact d
Hours
Unit I Introduction to DBMS and Relational model 8
File Processing System, Advantages of DBMS over File
1 1 1,3
Processing System, Database System Applications.
DBMS Architecture: The three-schema architecture
2 1 1,3
Data Independence: Logical and Physical.
Data Models: Hierarchical, network and relation models. 1 1 1,3
Introduction to relational model, concepts of domain,
2 1 1,3
attribute, tuple, relation, importance of null values.
Database constraints (Domain, Key constraints, integrity
2 1 1,3
constraints) and their importance.
Unit II Query processing 10
Relational Algebra. 2 2 1,3
Relational Calculus. 1 2 1,3
Introduction to SQL: Database Objects- DDL Schema
1 2 1,3
definitions.
DML- Insert, select, update, delete. 1 2 1,3
Views, exercise on SQL queries. 1 2 1,3
Transaction support in SQL. 1 2 1,3
Aggregate Functions, Null Values, Views. 1 2 1,3
Complex Integrity Constraints in SQL. 1 2 1,3
Assertions, Triggers 1 2 1,3
Unit III Conceptual model and database design 9
 Entity Relationship model Entity types, Entity Sets,
Attributes, and Keys Relationships, Relationship types and 3 2 1,2
constraints, Weak Entity types.
Enhanced ER (EER) Modeling: Super/Sub Classes
Specialization and Generalization. Constraints and 2 2 1,2
characteristics of Specialization and Generalization.
Example EER Schema. 1 2
Basics of Normalization, Normal Forms: First Normal Form
(1NF), Second Normal Form (2NF), Third Normal Form 2 2 1,2
(3NF)
BCNF, 4NF 1 2 1,2
Unit IV Transaction Processing, Concurrency Control and Recovery 10
Introduction of transaction processing, advantages and
2 3 1,3
disadvantages of transaction processing system.
Serializability and Recoverability of transaction. 2 3 1,3
Concurrency Control Lock based Protocols. 2 3 1,3
Timestamp Based Protocols – Validation based Protocols -
2 3 1,3
Multiple Granularity Locking.
Recovery techniques. 2 3 1,3
Unit V Overview of Storage and Indexing 8
Data on External Storage, File Organization and Indexing -
2 4 1,3
Clustered Indexes, Primary and Secondary Indexes.
Indexed Sequential Access Methods (ISAM) B+ Trees: Tree
3 4 1,3
Structure, Search, Insert, Delete.
Hash Based Indexing: Static Hashing, Extendable hashing,
3 4 1,3
Linear Hashing, Extendible vs. Linear Hashing.

Course Unitization Plan - Practical

Required
CLOs References
Session Description of Experiment Contact
Addressed Used
Hours
Implementation of data storage and indexing methods using
1. 4 4 1,2,3
files.
2. DML queries on single table. 2 2 1,4
3. Queries on Joining tables and Aggregate Functions. 4 2 1,3
Nested queries, Queries on creation of views, indexes,
4. 4 2 1,3
sequences and access privileges.
5. Triggers, Assertions. 4 2 1,3
6. SQL Transactions. 4 3 1,3
7. PL/SQL, Stored Procedures. 4 4 4
8. Design and Develop Applications. 4 1,2 1,3
Total contact hours 30

Recommended Resources
1. Ramez Elmasri and Shamkant Navathe. Fundamentals of Database Systems (7th ed.). Pearson
Education, 2016.
2. R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw Hill, 2004.
3. A. Silberschatz, H. Korth, S. Sudarshan, Database system concepts, 6th Edition, McGraw Hill, 2011.
4. Database system Implementation: Hector Garcia-Molina Jeffrey D. Ullman Jennifer Widom, Prentice
Hall , 2000.
Other Resources
5. C.J. Date. 2003. An Introduction to Database Systems (8 ed.). Addison-Wesley Longman Publishing
Co., Inc., Boston, MA, USA.

Learning Assessment
Continuous Learning Assessments (50%) End Semester Exam
Bloom’s Level of Theory (35%) (50%)
Practical
Cognitive Task CLA-1 Mid-1 CLA-2 CLA-3 Th(35% Prac(15%)
(15%)
(5%) (20%) (5%) (5%) )
Level Remember
1 Understand
Level Apply
100% 100% 100% 100% 100% 100% 100%
2 Analyse
Level Evaluate
3 Create
Total 100% 100% 100% 100% 100% 100% 100%