0% found this document useful (0 votes)
14 views

DBMS Syllabus

kgkgktyy

Uploaded by

Musiclover Huu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views

DBMS Syllabus

kgkgktyy

Uploaded by

Musiclover Huu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Course Curriculum (w.e.f.

Session 2018-19)
B.Tech. Computer Science & Engineering

BCSC0003: DATABASE MANAGEMENT SYSTEM


Objective: The objective of the course is to enable students to understand and use a relational database
system. Students learn how to design and create a good database.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
No. Content Hours

Introduction: An Overview of Database Management System, Database System


vs File System, Database System Concept and Architecture, Data Model Schema
and Instances, Data Independence, Database Language and Interfaces (DDL,
DML, DCL), Overall Database Structure, Database Users, Database Development
Life Cycle (DDLC).
Data Modeling using the Entity Relationship Model: ER Model Concepts,
I 13
Notation for ER Diagram, Mapping Constraints, Keys, Specialization,
Generalization, Aggregation, Reduction of an ER Diagram to Tables, Extended ER
Model, Relationship of Higher Degree.
Relational Data Model and Language: Relational Data Model Concepts,
Integrity Constraints, Entity Integrity, Referential Integrity, Keys Constraints,
Domain Constraints, Relational Algebra, Relational Calculus, Tuple and Domain
Calculus.
Data Base Design & Normalization: Functional Dependencies, Primary Key,
Foreign Key, Candidate Key, Super Key, Normal Forms, First, Second, Third
Normal Forms, BCNF, 4th Normal Form, 5th Normal Form, Lossless Join
II Decompositions, Canonical Cover, Redundant Cover, Synthesis the Set of 14
Relation, MVD and JDs, Inclusion Dependence.
File Organization: Indexing, structure of index files and types, Dense and sparse
indexing, Introduction and properties of B trees and B+ trees, Finding order and
capacity of B+ trees.
Transaction Processing Concept: Transaction System, Testing of Serializability,
Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,
Recovery from Transaction Failures, Log Based Recovery, Deadlock Handling.
III Distributed Database: Introduction of Distributed Database, Data 13
Fragmentation and Replication. Concurrency Control Techniques:
Concurrency Control, Locking Techniques for Concurrency Control, 2PL, Time
Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple
Granularity, Multi Version Schemes.

Text Books:
• Elmasri and Navathe (2010), “Fudamentals of Database Systems”, 6th Edition, Addision Wesley.

References Books:
• Date C J,” An Introduction to Database Systems”, 8th Edition, Addision Wesley.
• Korth, Silbertz and Sudarshan (1998), “Database Concepts”, 5th Edition, TMH.
• Majumdar& Bhattacharya, “Database Management System”, TMH.

Outcome: After the completion of the course, the student will:


• Master the basic concepts and appreciate the applications of database systems.
• Be familiar with the relational database theory, and be able to write relational algebra expressions for
queries and design principles for logical design of databases, including the E‐R method and
normalization approach.
• Be familiar with the basic issues of transaction processing and concurrency control.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

You might also like