0% found this document useful (0 votes)
20 views4 pages

Database Management Systems Syllabus

The document outlines the course structure for '22CS201 - Database Management Systems', detailing prerequisites, course objectives, and modules covering database concepts, relational database design, normalization, transaction processing, and practical SQL applications. It emphasizes skills in E-R modeling, database design, query formulation, and transaction management. The course aims to equip students with a comprehensive understanding of database systems and their applications in real-world scenarios.

Uploaded by

Brunda A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views4 pages

Database Management Systems Syllabus

The document outlines the course structure for '22CS201 - Database Management Systems', detailing prerequisites, course objectives, and modules covering database concepts, relational database design, normalization, transaction processing, and practical SQL applications. It emphasizes skills in E-R modeling, database design, query formulation, and transaction management. The course aims to equip students with a comprehensive understanding of database systems and their applications in real-world scenarios.

Uploaded by

Brunda A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

22CS201 - DATABASE MANAGEMENT SYSTEMS

L T P C
2 2 2 4

PREREQUISITE KNOWLEDGE: Discrete Mathematical Structures


COURSE DESCRIPTION AND OBJECTIVES:
This course presents an introduction to database management systems with an emphasis on
how to organize, maintain and retrieve data efficiently from a relational database. It also
focuses on requirements gathering and conceptual, logical, physical database design. The
objective of the course is to enable the student to understand database design, expressing
queries using SQL, query optimization and transaction processing.

MODULE - 1
UNIT–1: DATABASE SYSTEM CONCEPTS [10L+6T+4P=20 Hours]
Databases And Database Users: Introduction; Characteristics of the database approach; Actors on
the scene; Advantages of using DBMS approach.

Database System Concepts and Architecture: Data models, Schemas and instances; Three-
Schema architecture and data Independence; Database languages and interfaces; The database
system environment; Centralized and Client-Server architectures for DBMS.

Conceptual Data Modeling and Database Design: Entity types, Entity sets, Attributes and
keys; Relationship types, Relationship sets, Roles and structural constraints; Weak entity types;
Relationship types.

UNIT–2: RELATIONA DATABASE DESIGN [6L+10T+12P=28 Hours]


Relational Database Design by Er–To-Relational Mapping: Relational Database design
using ER-to-Relational mapping.
The Relational Data Model and Relational Database Constraints: Relational model concepts;
Relational model constraints and Relational database schemas.
Relational Algebra: Unary relational operations - SELECT and PROJECT; Relational algebra
operations from set theory; Binary relational operations- JOIN and DIVISION.
SQL: SQL data definition and data types; specifying constraints in SQL, Basic retrieval
queries in SQL; INSERT, DELETE, and UPDATE statements in SQL.
Practices:
 Design ER Model for various real time database applications.
 Development of Relational Database schemas for Company/Student/Sailors/ using DDL
constructs of SQL.
 Apply various DML Commands such as select, insert, update etc. of SQL on Relational
Database.
 Design of Relational Database schemas by specifying different types of Constraints.
 Apply various Relational Database operators (Arithmetic, Logical &comparison) and
string-matching constructs of SQL.
 Expressing queries using Aggregate Functions of SQL on Relational Database.
 Queries on Relational Database using GROUP BY, HAVING and ORDER BY clauses of
SQL.

MODULE-2

UNIT–1: NORMALIZATION [8L+8T+12P=28


Hours]
Complex Queries, Triggers, Views: More complex SQL retrieval queries; Specifying
constraints as assertions and actions as triggers; Views (virtual tables) in Pl/SQL.
Basics Of Functional Dependencies and Normalization for Relational Databases: Informal
design guidelines for relation schemas; Functional dependencies-inference rules, equivalence
and minimal cover; Normal forms based on primary keys; Boyce-Codd normal form; Properties
of relational decompositions, multivalued dependency, join dependencies.

UNIT–2: TRANSACTION PROCESSING [8L+8T+4P=20 Hours]


Introduction To Transaction Processing Concepts and Theory: Introduction to transaction
processing; Transaction and system concepts; Desirable properties of transactions;
Characterizing schedules based on serializability.
Concurrency Control Techniques: Two-phase locking techniques for concurrency control,
concurrency control based on timestamp ordering.
Database Recovery Techniques: Recovery concepts; Shadow paging; The ARIES recovery
algorithm.

Indexing Structures for Files and Physical Database Design: Single level and multi-Level
indexing; Dynamic multi-level indexing using B-trees and B+ trees.
Practices:
 Design and Development of company database and expressing Nested queries using SQL.
 Design and Development of student database and specifying queries using set operations.
 Design and Development of sailor’s database and specifying queries using different types of
