DBMS

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 5

Syllabus:

IT/CS 222 Database Management Systems L P C


Course Objectives

The objectives of the course are:

1. To introduce fundamental concepts and architectures of database system


2. To impart Features and design of conceptual and relational data models
3. To demonstrate various operations on relational data model.
4. To discuss the protocols related to transaction processing, concurrency control and recovery.

Course Outcomes

At the end of the course the students will be able to

1. Discuss the fundamental concepts and architecture of database systems and data models.
2. Use relational query languages and SQL for querying the database.
3. Develop conceptual database schema for a given specification.
4. Modify database design using normalization process.
5. Describe the role of transaction processing, concurrency control and recovery in a
multi user database system.

CO-PO Mapping:

PO1 PO1 PO1


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 1 1 - - - - - - - - 2
CO2 3 3 3 2 3 2 - - - - 2 2
CO3 3 2 2 2 - 2 - - - - 2 2
CO4 3 2 2 2 - 2 - - - - 2 2
CO5 3 2 2 2 - 2 - - - - - 2

Course Content:

UNIT I (CO1) 11 Periods

Introduction: Database system Applications, Purpose of Database Systems, View of Data,


Database Languages, Relational Databases, Database Design, Data Storage and Querying,
Transaction Management, Database Architecture, Database Users and Administrators
Introduction to the Relational Model: Structure of RDBMS, Database Schema, Keys,
Relational Query Languages, Relational Operations
UNIT II (CO2) 15 Periods
Formal Relational Query Languages - The Relational Algebra and Relational Calculus
SQL: Overview of the SQL Query Language, SQL Data Definition, Basic Structure of SQL
Queries, Additional Basic Operations, Set Operations, Null Values, Aggregate Functions,
Nested Subqueries, Modification of the Database, Join Expressions, Views, Transaction,
Integrity Constraints, SQL Data Types and Schemas, Authorization

UNIT III (CO3 and CO4) 12 Periods

Database Design and the E-R Model - Overview of the Design Process, The Entity-
Relationship Model, Constraints, Removing Redundant Attributes in Entity Sets, Entity-
Relationship Diagrams, Reduction to Relational Schemas.
Relational Database Design - Atomic Domains and First Normal Form, Decomposition Using
Functional Dependencies, Functional-Dependency Theory, Algorithms for Decomposition,
Decomposition Using Multivalued Dependencies, More Normal Forms, Database-Design
Process.

UNIT IV (CO5) 12 Periods


Transactions: Transaction Concept, A Simple Transaction Model, Storage Structure,
Transaction Atomicity and Durability, Transaction Isolation, Serializability, Transaction
Isolation and Atomicity, Transaction Isolation Levels
Concurrency Control: Lock-Based Protocols, Deadlock Handling, Multiple Granularity,
Timestamp-Based Protocols, Validation-Based Protocols, Multiversion Schemes, Snapshot
Isolation
Recovery System: Failure Classification, Storage, Recovery and Atomicity, Recovery
Algorithm, Buffer Management

Learning Resources:
Text Book:
1. Database System Concepts by Abraham Silberschatz, Henry F. Korth and S.
Sudarshan, Sixth Edition, McGraw Hill Publishers.
REFERENCES:

1. Introduction to Database Systems, C.J.Date Pearson Education


2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke,
TATAMcGrawHill 3rd Edition
3. Database Systems, Ramez Elmasri and Shamkant B.Navathe, Pearson Education, 6th
edition.
Model Question Paper
Subject Code: IT/CS 222 (R20)
R.V.R. & J.C. College of Engineering, Guntur – 522019
(Autonomous)
B.Tech. Semester-IV [Second Year] Degree Examination(Regular)
Subject Name: Database Management Systems
Time: 3 hrs Max. Marks: 70
All Questions carry equal marks.
Answer Question No.1 compulsory (14 x 1 = 14 Marks)
Answer ONE Question from each unit (4 x 14 = 56 Marks)

Answer ALL Questions Marks COs Blooms


Taxonomy
Level
1. (a) Define Database and DBMS. 1 CO1 1
(b) List out the categories of data models. 1 CO1 4
(c) What are the components of storage manager? 1 CO1 1
(d) Define naive user. 1 CO1 1
(e) Assess the importance of primary Key in relations. 1 CO2 5
(f) Justify - Relational algebra is procedural query 1 CO2 5
language.
(g) What is the purpose of GRANT and REVOKE in SQL? 1 CO2 1
(h) Discuss materialized view maintenance. 1 CO2 6
(i) Give the examples for simple & Composite attributes. 1 CO3 1
(j) Define 1NF 1 CO4 1
(k) Summarize the use of MVD in normal forms. 1 CO4 2
(l) Define transaction. 1 CO5 1
(m) How concurrent transactions are controlled in multi- 1 CO5 2
version based protocols? Explain
(n) Compare log-based recovery with the shadow-copy 1 CO5 2
scheme.
UNIT – I
2. (a) What are advantages of database systems? Discuss 7 CO1 1
(b) Explain with neat diagram three levels of data 7 CO1 2
abstraction.
(OR)
3. (a) Discuss the methods used in designing relational 7 CO1 6
databases along with example.
(b) Construct schema diagram for university database 7 CO1 6
organization.
UNIT – II
4. (a) What are fundamental operations in relational 7 CO2 1
algebra? Explain.
(b) What are various aggregate functions in SQL? Explain 3 CO2 1
with suitable examples.
(c) Formulate various Join expression in SQL with 4 CO2 6
examples.
(OR)

5. (a) Consider the following UNIVERSITY Schema and 7 CO2 6


develop SQL DDL statements. (make any reasonable
assumptions about data types, and be sure to declare
primary and foreign keys)

Department(dept name, building, budget)


Course(course id, title, dept name, credits)
Instructor(ID, name, dept name, salary)
Section(course id, sec id, semester, year, building, room
number, time slot id)
Teaches(ID, course id, sec id, semester, year)
Student(ID, name, dept name, tot cred)
Takes(ID, course id, sec id, semester, year, grade)
Prereq(course id, prereq id)
(b) Consider the UNIVERSITY Schema given in 5.(a) and 7 CO2 6
formulate SQL statements for the following queries.

(a) Find the names of all instructors in the Computer Science


department who have salary greater than 70,000
(b) Find the average salary of all instructors.
(c) Find the total number of instructors who teach a course in the
Spring 2010 semester
(d)Retrieve the names of all instructors, along with their
department names and department building
name
(e) WAQ to display prerequisite course ID, names for each Course.
(g) WAQ to display courses offered by each department in
descending order
(h) WAQ to display department names for each instructor.
UNIT – III
6. (a) Discuss the E-R model for database design along with 7 CO3 6
example.
(b) What are Weak entity Types? Explain 2 CO3 1

(c) Summarize the following constraints in E-R Model. 5 CO3 2


(i) Cardinality constraints (ii) Participation
constraints (iii) Keys
(OR)

7. (a) List out various Armstrong axioms with example FDs. 7 CO4 4

(b) Discuss with suitable example THIRD NORMAL FORM 7 CO4 6


and BCNF

UNIT – IV
8. (a) With neat diagram explain state diagram of a 7 CO5 2
transaction and discuss ACID properties of a
transaction model.
(b) Write notes on the following. 7 CO5 1
(i) Serializable schedules
(ii) Recoverable schedules
(OR)
9. (a) Discuss Lock based protocols with example. 7 CO5 6
(b) Explain the purpose of the checkpoint mechanism. 7 CO5 2
How often should checkpoints be performed?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy