COURSE FILE

DATABASE
MANAGEMENT SYSTEMS

For
B. TECH (CSE) 2nd YEAR – 2st SEM (R18)
2022-23 (SEM-II)

by
MOGILI SIVA
Assistant Professor

Departmentof
CSE(DATA SCIENCE)
 CONTENTS

1. Vision & Mission of the Institute

2. Vison & Mission of the Department
3. Programme Educational Objectives
4. Program Outcomes (PO’s)
5. Program Specific Outcomes (PSO’s)
6. Syllabus
7. Course Objectives
8. Course outcomes(cos)
9. CourseOutcomeMappingwithPO’sandPSO’s
10. University Academic Calendar
11. Unit wise Lecture plan
12. Unit wise Question bank (Descriptive &Objective with key)
13. Previous papers
14. Notes Material / Lecture Material
15. Internal And External Assessment (Assignment Test Question Papers,
Mid Exams Question Papers, Marks Lists, Scheme of Evaluation)
16. CO-PO mapping and final attainment. (from VM-Edu life)
 INSTITUTE VISION MISSION
VIGNAN INSTITUTE OF TECHNOLOGY & SCIENCE
DESHMUKHI, HYDERABAD

VISION
"To evolve into a center of excellence in Science & Technology through creative and
innovative practices in teaching-learning, promoting academic achievement & research
excellence to produce internationally accepted competitive and world class professionals
who are psychologically strong and emotionally balanced imbued with social consciousness
and ethical values."

MISSION
"To provide high quality academic programs, training activities, research facilities and
opportunities supported by continuous industry - institute interaction aimed at
employability, entrepreneurship, leadership and research aptitude among students and
contribute to the economic and technological development of the region, state and nation."
 DEPARTMENT VISION MISSION

DEPARTMENT OF CSE(DATA SCIENCE)

VISION

To excel the standards in education and research in CSE(DATA SCIENCE) engineering,

nurturing collaborative culture and disseminating industry required innovations to relevant areas
of academia and industry towards serving the greater cause of society.

MISSION

 To produce professionals who are skilled in the area of CSE(DATA SCIENCE).

 To produce excellent computer science professionals by imparting quality training, hands-

on-experience and value-based education.

 To strengthen links with industry through collaborative partnerships in research & product
development and student internships.

 To achieve value-added and qualitative education through hands-on-experience to excel

towards innovation of computing, AI to raise at outstanding for all stake holders.
PROGRAM EDUCATIONAL OBJECTIVES (PEOS)
PEO1: Professional Excellence
To impart proficiency in engineering knowledge and skills to analyze, design, build,
maintain or improve computer engineering-based systems.

PEO2: Understanding Socio-Economic Aspects

To offer broad education and practical skills so that the students can carry out technical
investigations within realistic constraints such as economic, environmental, societal, safety
and sustainability.

PEO3: Technical Collaboration.

To impart ability to collaborate with and function on multidisciplinary teams to offer
engineering solutions to the society.

PEO4: Continued Self-Learning.

To create interest in the students to engage in life-long learning in advanced areas of
computer engineering and related fields.
 PROGRAM OUTCOMES (POs):

Engineering Graduates will be able to:

PO1. Engineering knowledge:
Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering
specialization to the solution of complex engineering problems.
PO2. Problem analysis:
Identify, formulate review research literature and analyze complex engineering problems
reaching substantiated conclusions using first principle of mathematics, natural science and
engineering science.
PO3. Design/development of solutions:
Design solutions for complex engineering problems and design system components or processes
that meet the specified needs with appropriate consideration for the public health and safety, and
the cultural, societal, and environmental considerations.
PO4. Conduct investigations of complex problems:
Use research-based knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid conclusions.
PO5. Modern tool usage:
Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering activities with an understanding of the
limitations.
PO6. The engineer and society:
Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal
and cultural issues and the consequent responsibilities relevant to the professional engineering
practice.
PO7. Environment and sustainability:
Understand the impact of the professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and need for sustainable development.
PO8. Ethics:
Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.
PO9. Individual and team work:
Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO10. Communication:
Communicate effectively on complex engineering activities with the engineering community and
with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.
PO11. Project management and finance:
Demonstrate knowledge and understanding of the engineering and management principles and
apply these to one's own work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO12. Life-long learning:
Recognize the need for, and have the preparation and ability to engage in independent and life-
long learning in the broadest context of technological change.
 PROGRAMME SPECIFIC OUTCOMES(PSOs)
A graduate of the Computer Engineering Program will demonstrate:

PSO1: Engineering Knowledge.

Graduates shall demonstrate sound knowledge in analysis, design, laboratory

investigations and construction aspects of Computer engineering infrastructure, along
with good foundation in mathematics, basic sciences and technical communication.

PSO2: Broadness and Diversity.

Graduates will have a broad understanding of economic, environmental, societal, health

and safety factors involved in infrastructural development, and shall demonstrate ability
to function within multidisciplinary teams with competence in modern tool usage.

PSO3: Self-Learning and Service.

Graduates will be motivated for continuous self-learning in engineering practice and/ or

pursue research in advanced areas of civil engineering in order to offer engineering
services to the society, ethically and responsibly.
 SYLLABUS
