DISTRIBUTED DATABASE ( SEMESTER - 7 )

CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)

1. ………………………………
Signature of Invigilator

2. ……………………………… Reg. No.

Signature of the Officer-in-Charge

Roll No. of the

Candidate

– – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – –
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
ENGINEERING & MANAGEMENT EXAMINATIONS, DECEMBER – 2007
DISTRIBUTED DATABASE ( SEMESTER - 7 )
Time : 3 Hours ] [ Full Marks : 70

INSTRUCTIONS TO THE CANDIDATES :

1. This Booklet is a Question-cum-Answer Booklet. The Booklet consists of 32 pages. First
page of the Booklet shows Instructions to the Candidates. The questions of this concerned
subject commence from Page No. 3.
2. a) In Group – A, Questions are of Multiple Choice type. You have to write the correct choice
in the box provided against each question.
b) For Groups – B & C you have to answer the questions in the space provided marked
‘Answer Sheet’. Questions of Group – B are Short answer type. Questions of Group – C are
Long answer type. Write on both sides of the paper.
3. Fill in your Roll No. in the box provided as in your Admit Card before answering the questions.
4. Read the instructions given inside carefully before answering.
5. You should not forget to write the corresponding question numbers while answering.
6. Do not write your name or put any special mark in the booklet that may disclose your identity,
which will render you liable to disqualification. Any candidate found copying will be subject to
Disciplinary Action under the relevant rules.
7. Use of Mobile Phone, Calculator or Log table is totally prohibited in the examination hall.
8. You should return the booklet to the invigilator at the end of the examination and should not
take any page of this booklet with you outside the examination hall, which will lead to
disqualification.
9. Rough work, if necessary is to be done in this booklet only and cross it through.
No additional sheets are to be used and no loose paper will be provided
FOR OFFICE USE / EVALUATION ONLY
Marks Obtained
Group – A Group – B Group – C
Question Total Examiner's
Number Marks Signature
Marks
Obtained

…………………………………………………………
Head-Examiner/Co-Ordinator/Scrutineer

 8001 
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
2

E
P AG
IS
TH
N
O
E
IT
R
W
T
O
N
O
D

 8001 
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
3
ENGINEERING & MANAGEMENT EXAMINATIONS, DECEMBER – 2007
DISTRIBUTED DATABASE
SEMESTER – 7

Time : 3 Hours ] [ Full Marks : 70

GROUP – A

( Multiple Choice Type Questions )

1. Choose the correct alternatives for the following : 10 × 1 = 10

i) Autonomy refers to the distribution of

a) data b) control

c) function d) none of these.         

ii) The global query optimizer and decomposer are used to

a) check user query process

b) minimize execution strategy of cost function

c) interpret user command

d) distribute execution of the user request.         

iii) The local query optimizer acts as

a) access path selector

b) to manage local database remain constant

c) interpret user command

d) none of these.         

iv) Distributed database is basically placement of

a) data and function b) program and control

c) data and program d) data and control.         

 8001 
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
4
v) Which of the following rules must be followed when defining fragments ?

a) Completeness condition b) Reconstruction condition

c) Disjointness condition d) All of these.         

vi) Processing locality conflicts with

a) availability and reliability of distributed data

b) workload distribution

c) storage cost and availability

d) none of these.         

vii) Local mapping schema depends on the

a) global relations b) fragments

c) type of the local DBMS d) none of these.         

viii) A multiprocessor system where two or more processors share the same primary

memory is called

a) homogeneous system b) loosely coupled system

c) tightly coupled system d) none of these.         

ix) Which of the following is the recovery management technique in case of

distributed system ?

a) Deferred update b) Immediate update

c) Two-phase commit d) None of these.         

x) The simplest way to reconstruct a global consistent state in a distributed

database is to use

a) local dumps b) local logs

c) global checkpoints d) all of these.         

 8001 
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
5
GROUP – B

( Short Answer Type Questions )

Answer any three of the following. 3 × 5 = 15

2. What do you mean by distributed database ? What is fragmentation ? Explain.

1+2+2

3. What do you mean by reference architecture ? Explain client server model and peer to
peer model. 1+2+2

4. What are local, global and external schema ? What is multidatabase system ? 3+2

5. Explain 3-phase commitment protocol. Why is it called non-blocking ? 3+2

6. Explain quorum based protocol. 5

GROUP – C
( Long Answer Type Questions )
Answer any three of the following questions. 3 × 15 = 45

7. What is deadlock ? Write the deadlock prevention method. How will you avoid
deadlock ? How will you detect deadlock and what is its resolution ? What is
distributed DBMS reliability ? 2+2+3+3+2+3

8. What is concurrency control ? What is lock based protocol ? Explain. What is

validation based protocol ? Write insert and delete operations. What is coalescence ?

1+3+4+(2+2)+3

9. a) What do you mean by local mapping transparency and replication transparency ?

b) Consider the following global, fragmentation, and allocation schemata :

Clobal Schema : STUDENT ( ROLL, NAME, DEPT )

Fragmentation Schema : STUDENT 1 = SL DEPT = “IT” STUDENT

STUDENT 2 = SL DEPT = “CS” STUDENT

Allocation Schema : STUDENT 1 at sites 1, 2

STUDENT 2 at sites 3, 4

[ Assume that “IT” and “CS” are the only possible values for DEPT attribute ]

 8001 
CS/B.TECH (CSE)/SEM-7/CS-704A/07/(08)
6
i) Write an application that requires the roll number of a student from the
terminal and outputs the name and department, at levels 1, 2, and 3 of
transparency.

ii) Write an application that moves the student having roll number 432 from
department “IT” to department “CS”, at levels 1, 2, and 3 of transparency.

3 + 12

10. a) What is Mixed Fragmentation ? Explain with an example.

b) Consider the following global, fragmentation, and allocation schemata :

Global Schema : SUPPLIER ( SNO, NAME, CITY )

SUPPLY ( SNO, PNO, DEPTNO, QTY )

Fragmentation Schema : SUPPLIER 1 = SL CITY = “KOLKATA” SUPPLIER

SUPPLIER 2 = SL DEPT = “DELHI” SUPPLIER

[ Assume that “KOLKATA” and “DELHI” are the only possible values for CITY
attribute ]
SUPPLY 1 = SUPPLY S J SNO = SNO SUPPLIER 1

SUPPLY 2 = SUPPLY S J SNO = SNO SUPPLIER 2

Allocation Schema : SUPPLIER 1 at site 1, SUPPLIER 2 at site 2

SUPPLY 1 at site 3, SUPPLY 2 at site 4.

Write an application that retrieves the names of the suppliers who supplies a
given part ; the part number is read from the terminal by the user who requests
the application. 5 + 10

11. Write short notes on any three of the following : 3×5

a) Transparency in distributed database

b) Network partitioning

c) Primary copy locking

d) ODBC connnectivity

e) Distributed 2-phase locking protocol.

END

 8001