Silicon Institute of Technology

Silicon Hills, Bhubaneswar

| An Autonomous Institute |

4th Semester B.Tech. End Term Examination 2019-2020

DATABASE MANAGEMENT SYSTEMS(18CS1T02)
Duration: 03:00 Full Marks: 60

1 Answer any Ten

a Differentiate between disjoint and overlapping constraint in a generalization.
2
b Define value set?
2
c We can apply union operation between two relations only if they are compatible. What do
2
you mean by compatibility?
d What are the necessary conditions for performing set theory operations (like union,
2
intersection and set difference) between two relation schemas in relational algebra?
e What do you mean by Attribute preservation property?
2
f Define super key of a relation.
2
g What is a trivial join dependency?
2
h Why is indexing required? Give the structure of an index used in database.
2
i Define pipelining in the context of query evaluation?
2
j How a query tree is different from a query graph?
2
k What are the uses of system logs? What are the different kinds of records stored in them?
2
l How is a redo(T ) operation different from undo (T ) operation?
i i 2
m What is a serial schedule? Give an example of a serial schedule.
2
n What are the main advantages of distributed databases?
2
o What are the advantages and limitations of data replication in a distributed database system?
2
2 Answer any Five
a In the context of ER Model, what is mapping cardinality? Describe the various possible
4
mapping cardinalities with suitable diagram.
b Differentiate between cartesian product, equijoin, natural join and theta join with suitable
4
examples.
c Define First normal form. What are the things not allowed in 1NF? Show atleast two cases
4
where a relation R is not considered to be in 1NF and is ultimately converted to their
equivalent 1NF.
d What is the use of multi-level indexing? Explain with a suitable example.
4
e Construct a B-tree for the following set of key values :
4
3 , 4 , 6 , 8 , 12 , 17 , 20 , 23 , 30 , 35
Assume that the tree is initially empty. Construct the B-tree when the order of the tree is
given as : (i) three (ii) five
f Explain shadow paging technique to recover data from failure.
4
g What are the different constraints that can be imposed on a generalization or specialization?
4
 h What do you understand from I/O parallelism? What are the basic data partitioning strategies 4
used to partition data across different available disks?
3 Answer any Two
a Draw the system architecture of a data base management system. Discuss each components
10
present there in details.
b Given the following relation schemas :
10
SALES_PERSON (SpID, SName, Phone, Address)
CAR (SerialNo, Model, Manufacturer, Price)
SALES (SpID, SerialNo, Date_sale, No_sale)
Write the Relational algebraic expression for the following queries:
a) Find the name of the sales persons who sales the cars with price range between 20,000 to
40,0000.
b) Find the maximum and minimum price of car of each manufacturer.
c) Retrieve the serial number and price of the car those are sold by the sales person living in
Bhubaneswar?
d) Name the sales persons who live in the same city where ‘JOHN’ lives?
c What properties should a normalization obey?
10
Explain each of the properties in detail.
d Insert the following keys to a 5-way B-tree: (Order-5)
10
3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35, 56
e Discuss the approaches followed by both deferred database modification and immediate
10
database modification for recovering data in case of failure.
f What are the different ways in which data can be stored at different sites in a distributed
10
database system? Explain each type with suitable examples.