UNIT - I
Database System Applications: A Historical Perspective, File Systems versus a DBMS, the
Data Model, Levels of Abstraction in a DBMS, Data Independence, Structure of a DBMS
Introduction to Database Design: Database Design and ER Diagrams, Entities, Attributes,
and Entity Sets, Relationships and Relationship Sets, Additional Features of the ER Model,
Conceptual Design With the ER Model
UNIT - II

Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity
constraints, querying relational data, logical data base design, introduction to views,
destroying/altering tables and views. Relational Algebra, Tuple relational Calculus, Domain
relational calculus.
UNIT - III

SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query, UNION,

INTERSECT, and EXCEPT, Nested Queries, aggregation operators, NULL values, complex
integrity constraints in SQL, triggers and active data bases.
Schema Refinement: Problems caused by redundancy, decompositions, problems related to
decomposition, reasoning about functional dependencies, FIRST, SECOND, THIRD normal
forms,BCNF, lossless join decomposition, multi-valued dependencies, FOURTH normal
form, FIFTH normal form.
UNIT - IV

Transaction Concept, Transaction State, Implementation of Atomicity and Durability,

Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Testing
for serializability, Lock Based Protocols, Timestamp Based Protocols, Validation- Based
Protocols, Multiple Granularity, Recovery and Atomicity, Log–Based Recovery, Recovery
with Concurrent Transactions.
UNIT - V

Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and
Secondary Indexes, Index data Structures, Hash Based Indexing, Tree base Indexing,
Comparison of File Organizations, Indexes and Performance Tuning, Intuitions for tree
Indexes, Indexed Sequential Access Methods (ISAM), B+ Trees: A Dynamic Index Structure.

TEXT BOOKS:

1. Database Management Systems, Raghurama Krishnan, Johannes

Gehrke, Tata Mc Graw Hill
3rd Edition
2. Database System Concepts, Silberschatz, Korth, Mc Graw hill, V edition.
 REFERENCES:

1. Database Systems design, Implementation, and Management, Peter Rob

& Carlos Coronel 7th Edition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C. J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah,
PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student
Edition.

COURSE OBJECTIVES
1. To understand the basic concepts and the applications of database systems.

2. To master the basics of SQL and construct queries using SQL.

3. Topics include data models, database design, relational model, relational algebra,
transaction control, concurrency control, storage structures and access techniques.

COURSE OUTCOMES
After completion of this course students will be able to
1. Gain knowledge of fundamentals of DBMS, database design and normal forms
2. Master the basics of SQL for retrieval and management of data
3. Be acquainted with the basics of transaction processing and concurrency control
4. Familiarity with database storage structures and access techniques.
COURSE OUTCOME MAPPING WITH PO’S AND
PSO’S

CO – PO MAPPING:

Subject Name: DataBase Management Systems

Sub Code: CS404PC

VMEDULIFE Course Code:

CO/PO a b c d e f g h i j k l
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO.1 3 3 3 3
CO.2 3 2 2 3
CO.3 3 3 3 3
CO.4 3 3 3 3
CO.5 3 3 3 3

CO – PSO MAPPING:

CO/PSO PSO1 PSO2 PSO3

CO.1 3 3
CO.2 2
CO.3 3 3
CO.4 3
CO.5 3 3
UNIVERSITY ACADEMIC CALENDAR
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCEINCE: DESHMUKHI
Department of CSE(DATA SCIENCE)
LECTURE PLAN
Subject: Database Management Systems
No. Of
CS404PC: DATABASE MANAGEMENT Teaching Source
S.NO Periods
SYSTEMS LECTURE PLAN Methodology Reference
required
A Historical Perspective, File Systems
1 2 Black Board & PPT T1
versus a DBMS
2 The Data Model 2 Black Board & PPT T1
3 Levels of Abstraction in a DBMS 1 Black Board & PPT T1
4 Data Independence 1 Black Board & PPT T1
5 Structure of a DBMS 1 Black Board & PPT T1
6 Database Design and ER Diagrams 2 Black Board & PPT T1
7 Entities, Attributes, and Entity Sets 2 Black Board & PPT T1
8 Relationships and Relationship Sets 1 Black Board & PPT T1
9 Additional Features of the ER Model 1 Black Board & PPT T1
Conceptual Design With the ER
10 1 Black Board & PPT T1
Model
Total Number of periods for
14
Unit-1
11 Introduction to the Relational Model 1 Black Board & PPT T1
12 Introduction to SQL 1 Black Board & PPT T1
13 DDL,DML 4 Black Board & PPT T1
14 DCL,TCL 2 Black Board & PPT T1
15 Integrity constraint over relations 1 Black Board & PPT T1
enforcing integrity constraints, 1
16 Black Board & PPT T1
querying relational data
logical data base design
17 1 Black Board & PPT T1
introduction to views
18 1 Black Board & PPT T1
19 destroying/altering tables and views 1 Black Board & PPT T1
20 Relational Algebra 2 Black Board & PPT T1
21 Tuple relational Calculus 1 Black Board & PPT T1
22 Domain relational calculus.\ 1 Black Board & PPT T1
Total Number of periods for
17
Unit-2
23 form of basic SQL query 1 Black Board & PPT T1
24 UNION, INTERSECT, and EXCEPT 1 Black Board & PPT T1
25 SQL Operators 2 Black Board & PPT T1
26 Nested Queries 2 Black Board & PPT T1
27 Aggregation operators, NULL values 1 Black Board & PPT T1
28 complex integrity constraints in SQL 2 Black Board & PPT T1
29 triggers and active data bases 2 Black Board & PPT T1
30 Problems caused by redundancy 1 Black Board & PPT T1
31 Decompositions and its problems 1 Black Board & PPT T1
reasoning about functional dependencies 1
32 Black Board & PPT T1
FIRST, SECOND normal forms 1
33 Black Board & PPT T1
THIRD normal form, BCNF 1
34 Black Board & PPT T1
lossless join decomposition, multi-valued 1
35 dependencies, Black Board & PPT T1
FOURTH normal form, FIFTH normal 1
36 form. Black Board & PPT T1

