DBMS Question Bank

(CSE,IT,AIML,DS,AIDS)
UNIT-1
QNO Description of Question Mark CO BTL
s PO

a Define DBMS. What are the goals of DBMS? 2M 1 1 1

b Describe the three levels of abstraction with an example 3M 1 2 2
1
c Distinguish between file processing system and DBMS? 5M 1 2 2
d Explain the applications of DBMS 5M 1 3 2
Distinguish between relation schema and relation
a 2M 1 2 2
instance?
2 b Outline different types of Data Independence 3M 1 1 2
Define data model? Explain the different types of data
c 10M 1 3 2
models?
a List out various DDL commands 2M 1 1 1
3 b Define DBMS. Outline the advantages of DBMS? 3M 1 2 2
Explain the architecture of Database Management
c 10M 1 1 2
Systems with neat diagram
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?
Explain about different types of database users? What are
c 5M 1 2 2
4 the responsibilities of a 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 List and explain various types of participation constraints 2M 1 3 2
b Explain the steps involved in database design process 3M 1 2 2
What is an E-R model? Construct an E-R Diagram for a
5 c 5M 1 1 6
Banking enterprise system.
Differentiate between an Entity set and Relationship set.
d 5M 1 2 2
List and explain the symbols used to draw ER Diagram
Compare between super key, Candidate key, Primary Key
a 2M 1 3 4
for a relation with examples.
b Explain about mapping cardinalities 3M 1 2 2
6
Describe additional features of ER model with examples. 2
c 10M 1 1
a List out various types of attributes in ER Model 2M 1 2 1
b Outline the history of DBMS 3M 1 1 1
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 Classify DDL and DML commands 2M 1 1 2
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
Identify the main components in a DBMS and briefly
d 5M 1 2 2
explain its functionalities?
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 2
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 2
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 Define relation relation schema? 2M 2 2 1

Identify SQL statements used to perform alter and update
1 b 3M 2 1 1
the table contents?
Define an integrity constraint? Discuss the different types
c 10M 2 2 2
of integrity constraints over relations with examples?
Identify the SQL statements used to retrieve and modify
a 2M 2 1 2
the database?
2 b Demonstrate altering of tables and views 3M 2 1 2
Explain the fundamental operations in relational algebra
c 10M 2 2 2
with examples.
Define the terms Arity/ degree and Cardinality of a
a 2M 2 1 1
Relation

b 3M 2 2 3
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, foreign key and
a 2M 2 2 1
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
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?
5
c Explain about domain relational calculus with example 5M 2 2 2
Explain about Tuple relational calculus with example 2
d 5M 2 1
a Discuss the functionality of query evaluation engine. 2M 2 4 2
When are integrity constraints enforced by a DBMS?
b 3M 2 1 2
What is referential integrity?Explain with examples.
6
c Explain about outer join operation in relational algebra 5M 2 2 2
Explain modification of the database operations in
d 5M 2 2 2
relational algebra with example
7 a Define Generalized projection in Relational Algebra 2M 2 1 1
b Describe aggregate operation in relational algebra 3M 2 2 4
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)
a Define check constraints with example 2M 2 1 1
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)).
Is“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 2
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
model? How do they effect the meaning of queries? Can
c primary key fields of table contain null values? 10M 2 1 3
UNIT-3
QNO Description of Question Mar Cou Progr BTL
ks rse am
outc Outco
ome me(P
(CO O)
)
Define an assertion in SQL?
a 2M 3 2 1

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

b SQL? 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

Describe various set operations are used in SQL with

d examples 5M 3 4 2

a Deifine NULL values? Can primary key fields of table contain 2M 3 1 1

null values?

b Define foreign key with syntax 3M 3 2 1

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

d Define nested query? Discuss a correlated nested query with 5M 3 2 2

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

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

3
c Describe the complex integrity constants in SQL? 5M 3 2 2
Define trigger? Explain the differences between row level and
d statement level triggers? How to implement triggers in SQL? 5M 3 1 3

What is the need of schema refinement in relational

a database design. 2M 3 2 2

4 b Outline the purposeof multi-valued dependency 3M 3 1 1

Identify the problems caused by redundancy? Explain with
c example? What is the solution to the problems of 10M 3 2 4
redundancy? Explain
a Define Join dependency 2M 3 1 1
5
b Outline the properties of functional dependencies? 3M 3 2 2
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 2
ii) Partial Functional Dependency
iii) Transitive Dependency.
How to compute closure of F the set of functional
b dependency? 3M 3 1 2
6
What is normalization? Explain 4NF and 5NF Normal
c forms 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