JOINs.
 Implementation of PL/SQL programs with Control Structures.
 Implementation of PL/SQL programs with Procedures.
 Implementation of PL/SQL programs with Function.
 Implementation of PL/SQL programs with Triggers.
 Creation and dropping of VIEWS.
 Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F =
{CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies
(FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate keys does
the relation R have?
 Apply various DCL and TCL constructs of SQL on Relational Database.

SKILLS:

 Develop E-R model for real life applications.


 Design of relational databases for real world applications.
 Devise queries using relational algebra and SQL.
 Analyze transaction processing, concurrency control and recovery techniques.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

CO Course Outcomes Blooms Module Mapping


No Level No. with POs
1 Develop an E-R model for real life applications. Apply 1 1,10
2 Design and normalize databases for real time Create 1 1,3
applications.
3 Devise queries using Relational Algebra and SQL. Analyze 2 2
4 Express queries using database tools like Oracle, DB2, Apply 2 5,10
MYSQL.
Text Book:

1. Ramez, Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”,7 th


edition, Pearson Education, 2016.
2. Raghu Rama Krishnan and Johannes Gehrke, “Database Management Systems”,3 rd edition,
TataMcGraw Hill,2013.
Reference Books:
1. Abraham Silberschatz, Henry [Link] and [Link], “Database System Concepts”,7 th
edition, Tata Mc Graw Hill,2019.
2. Allen G. Taylor “Database Development for Dummies" 1st Edition, 2011
3. C. J. Date “introduction to database systems” 7th edition, Addison Wesley,
2003.

[Link]

Common questions

Powered by AI

Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. It is important because it ensures efficient data storage, eliminates update anomalies, and simplifies maintenance. By applying rules like first, second, and third normal forms, databases achieve higher data integrity and optimized query performance .

The ER model facilitates database design by providing a conceptual framework that represents real-world entities and their relationships. Its core components include entity types, which define distinct objects; attributes, which specify properties of entities; and relationship types, which capture associations between entities. This model helps create a clear structure that can be translated into a relational database design .

The key characteristics of a database approach include data abstraction, data independence, and efficient data management. These characteristics improve efficiency by reducing data redundancy, ensuring consistency, and allowing for concurrent data access. They enhance reliability by implementing integrity constraints and supporting robust transaction processing .

Views contribute to data security by abstracting underlying table structures and allowing users to access data through predefined queries, restricting exposure to sensitive data. They simplify complex queries by encapsulating them as virtual tables, making frequently used or complex queries reusable and easier to manage without directly manipulating base tables .

The ARIES (Algorithm for Recovery and Isolation Exploiting Semantics) recovery algorithm is crucial for database recovery management as it supports recovery from crashes by maintaining a detailed transaction log and redo/undo operations. Its approach involves three phases: analysis, redo, and undo, allowing it to efficiently restore the database to a consistent state post-failure .

Functional dependencies describe the relationship between attributes in a database, where one set of attributes uniquely determines another set. They are critical in normalization, serving as the basis for identifying and eliminating redundant data during the normalization process. Understanding these dependencies allows for the decomposition of database schemas into smaller, non-redundant tables .

The ER-to-Relational mapping process provides advantages such as a systematic approach to transition from conceptual design to logical schema, preserving relationships and key constraints effectively. However, disadvantages include the complexity of handling many-to-many relationships and possible loss of semantic meaning inherent in ER models when converting into tables and relationships .

Concurrency control techniques like two-phase locking ensure transaction integrity by dividing the locking process into two distinct phases: growing, where a transaction acquires all required locks without releasing any, and shrinking, where it releases locks but cannot acquire new ones. This ensures serializability and prevents conflicts between concurrent transactions, maintaining database consistency .

In SQL, constraints play a crucial role in ensuring data integrity and consistency. Types of constraints include PRIMARY KEY, ensuring uniqueness and non-nullability of a column; FOREIGN KEY, maintaining referential integrity; UNIQUE, ensuring all values in a column are distinct; CHECK, specifying conditions on data values; and NOT NULL, guaranteeing that a column cannot contain NULL values .

The key differences between B-trees and B+ trees for indexing include their structure and data storage methods. B-trees store keys in internal and leaf nodes, allowing direct data retrieval, whereas B+ trees store keys in internal nodes with actual data only in leaf nodes, forming linked lists. B+ trees provide faster sequential access and are more optimized for range queries .

You might also like