Total Number of periods for

18
Unit-3
37 Unit-4: Transaction Concept 1 Black Board & PPT T1
38 Transaction State 1 Black Board & PPT T1
Implementation of Atomicity and
39 1 Black Board & PPT T1
Durability
40 Concurrent Execution 1 Black Board & PPT T1
41 Serializability 1 Black Board & PPT T1
42 Recoverability 1 Black Board & PPT T1
43 Implementation of Isolation 1 Black Board & PPT T1
44 Testing for serializability 1 Black Board & PPT T1
45 Lock Based Protocols 1 Black Board & PPT T1
46 Timestamp Based Protocols 1 Black Board & PPT T1
47 Validation- Based Protocols 1 Black Board & PPT T1
48 Multiple Granularity 1 Black Board & PPT T1
49 Recovery and Atomicity 1 Black Board & PPT T1
50 Log–Based Recovery 1 Black Board & PPT T1
Recovery with Concurrent 1
51 Black Board & PPT T1
Transactions
Total Number of periods for
11
Unit-4
Data on External Storage. 1
52 Black Board & PPT T1
53 File Organization and Indexing, 2 Black Board & PPT T1
 Cluster Indexes, Primary and
Secondary Indexes
Index data Structures, Hash 1
54 Based Indexing, Tree base Black Board & PPT T1
Indexing
55 Comparison of File Organizations 1 Black Board & PPT T1
56 Indexes and Performance Tuning 1 Black Board & PPT T1
57 Intuitions for tree Indexes 1 Black Board & PPT T1
58 Dynamic Hashing 1 Black Board & PPT T1
Indexed Sequential Access Methods 1
59 Black Board & PPT T1
(ISAM
60 B+ Trees: A Dynamic Index structure 1 Black Board & PPT T1
Total Number of periods for
10
Unit-5
Total Number of periods
70
for All 5 Units
 Department of CSE(DATA SCIENCE)

QUESTION BANK
For ALL 5 UNITS
DESCRIPTIVE & OBJETIVE QNS
COURSE: B. Tech (AI&DS) II Year – II Semester (R18)
QNO Description of Question Mark CO BTL
s PO

a What is DBMS? What are the goals of DBMS? 2M 1 1 1

b Explain the three levels of abstraction. 3M 1 2 2
1 Explain the differences between file processing system
c 5M 1 2 1
and a DBMS?
d Explain the applications of DBMS 5M 1 3 2
Distinguish between relation schema and relation
a 2M 1 2 2
instance?
2 b What is Data Independence and Explain? 3M 1 1 2
What is a data model? What are the different data models?
c 10M 1 3 1
Explain.
a Explain about DDL. 2M 1 1 2
b What is DBMS? What are the advantages of DBMS? 3M 1 2 2
3
Explain the architecture of Database Management
c 10M 1 1 2
Systems with a neat diagram
4 a Define the terms entity and attributes 2M 1 1 1
Differentiate between strong Entity set and weak Entity
b 3M 1 2 4
set?
c Explain about different types of database users? What are 5M 1 2 2
the functions of DBA?
 Construct an ER-Diagram for a hospital with a set of
patients and set of medical doctors. Associated with each
d 5M 1 3 6
patient a log of the various tests and examinations
conducted
a Explain about participation constraints 2M 1 3 2
b Explain the steps involved in database design process 3M 1 2 2
What is E-R model? Draw an E-R Diagram for any
5 c 5M 1 1 3
Banking enterprise system.
What is Entity set and also define Relationship set. List
d 5M 1 2 1
and explain the symbols used to draw ER Diagram
Compare between super key, Candidate key, Primary
a 2M 1 3 2
Key for a relation with examples.
b Explain about mapping cardinalities 3M 1 2 2
6
What are the additional features of ER model? Explain 1
c with examples. 10M 1 1

a Compare Simple and Composite attributes 2M 1 2 2

b Explain the history of DBMS 3M 1 1 2
Design the ER diagram for the following by identifying
the Entities, Attributes, Relationships and Constraints:
7
A teacher can teach many courses. A students can enroll
c 10M 1 3 6
in many courses. A course may be a part of one or many
programs. A teacher can mentor for many students;
however, a student can have only one mentor
a 2M 1 1 2
Explain about DDL and DML languages
Classify the relationship set based on the degree of
b relationship set? 3M 1 1 2
8
c Draw an ER diagram for Library Management System 5M 1 2 3
What are the main components in a DBMS and briefly
d 5M 1 2 2
explain what they do?
a Distinguish between super key and Candidate key. 2M 1 2 2
b Explain about DML language and Query Processor 3M 1 2 2
What is data independence? Explain about physical data
9 c 5M 1 1 1
independence and logical data independence?
Explain the following : i) View of data ii) Data
d 5M 1 1 2
abstraction iii)Instances and Schemas
a List the properties of ER diagram 2M 1 3 1
Define generalization, specialization and aggregation in E-R
10 b Model. 3M 1 1 1
c Construct an ER diagram for hospital management database 10M 1 3 6
 UNIT-2