Distinguish between 3NF and BCNF

7 b 3M 3 2 4

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

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

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 2

Define Functional dependencies and Multi valued

d dependencies. How are primary keys are related to FDs? 5M 3 1 2
Define correlated sub queries.
a 2M 3 1 1

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

Consider the following relations

9
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 Discuss about NOT NULL values with example 2M 3 2 2
List out 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 Define transaction? Explain its states 2M 4 1 2
b What do you mean by serializability of a schedule? 3M 4 2 1
1 c Explain the ACID Properties of transaction. 5M 4 2 2
How to test serializability of a schedule? Explain with an
d example. 5M 4 3 3

2 a Explain about durability of transaction 2M 4 2 2

b When are two schedules conflict equivalent? What is conflict 3M 4 2 2
serializable schedule?
c Explain two phase locking protocol 5M 4 2 2
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 2
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
List out the different types of log records and when they are
b written? 3M 4 2 1
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 Define view serializability 3M 4 3 2
5 Explain shadow paging recovery scheme for recovering the
c 5M 4 3 2
data base?
Define log? What is log tail? Discuss different types of log
d 5M 4 1 2
records
a Outline Thomas’ Write Rule 2M 4 2 1
b Explain the recovery with concurrent transactions 3M 4 2 2
6
Explain the Check point log based recovery scheme for
c 10M 4 5 2
recovering the data base
In multiple-granularity locking, what is the difference between
a implicit and explicit locking? 2M 4 1 1
7 b What is locking Protocol? 3M 4 1 1
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?
Explain the distinction between the terms serial schedule and
8 b serializable schedule 3M 4 2 1

Discuss two phase locking protocol. Explain all its variants

c 10M 4 2 3
with necessary schedules.
a Define atomicity property of transaction? 2M 4 1 1
Illustrate concurrent execution of transactions with
b 3M 4 2 2
9 examples
Discuss locking Protocol? Describe the strict two phase
c 10M 4 1 2
locking protocol
a List out intention locks 2M 4 2 1
10 b Explain implementation of atomicity and durability? 3M 4 2 2
c Describe 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 Differentiate between dense index and sparse index
b 3M 5 2 2
c List and explain various file organization methods 10M 5 1 2
a What is meant by linear hashing? 2M 5 2 1
What is an index on a file of records? Why it is needed?
2 b 3M 5 1
2
Explain about Static Hashing and Extendable Hashing with
c 10M 5 2 2
examples
a Distinguish between Indexing and hashing? 2M 5 1 2
b List out 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?
a Differentiate between ISAM and B+ tree indexes? 2M 5 1 4
Demonstrate with an example insertion operation in B+ tree for
b 3M 5 2 2
4 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 Define 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 4
indexing
a Define hashing? 2M 5 1 1
b Describe examples of B+ trees. 3M 5 2 2
7 Explain about cluster index, primary and secondary indexes
c 5M 5 1 2
with examples
d Explain Indexed Sequential Access Method. 5M 5 1 2
8 a Why tree structure indexes are good for searches, especially 2M 5 1 1
range selections
b Compare static and dynamic index structure? 3M 5 1 2
c Explain static hashing. 5M 5 2 2
d Explain Extendible hashing. 5M 5 2 2
What is the difference between a clustering index and a secondary
a index? 2M 5 1 1
9 What is the main difference between static and dynamic
b 3M 5 1 2
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 2
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) GraphB)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)

10Which 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 12. inter-related tables
2. A 13. Foreign
3. D 14. Arity
4. A 15. Cartesian Product
5. C 16. LIKE
6. D 17. Alter
7. B 18. Tuples
8. B 19. Project
9. A 20. A U B
10. B 21. Non Procedural
11. C

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
functionallydependent 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 protocold) 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 8. A
2. B 9. A
3. D 10. A
4. A
5. A 11. Average Response Time
6. C 12. Conflict serializability and View
7. C serializability
13. Shared Lock 17. Upgrade
14. Shared& Exclusive 18. Degrade
15. Growing 19. Consistency
16. Shrinking 20. Isolation

UNIT-5
1. Who can take steps to tune recover subsystems [ ]
a) Clientb) DBAc) System Analystd) 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 failureC) Boot crash d) All of the mentioned

7. Hierarchical model is also called [ ]

a) Plex Structureb) Normalize Structurec) 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 clausesc) Both A and Bd) 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