COURSE STRUCTURE

Course Code
Course Category Elective I
Course Title Data Base Management System
Teaching Scheme and Credits L T Laboratory Credits
Weekly load hrs. 03 00 00 2+0+0=2
Pre-requisites:
Course Objectives:
1. To Gain understanding of the architecture and functioning of Database Management Systems
as well as associated tools and techniques.
2. To apply the principles of data modeling using Entity Relationship and develop a good
database design.
3. To understand the use of Structured Query Language (SQL) and its syntax.
4. To apply Normalization techniques.
Course Outcomes: Upon completion of the course, the students will be able to
1. To define the terminology, features, classifications, and characteristics embodied in database
systems.
2. To analyze an information storage problem and derive an information model expressed in
the form of an entity relation diagram and other optional analysis forms
3. To demonstrate relational data base model.
4. To apply normalization theory for database.
Course Contents:
Introduction
Purpose of database systems, data abstraction, data models, Data Definition Language, Data
Manipulation Language, entities and entity sets, relationships and relationship sets, mapping
constraints, primary keys, Entity relationship models.
Relational Model and Relational Database Design
Structure of relational database, former query languages, commercial query languages, modifying
the database views, pitfalls in relational database design and normalization.
Network Data Model and Hierarchical Data Model
Data structure diagram, the CODASYL network model, model data retrieval update and set
processing facility, three structure diagram, virtual records.

Dean
Faculty of Engineering
File and System Structure, Indexing and Hashing
Physical storage media – file organization, buffer management, Mapping relations, networks and
hierarchies to files – Index – sequential files. Bi-tree indexed files.
Distributed Database, Security And Integrity
Design, transparency and autonomy, query processing, recovery, concurrency control, deadlock
handling and coordinator selection. Security and integrity, near database application.
Reference Books:
1. H. F. Korth and A. Silbenhatz and S. Sudarshan, Database System Concepts, Mc Graw
Hill, 6th Edition, 2006.
2. Gio Wiederhold, Database Design, Mc Graw Hill, 2001.
3. Jefferey O. Ullman, Principles of Database Systems, 2nd edition, Computer Science
Press; 1982.
4. C.J. Date, An Introduction to database systems, 8th edition, Pearson Education, 2004.
5. Trembley and Soreson, An Introduction to Data structures with applications, 2nd edition,
Mc Graw Hills, 2017.
Supplementary Reading:
Web Resources:
Web links:
http://codex.cs.yale.edu/avi/db-book/db5/slide-dir/index.html
Pedagogy: The pedagogy will consists of
1. Power Point Presentations. 2. Industrial Case Studies.
Assessment Scheme:

Class Continuous Assessment (CCA) (with % weights) – 50 Marks

*Assignments/Case Attendance/
One Mid Term Test Discipline/ Initiative/ Total
Study
Behaviour
25 marks 20 marks 05 marks
50 marks
(50%) (40%) (10%)

Dean
Faculty of Engineering
Laboratory Continuous Assessment (LCA) (with % weights): NA

Practical Oral based on Site Visit Mini Problem Any other

practical Project based
Learning
00 00 00 00 00 --

Term End Examination : 50 Marks

Module Workload in Hrs

Contents
No. Theory Lab Assess

1 Introduction 06 --
2 Relational Model and Relational Database Design 06 --
3 Network Data Model and Hierarchical Data Model 06 --
4 File and System Structure, Indexing and Hashing 06 --
5 Distributed Database, Security And Integrity 06

Prepared By Checked By Approved By

Prof. O. K. Kulkarni Prof. Dr. G. M. Kakandikar Prof. Dr. S. B. Desai

(Assistant Professor) (Professor) (Head, School of
(Mechanical Engineering)

Dean
Faculty of Engineering