QNO Description of Question Mark CO PO BTL
s

a What is a relation? 2M 2 2 1
What are statements used to update and alter the table
b 3M 2 1 1
1 contents?
What is an integrity constraint? Explain the different
c types of integrity constraints over relations with 10M 2 2 2
examples?
What are the SQL statements are used to retrieve and
a 2M 2 1 2
modify the database?
2 b Demonstrate on altering tables and views 3M 2 1 2
Explain the fundamental operations in relational algebra
c 10M 2 2 2
with examples.
a Define the terms Arity and Cardinality of a Relation 2M 2 1 1
b 3M 2 2 2
3 c Explain about Logical Database Design 5M 2 3 2
Differentiate between Tuple Relational Calculus and
d 5M 2 3 4
Domain Relational calculus
Define the terms primary key constrains and foreign key
a 2M 2 2 1
and check constraints.
Differentiate between relational algebra and relational
b 3M 2 2 4
calculus
Consider the following relations
Sailors((sid,sname,rating,age)
Boats(bid,bname,color)
Reserves(sid,bid,day)
Write the statements in Relational Algebra, Relational
4 Calculus, Domain relational Calculus, and SQL for the
following questions
c i)Find names of sailors who have reserved a RED boat 10M 2 2 3
ii)Find the names of sailors who have reserved at least one
boat
iii)Find the names of sailors who have reserved a Red and
a Green boat
iv) Find the names of sailors who have reserved a Red or
a White boat
v) Find the names of sailors who have reserved all boats
5 a Explain various Domain constraints in SQL with examples 2M 2 2 2
What is view? How to specify a View? Write about view
b 3M 2 3 2
implementation techniques?
c Explain about domain relational calculus with example 5M 2 2 2
d Explain about Tuple relational calculus with example 5M 2 1 2
 a Discuss the functionality of query evaluation engine. 2M 2 4 1
When are integrity constraints enforced by a DBMS?
b 3M 2 1 1
What is referential integrity? Explain with examples.
6
c Explain about outer join operation in relational algebra 5M 2 2 1
Explain modification of the database operations in
d 5M 2 2 1
relational algebra with example
a Explain Generalized projection in Relational Algebra 2M 2 1 2
Differentiate between a relation schema and relation
b 3M 2 2 4
instance. Define the term arity and degree of a relation

7 Let R = (A, B, C), and let r1 and r2 both be relations on

schema R. Give an expression in the domain relational
c calculus that is equivalent to each of the following: 10M 2 3 3
i). ΠA(r1) ii). σB = 17 (r1) iii) r1 ∪ r2 iv) . r1 ∩ r2 v). r1 − r2
vi) ΠA,B(r1) ΠB,C(r2)
Define the terms primary key constrains and foreign key
a 2M 2 1 1
and check constraints
b 3M 2 1 2
Explain views in SQL language.
8
Let R =(ABC) and S=(DEF) let r(R) and s(S) both relations
on schema Rand S. Formulate an expression in the Tuple
c 10M 2 3 3
relational calculus that is equivalent to each of the following.
i) ΠA(r) ii) σB=19(r) iii) rXs iv) ΠA,F,( σC=D(rXs)).
“Relational algebra is procedural and tuple relational
a 2M 2 2 5
calculus is non- procedural language”. Justify.

What are integrity constraints? Define the terms primary

9 b 3M 2 1 1
key constrains and foreign key constraints. How are these
expressed in SQL?
Describe the difference, union, rename and Cartesian
c 10M 2 2 2
product operations in relational algebra
a 2M 2 2 2
Explain the selection and projection operations
b Describe about logical database design 3M 2 2 2
10
What are NULL values? Are they supported in relational
c model? How do they effect the meaning of queries? Can 10M 2 1 1
primary key fields of table contain null values?
 UNIT-3
QNO Description of Question Mar Cou Progr BTL
ks rse am
outc Outco
ome me(P
(CO O)
)
What is an assertion?
a 2M 3 2 1

What is the usage of ‘group by’ and ‘having’ clauses in SQL?

b 3M 3 2 1
1
Explain the following Operators in SQL with examples
c i) SOME ii) IN iii) EXCEPT iv) EXISTS iv)ALL 5M 3 2 2

Explain various set operations are used in SQL with

d examples 5M 3 4 2

a What are NULL values? Can primary key fields of table contain 2M 3 1 1
null values?

b Define the terms primary key, foreign key and check 3M 3 2 1

2 constraints . How are these expressed in SQL

c Explain the aggregate operators in SQL. 5M 3 1 2

d What is a nested query? Discuss a correlated nested query 5M 3 2 2

with examples.
a What is an active database?
3
2M 3 3 1

b Explain various DML functions in SQL with examples. 3M 3 3 2

c What are the complex integrity constants in SQL? 5M 3 2 1
d What is trigger? What are the differences between row level 5M 3 1 2
and statement level triggers? Explain how to implement
 triggers in SQL?
Write the need for schema refinement in relational
a database design. 2M 3 2 2

4 b Explain about multivalued dependency 3M 3 1 1

What are the problems caused by redundancy? Explain
c with example? What is the solution to the problems of 10M 3 2 2
redundancy? Explain
a Define Join dependency 2M 3 1 1
b Explain the properties of functional dependencies? 3M 3 2 2
5
What is normalization? Explain in detail about 1NF, 2NF
c 3NF and BCNF with suitable examples 10M 3 2 2

Explain the following terms:

i) Functional dependency.
a 2M 3 1 1
ii) Partial Functional Dependency
iii) Transitive Dependency.
How to compute closure of F the set of functional
6 b dependency? 3M 3 1 1

What is normalization? Explain 4NF and 5NF Normal forms

c with example 5M 3 1 2

What is decomposition? Explain the properties of

d decomposition? 5M 3 2 2

Define dependency preserving decomposition

a 2M 3 2 1

What is the difference between 3NF and BCNF

7 b 3M 3 2 1

What are the conditions are required for a relation to be in

c 4NF and 3NF explain with examples 10M 3 2 1

a Explain the following Operators in SQL with examples: 2M 3 2 2

i) SOME ii) NOT IN.

b Define loss less join decomposition with example 3M 3 1 1

8
When is a decomposition said to be dependency preserving?
c Why this property Useful? Explain. 5M 3 1 1

Define Functional dependencies and Multi valued

d dependencies. How are primary keys are related to FDs? 5M 3 1 1

Describe correlated sub queries.

9 a 2M 3 1 2
 b How can we identify that the relation is in 2NF? 3M 3 2 1

Consider the following relations

Suppier(Sid, Sname, Address)
Parts(Pid, Pname, Color)
c Catalog(Sid, Pid, Cost) 10M 3 3 6
Solve the following queries in SQL
i) Find the Snames of the suppliers who supply every part.
ii) For each part, find the Sname of the supplier who charges
the most for that part

a Describe NULL values 2M 3 2 2

What are the steps to be followed to convert a relation in 3NF

b to BCNF? 3M 3 1 1

Compute the closer of the following set of functional

10 dependencies for a relation scheme.
c 5M 3 3 3
R(A,B,C,D,E) F={AàBC, CDàE, BàD,EàA}
List out the candidate keys of R.
Compute the closer of the following set of functional
dependencies for a relation scheme.
d 5M 3 3 3
R(A,B,C,D,E,F,G,H), F={ ABàC, BDàEF, ADàG,AàH}
List the candidate keys of R.

UNIT-4
QNO Description of Question Mar Cou Progra BT
ks rse m L
outc Outco
ome me(PO
(CO )
)
 a What is transaction? Explain its states 2M 4 1 1
b What do you mean by serializability of a schedule? 3M 4 2 1
1 c Explain the ACID Properties of transactions. 5M 4 2 2
How to test serializability of a schedule? Explain with an
d example. 5M 4 3 3

a Explain about durability of transaction 2M 4 2 2

When are two schedules conflict equivalent? What is conflict
b 3M 4 2 2
2 serializable schedule?
c Explain two phase locking protocol 5M 4 2 1
d Explain multiple granularity concurrency control protocol 5M 4 1 2
a What is locking protocol? 2M 4 1 1
b Explain the concept of transaction atomicity. 3M 4 2 1
3
c Explain Time Stamp - Based Concurrency Control protocol 5M 4 2 3
d Explain about Validation-Based Protocol 5M 4 1 2
a What is multiple granularity locking? 2M 4 1 1
What are the different types of log records and when they are
b written? 3M 4 2 2
4
Discuss about log based recovery with immediate update
c 10M 4 2 3
and deferred update with suitable examples
Discuss about recoverable schedules and cascadeless
a 2M 4 1 2
schedules.
b What is view serializability 3M 4 3 2
5 Explain shadow paging recovery scheme for recovering the
c 5M 4 3 2
data base?
What is log? What is log tail? Discuss different types of log
d 5M 4 1 1
records
a Write about Thomas’ Write Rule 2M 4 2 1
b Explain the recovery with concurrent transactions 3M 4 2 1
6
Explain the Check point log based recovery scheme for
c 10M 4 2 2
recovering the data base
a What is multiple granularity locking? 2M 4 1 1
b What is locking Protocol? 3M 4 1 1
7
c What is transaction? Explain the properties of transaction. 5M 4 2 2
d Explain rigorous 2PL protocol 5M 4 2 2
a 2M 4 1 1
Why is recoverability of schedules desirable?

8 b When are two schedules conflict equivalent? What is conflict 3M 4 2 1

serializable schedule?
Discuss two phase locking protocol. Explain all its variants
c 10M 4 2 3
with necessary schedules.
9 a What is meant by atomicity? 2M 4 1 1
b Illustrate concurrent execution of transactions with 3M 4 2 2
examples
 What is locking Protocol?Describe the strict two phase locking
c 10M 4 1 1
protocol
a Describe intention locks 2M 4 2 2
10 b Explain implementation of atomicity and durability? 3M 4 2 3
c Dscribe about transaction recovery techniques 10M 4 2 2

UNIT-5
QNO Description of Question Mar Cou Progr BTL
ks rse am
outc Outco
ome me(P
(CO O)
)
a What is primary and secondary indexing? 2M 5 2 1
1 What is the difference between dense index and sparse
b 3M 5 2 1
index
c List and explain various file organization methods 10M 5 1 1
a What is meant by linear hashing? 2M 5 2 1
b What is an index on a file of records? Why is it needed? 3M 5 1 1
2
Explain about Static Hashing and Extendable Hashing with
c 10M 5 2 2
examples
a What is difference between Indexing and hashing? 2M 5 1 1
b What are the features of B+ trees? 3M 5 2 2
3
Explain deletion and insertion operation in B+ trees with
c 10M 5 1 2
example?
What is the main difference between ISAM and B+ tree
a 2M 5 1 1
indexes?
Demonstrate with an example insertion operation in B+ tree
4 b 3M 5 2 2
for the values 8, 11, 2, 6, 18, 22, 17.
Explain Deletion and insertion operations in ISAM with
c 10M 5 3 2
example.
a Explain about cluster index 2M 5 4 2
b What is the order of B+ tree? 3M 5 2 1
5
Explain deletion and insertion operations in linear hashing
c 10M 5 1 2
with examples.
a What is Static Hashing 2M 5 1 1
Construct a B+ tree to insert the following key elements
b 3M 5 2 6
6 (order of the tree is 4) 1,4,7,10,17,21,31,25,19,20,28,42
Compare and contrast Hash based indexing and tree based
c 10M 5 1 2
indexing
 a What is hashing? 2M 5 1 1
b Describe examples of B+ trees. 3M 5 2 2
Explain about cluster index, primary and secondary indexes
7 c 5M 5 1 2
with examples
d 5M 5 1 2
Explain Indexed Sequential Access Method.
Why are tree structure indexes are good for searches,
a 2M 5 1 1
especially range selections
What are the main difference between static and dynamic
8 b 3M 5 1 1
index structure?
c Explain static hashing. 5M 5 2 2
d Explain Extendible hashing. 5M 5 2 2
a What is Indexing and Hashing? 2M 5 1 1
What is the main difference between static and dynamic
9 b 3M 5 1 1
hashing?
c Draw the structure of B+ tree. Explain its operations. 10M 5 2 3
a What is local depth? 2M 5 1 1
b Differentiate clustered and un-clustered index 3M 5 2 4
10
What is Hashing? Discuss the relation between extendable
c 10M 5 1 1
hashing and Linear Hashing. What are their relative merits?

UNIT-1
 Objective Questions
1. _____ is a collection of interrelated data and a set of programs to access those data. [ ]
A).Data B).Data set C).Database D).DBMS

2. A _________ is a language that enables users to access or manipulate data as organized by the
appropriate data model. [ ]
A).DDL B).DML C).DCL D). TCL

3. A recursive relationship is a relationship between an entity and ______ [ ]

A)itself B) a subtype entity C)Instance D)Attribute

4. Which of the following is not a level of data abstraction? [ ]

A) Physical Level B) Critical Level C) Logical Level D) View Level

5.Snapshot of the data in the database at a given instant of time is called___ [ ]

A) Database Schema B) Database Instance C) Database Snapshot D)None

6.Which of the following indicates the maximum number of entities that can be involved in a
relationship? [ ]
A) Minimum cardinality B) Maximum cardinality C) ERD D) Greater Entity Count

7.A primary key should be defined as: [ ]

A)NULL B)UNIQUE &NOT NULL C)UNIQUE D)None

8. There are _________ levels of data abstraction [ ]

A) two levels B) four levels C) three levels D) one level

9. In a Hierarchical model records are organized as [ ]

A) Graph B)Lists C) Links D) Tree

10. ____________ means to hide certain details of how data is stored and maintain. [ ]
A) Data Abstraction B) Data Integrity C) Data Isolation D)All

Fill in the blanks

11.___________ is lowest level of abstraction

12. "What data is stored ?" is described by __________ level of abstraction in DBMS
13.______________ express the number of entities to which another entity can be associated via
a relationship set.
14.Ability to modify schema of database in one level without affecting the schema definition in
higher level is called as __________.
15. An ________ is a set of entities of the same type that share the same properties, or attributes.
16The total participation by entities is represented in E-R diagram as ______________
17 The entity set person is classified as student and employee. This process is called _______
18. An entity set that does not have sufficient attributes to form a primary key is a _________ entity
set.
19. DDL statements are compiled, resulting in a set of tables stored in a special file called
a________________.
20. An entity in A is associated with at most one entity in B, and an entity in B is associated with
at most one entity in A.This is called as ___________

Unit-1 Key:
1. D 11. Physical Level
2. B 12. Logical
3. A 13. Mapping Cardinality
4. B 14. database independence
5. B 15. Entity set
6. B 16. Double line
7. B 17. Specialization
8. C 18. Weak
9. D 19. data dictionary
10. A 20. One to one

UNIT-2
 Objective Questions

1. What is a view? [ ]
a) A view is a special stored procedure executed when certain event occurs
b) A view is a virtual table which results of executing a pre-compiled query
c) A view is a database diagram
d) None of the Mentioned

2. Which of the following is not a DDL command? [ ]

a) UPDATE b) TRUNCATE c) ALTER d) DROP

3. Which of the following are TCL commands? [ ]

a) UPDATE and TRUNCATE b) SELECT and INSERT
c) GRANT and REVOKE d) ROLLBACK and SAVEPOINT

4. What is the purpose of the SQL AS clause? [ ]

a) The AS SQL clause is used to change the name of a column in the result set or to assign a
name to a derived column
b) The AS clause is used with the JOIN clause only
c) The AS clause defines a search condition
d) All of the mentioned

5. With SQL, how do you select all the records from a table named “Persons” where the value of
the column “FirstName” ends with an “a”? [ ]
a) SELECT * FROM Persons WHERE FirstName=’a’
b) SELECT * FROM Persons WHERE FirstName LIKE ‘a%’
c) SELECT * FROM Persons WHERE FirstName LIKE ‘%a’
d) SELECT * FROM Persons WHERE FirstName=’%a%’

6. With SQL, how can you return all the records from a table named “Persons” sorted descending
by “FirstName”? [ ]
a) SELECT * FROM Persons SORT BY ‘FirstName’ DESC
b) SELECT * FROM Persons ORDER FirstName DESC
c) SELECT * FROM Persons SORT ‘FirstName’ DESC
d) SELECT * FROM Persons ORDER BY FirstName DESC

7. The UPDATE SQL clause can _____________ [ ]

a) update only one row at a time
b) update more than one row at a time
c) delete more than one row at a time
d) delete only one row at a time
8. Which of the following command makes the updates performed by the transaction permanent
in the database? [ ]
a) ROLLBACKb) COMMIT c) TRUNCATE d) DELETE

9. Inorder to ensure that the value of budget is non-negative which of the following should be
used?
a) Check(budget>0)
b) Check(budget<0)
c) Alter(budget>0)
d) Alter(budget<0)

10 Which one of the following uniquely identifies the elements in the relation? [ ]
a) Secondary Key b) Primary key c) Foreign key d) Composite key

11. Which of the following operation is used for retrieving certain columns of a table?

[ ]

a)JOIN b)SELECTION c)PROJECTION d)UNION

Fill in the blanks

12. In Relational model, data and relationships are represented as a collection of ________.
13. .___________ key is used to represent relationship between tables.
14. The degree of the relation is also called as __________.
15. In relational algebra cross product is also called as _____________.
16. The operator that is used for pattern matching in SQL is _________.
17. The SQL statement that is used to delete a particular column in a relation/table is _______.
18. Using the select operation, you can select ___ that satisfy certain criteria.
19. A list of the attributes we wish to appear in the result is displayed in ___ operation.
20. If there are 2 types of tuples, A & B, the ___ operation contains all the tuples that are either
in A or B or both in A & B.
21.The Tuple Relational calculus is a _______________________Query Language.
Unit-2 Key:
1. B 11. C
2. A 12. inter-related tables
3. D 13. Foreign
4. A 14. Arity
5. C 15. Cartesian Product
6. D 16. LIKE
7. B 17. Alter
8. B 18. Tuples
9. A 19. Project
10. B 20. A U B
 21. Non Procedural

UNIT-3
1.Tables in second normal form (2NF): [ ]
a) Eliminate the possibility of a insertion anomalies b) Have a composite key
c)Eliminate all partial dependencies d) Have all non-key fields depend on the whole primary
key

2.Which forms simplifies and ensures that there is minimal data aggregates and repetitive [ ]
groups:
a)2 NF b)3 NF c) 1 NF d)1,2 and 3 NF

3. Which forms are based on the concept of functional dependency [ ]

a) 2 NF B)3 NF c)1 NF d)1,2 and 3 NF

4.Consider money is transferred from (1) Account-A to Account-B and (2)Account-B to

Account-A. Which of the following form a transaction? [ ]
a)Only 2 b) Both 1 and 2 individually c)Only 1 d) Either 1 or 2

5. The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into

employee1 (ID, name)
employee2 (name, street, city, salary) [ ]
This type of decomposition is called
a) Lossy-join decomposition b) Lossless-join decomposition
c) All of the mentioned d) None of the mentioned

6. Which operator is used to compare a value to a specified list of values? [ ]

a)ANY b) BETWEEN c) ALL d)IN

7. If we have not specified ASC or DESC after a SQL ORDER BY clause, the following is used
by default [ ]
a)DESC b)ASC c)There is no default value d)None of the mentioned

8. Which of the following is true about the HAVING clause? [ ]

a)Similar to the WHERE clause but is used for columns rather than groups.
b)Similar to WHERE clause but is used for rows rather than columns.
c)Similar to WHERE clause but is used for groups rather than rows.
d)Acts exactly like a WHERE clause.

9. Which of the following is the correct order of a SQL statement? [ ]

a)SELECT, GROUP BY, WHERE, HAVING b)SELECT, WHERE, GROUP BY, HAVING
c)SELECT, HAVING, WHERE, GROUP BY d)SELECT, WHERE, HAVING, GROUP BY
10.Which operator is used to compare the NULL values in SQL? [ ]
a)Equal b)IN c)IS d)None of Above

11.The domain of attribute must include only atomic (simple, indivisible) values is called_____
12.A relation schema R is in ____ if it is in 1NF and every non-prime attribute A in R is fully
functionally dependent on primary key.
13._____ is based on the concept of transitive dependent.
14.If every non-prime attribute A in R is fully functionally dependent on the primary key
attribute of R,then R is said to be in ______
15.In __________ normal form, a composite attribute is converted to individual attributes.
16. ________________occurs when one copy of repeated data is updated, an inconsistency is
created unless all copies are similarly updated.
17. An_______________ is a predicate expressing a condition that we wish the database always
to satisfy.
18. A table is in 3NF if it is in 2NF and if it has no ______ dependencies
19. _______________ operator tests column for absence of data
20. ______________________aggregate function is used to retrieve minimum value.

Unit-3 Key:
1. C 11. 1 NF
2. B 12. 2 NF
3. D 13. 3 NF
4. B 14. 2 NF
5. A 15. 1 NF
6. D 16. Data redundancy
7. B 17. Assertion
8. C 18. transitive
9. B 19. IS NULL
10. C 20. MIN
 UNIT-4

Multiple choice questions:

1.Identify the characteristics of transactions [ ]
a) Durability b)Flexibility c) Robustness d) Scalabitity

2.In order to maintain transactional integrity and database consistency, what technology does a
DBMS deploy? [ ]

a) Pointers b) Locks c)Triggers d)Cursors

3.Collections of operations that form a single logical unit of work is called a [ ]

a)Concurrency b)Check pointing c) Crash Recovery d)Transaction

4. All locks held by a transaction are released when the transaction is [ ]

a) Completed b)Blocked C)Terminated d) Stopped

5.If the access is read only then the following commands are not to be executed [ ]
a) Insert, Update &Delete b) Insert c)Update d)Delete
6. If we need to update the objects we must first upgrade to an [ ]
a) Exceptional b) Shared locks c) Exclusive d) Request lock
7. Any changes that the aborted transaction made to the database must be undone is_____[ ]
a) Commit b) Partial Commit c) Transaction rollback d) Failure
8. In a granularity hierarchy the highest level represents the [ ]
a) Entire database b) Area c) File d) Record
9 ____denotes the largest timestamp of any transaction that executed write(Q) successfully.[ ]
a) W-timestamp(Q) b) R-timestamp(Q) c) RW-timestamp(Q) d) WR-timestamp(Q)
10. The ____ requires that each transaction Ti executes in two or three different phases in its
lifetime, depending on whether it is a read-only or an update transaction. [ ]
a) Validation protocol b) Validation-based protocol
c) Timestamp protocol d) Timestamp-ordering protocol
Fill in the blanks:

11.The ____is the average time for a transaction to be completed after it has been submitted.
12.The two types of serializability are _____ and _____
13. _____is the most common used to implement the requirement is to allow a transaction to access a data item
only if it is currently holding a lock on that item.
14. The modes of lock are _____and ____
15. ______phase is a transaction that obtains locks but does not release any lock.
16. ______phase is a transaction that releases locks but may not obtain any new locks.
17. _____is a mechanism for conversion from shared lock to exclusive lock
18. _____ is a mechanism for conversion from exclusive lock to shared lock
19. _________ states that only valid data will be written to the database.
20. __________means that the data used during the execution of a transaction cannot be used
by a second transaction until the first one is completed.
Unit-4 Key:
1. A 11. Average Response Time
2. B 12. Conflict serializability and View
3. D serializability
4. A 13. Shared Lock
5. A 14. Shared& Exclusive
6. C 15. Growing
7. C 16. Shrinking
8. A 17. Upgrade
9. A 18. Degrade
10. A 19. Consistency
20. Isolation
 UNIT-5
1. Who can take steps to tune recover subsystems [ ]
a) Client b) DBA c) System Analyst d) Application programmer

2. In B+ tree search begins at [ ]

a) Leaf b)Middle c) Root d)Sibling

3.The unit of information read from or write to disk is called [ ]

a) Page b) Sector c) File d)Record

4.Which function is an important component of hashing approach [ ]

a) Hash b) Character c) Mapping d)Aggregate

5.The height of the B+ tree with only leaf level and a single index level is [ ]
a)4 b)2 c)1 d)3

6. Which one of the following is a failure to system [ ]

a)Read failure b)Transaction failure C) Boot crash d) All of the mentioned

7. Hierarchical model is also called [ ]

a) Plex Structure b) Normalize Structure c) Tree structure d) Table Structure

8.The file organization that provides very fast access to any arbitrary record of a file is [ ]
a)Unordered file b)Hashed file c)Ordered file d)B-tree

9. An index helps to speed up? [ ]

a). SELECT queries b) WHERE clauses c) Both A and B d) UPDATE Query

10.The physical location of a record is determined by a mathematical formula that transforms [ ]

a file key into a record location is :

a)Heap File b)Hashed File c)Indexed File d)Sequential File

Fill in the blanks:

11.A lock that allows concurrent transactions to access different rows of the same table is known as
a_____
12.A file organization in which the data records are ordered in same way as data entries in index is
called _______
13.A file organization in which the data records are ordered in different way as data entries in index is
called _______
14.A ______ is an index on a set of files which includes the primary key
15.An index that is not a primary key index is called a _______
16.______ is simplest file organization and stores the files in the order they arrive
17.______ is simplest file organization and stores the files in the order they arrive
18.______ are not organized sequentially, instead they are arranged randomly
19.______ enhance the performance of DBMS
20.Unit of information being transferred between main memory and a disk is called _____

Unit-5 Key:
1. B
2. C
3. A
4. A
5. C
6. B
7. C
8. B
9. C
10. B
11. Row level Lock
12. Clustered
13. Un-clustered
14. Primary index
15. Secondary index
16. Heap file
17. Unordered file
18. Hash file
19. Indexes
20. Page

SUBJECT: DATABASE MANAGEMENT

SYSTEMS

37
38
PREVIOUS YEAR UNIVERSITY QUESTION
PAPER

39