QUESTION 2014

Group- A
(Multiple Choice Type
AnSwer all questions
Questions)
Answ d databa
A distributed
database has which of the
a) software cost
following advantages over a ce
c) slow response centralized database?
b) software complexity
d) modular growth
n) An auto omous homogenous
the same DBMS is at each
a ) the same environment is which of the
same DBMS is at each
b) the :
node and each
DBMS works
following?
Aiferent DBMS is
c)a c
node and
central DBMS a independently
at each node and each coordinates
database access
d) a different D
DBMS is at each node DBMS works
and a central independently
DBMS coordinates
Atransact manager is whichof the
database access
a) maintains a log of transactions following?
b) maintains before and after database
c) maintains appropriate images
d) all of these
concurrency control

v Location transparency allows for which of

the following?
a)users to treat data as if it is at one
b)
location
programmers treat the data asif it is at one location
to
c) managers to treat the data as if it is at one location
d) all of these

WAheterogeneous distributed is which of the

a) the same DBMS is used at each following?
location and dataare not distributed across
b) the same DBMS is used at each all nodes
location and data are distributed across all
) a diferent DBMS is nodes
used at each location and data are not distributed
across all nodes
O) a different DBMS is
used at each at each location and data are
distributed across all
nodes
POPULARIPUBLICATIONS
transaction?

Whch of the following is tuve concerning a globald he distributed DBMS

and the distributed
local site
a Phe tequned data are at one
Outes reuert
necessary noniocal Site and t
0) the required data are
located in at least
oie
distributed DR
equests as necessary
local site
and the
distribuled
BMS passes the
DBMs

C) the required

the local DBMS

data are at one

nonlocal site
site and th
and
request
the
) the required data
are
located in at
least one
distribut
DBMS
the request to only
the local

is which of the following?

distributed
database
(Vn) A homogenous ata are not distributed
and data
each location across
a) the same DBMS is used at
location and data
da are distribut
all
is used at each across all
b) the same
DBMS
location and data are not distribitad. nodes
different DBMS is used at each across all nodes
c) a
data are distribute.d
at each location and acro.

d) a different DBMS is used all nodes

should be used when which of

the following exist?
(vi) Replication
a) when transmission speeds and capacity in a network prohibit freauent rod.
tables
refreshing of a
b) when using many nodes with different operating systems and DBMS and datah
c) the application's data can be somewhat out-of date
d) all of these

(Ix) Storing a separate copy of the database at multiple locations is which of the
followinn?
a) data replication b) horizontal partitioning
c) vertical partitioning
d) horizontal and vertical
partitioning
x) A semi join is which of the following?
a) only the joining attributes are sent from one site to
another and then all of the
returned rows

b) all of the attributes are sent from one site to another and then
returned only the required rows ae

C)only the joining attributes are sent from one site to another and then
rows are returned only the requied
d) all the
attributes are sent from one site to another and then
returned only the
require i

MCA DBM-94
POPULAR PUBLICATIONS

DISTRIBUTED
DATABASE ARCITTECT RE
See Topic:
Question No. 5.

9 a) What are horizontal, derived horizontai and vertical fragmen

tation?
b) Write the R algorithnm
a)See lopic: DISTRIBUTED DATABASE. ARCIHTTECTURE AN
ANDCTECTURE FEATU RE
Question No. 1.
h)See Topi: QUERY AND CONCURRENCY CONTROL, Lonu. (OL,Long Answer Typ
.Short nwer
10 a) What is query optimization?
Question Do.3,
b) Explain distributed cost model with an example
c) What do you mean by the cardinality of selection?
d) Explain centralized query optimization?
See Topic: QI ERY AND CONCURRENCY CONTROL, Long Answer Ts

11 Write the short notes any three No.S.

of the following:
a) ODBC connectivity
b) MDBS
c) Peer-to-peer architecture
d) Check point and cold start
e) Wait-Die and Wound-Wait
algorithm.
a) See Topic: ALTERNATIVE ARCHITECTURES,
b) See
Long Answer Type Question
Topic: ALTERNATIVE ARCHITECTURES, No. 2a
Long Answer Type
c) See Topic: ALTERNATIVE Question No.
d) See Topic: ARCHITECTU
DISTRIBUTED TRANSACTION
RES, Long Answer Type Question 2/b.
No.2(e
9e). MANAGEMIENT, Long Answer Type Ouestion
ion
e) See Topic:
DISTRIBUTED TRANSACTION
9h). MANAGEMENT, Long Answer Type
Questin

QUESTION 2015
Group A
(Multiple Choice Type Questions)
1 Answer all
i) An
questions
autonomous
homogeneous environment is which
a) The same DBMS Is of the
at each node following?
b) The same and each
DBMS works
) A different
DBMS is
at each
node and a independentuy
DBMS Is at each central DBMS coordinates dataoase access

d)Adiferent DBMS Is at each node and each DBMS works independenuy

node and a
central DBMS coordinates
aatuc
MCA DBM-96
 DISTRIBUTED DATABASEMANAGEMENI
t1gnmentationtransparency cannot be achieved without location
n

transparency
rue b) False
d) None of these
iANnvlanym e a n s

memory

S2e
of
b) size of data
)
OCAS

d) transaction
attrbutes violates which of the following conditions
a )Completeness
of
fragmentation?
b) struction
JDisjointness
d) Both (b) & (c)

phase
cCommitment

protocol is used for

fD
) concurrency control
b) integrity control
)recovery

d) redundancy

icity of
transaction demands
a) alithe transaction operations will be performed
p) none ofthe action's operations will be
state
performed
c) no stable

these
d) none of

A transaction manager is which of the following?

Maintains a log of transactions
) Maintains before and after database images
c) Maintains appropriate
concurrency control
o) All of these

Timestamp mechanism is used for

a concurrency control
b) integrity control
Crecovery
d) redundancy
wnich of the
following refers to the operation of copying and maintaining database
e databases object in
belonginy to a distributed,system
a Backup
b) Replication
CRecovery
d) None of these

MCA DBM-97
POPULAR PUBLICATIONs

archtecture
c) Peer to peer
start
d) Check pont and cold
distribuled concurrency controt
e) Quorum based protocol in
Lny
NDCONCURRENCY(ONTROL,.og,
alSre lopic: Q1 ERV A Ansner Type
Ansner.
estionJuent
No inn S
lIRNATIVE ARCITECTURES, I.ong
b See lopie:
LIERNATIVE ARCTTECTURES,I.og AnsWer f
See lopic:
uestion Nou
TED TRANSCTION MANAGENMENT
11NT, Long
dlSee lopie: DISTRN Answer Ie
e).
e)Sce lopie: QUERY AND CONC RRENCY (ONTROL, Lone A...
M
QUESTION 2016

GROUP-A
(Multíple Choice Type (Questions)

1 Choose the correct alternatives for any ten of the following

)What is data about datacalled?

a ) Metadata
b) Data catalog

c) Informaton
d) Database

u) Which of the following strategies is designed to ensure that either all the databases
uwtke
or none of them?
a ) Two-phase commit b) Two-phase locking
d 3PC
c) Two-phase update

aspects of a distributed database?

) Which of the following features(s) (are) important
is
b) Logical correlation
a) Distribution

c) Distribution & logical correlation d) Disjointness

two processors share the same primary memoy

V) A mult processor system where
or more

cailed
a) homogeneous
b) loosely cOupled
d) all of these
C) tightly couplea

v) Database profle includes

b) SIZe
a) carcinality

c) distinct values d) all of these

MCA DBM-100

wwwww.w
 DISTRIBUTED DATABASE MANAGEMENI1
R:4N implies

P,R:4

a,R:AOR 4
b)
PR:A AND 4»
d)|PJ, qr:R
v)Local
apping schema.depen on the
a) global relations

the local DBMS b) fragments

c) type of
d) location
vu)Processing locality conflicts with
) availability
and
reliability of distribut data b) workload cost and
c) storage cOst and availability
d) none of these
availability
transparency can be
x) Location
compared with
a) Fragmentation transparency
b) Local mapping transparency
c) Replication transparency
d) none of these
Top-d approach to the design of data distribution is
a) we are developing a system from scratch applicable when
b) as the aggregation of existing databases
c) both of these
d) none of these

Group B
(Short Answer Type
Questions)
2Prove tha:[R:4«S,|S:42[R S/,S:4% AND 9, AND F
See Topic: QUERY AND CONCURRENCY CONTROL, Short Answer
Type Question No. 10.

3. What is Mixed Fragmentation? Explain with an example.

See Topic: DISTRIBUTED DATABASE ARCHITECTURE AND FEATURES, Short Answer
Question No. 16. Type

4. Write the rules to follow when defining fragments.

Sce Topic: DISTRIBUTED DATABASE ARCHITECTURE AND FE.ATURES, Short Answer
Question No. 10.
Type

MCA DBM-101
POPULAR PUBLICATIONS

QUESTION 2017
Group -A
(Multiple Choice Type Questions

1 Choose the correct alternatives for any ten of the following

) Distnbuted Systems should
a) meet prescribed time constraints b) aim better
c) aim better system utilization
d)aim resource
low
System overheadsharng
) Split approach of vertical fragmentation use

a) progressing splitting b) concurrent splitting

c) both (a) &(b) d) none of these

i) The name of the agent at the site of origin of a transaction is

a) main agent b) root agent
c) principle agent d) none of these

v) To make non distributed system distributed we add

a) DD component b) DC component
c) DDC component d) (a) &(c)

v) Allocation schema is a
a) site independence schema b) modern schema
c) site dependence schema d) none of these

vi) The disjointness condition is not strictly folowed in

a) horizontal fragmentation b) verticalfragmentation
c) mixed fragmentation d) hybrid fragmentation

vi) In DDBMSs, distributed logical data independence is provided by

a) Local conceptual schema b) Global external schema
c) Global conceptual schema d) Local mapping schema

vii) DWFG stands for

Gatevay
a) Distributed wait for graph D) Domain window
Firewall

c) Distributed weighted Forward Graph d) none of these

MCA DBM-104
 DISTRIBUTED DATABASE MANAGEMENT
emi join is used for reduci
IN)
a) network traffic
c) transmission time b) network delay
d) none of these
of the following is not a
Which feature of DDBMS
a) Replication transparency
c) Locking transparency b) Fragmentation transparency
d) Allocation transparency
Distributed tabase system do not
x)
of
help
a)
interconne
existing database
b) incremental
growth of the organization
J reduction communication
overhead of
dl reduction of the
memory requirement of geographically distributed transactions
distributed data

Group-B
(Short Answer Type
Questions)
What is distributed database system?
Describe different features of
system?
distributed database
See Topie: DISTRIBUTED DATABASE ARCHITECTURE
Question No. 18. AND FEATURES, Short
Answer Type

3 Give a brief comparative study between

tightly couple and loosely
See Topic: DISTRIBUTED DATABASE coupled architecture.
MANAGEMENT, Short Answer Type Question No. 1.
4. What is data replication? Explain with example. Describe different
"&2nd Part: layers of query processing.
See Topic: DISTRIBUTED DATABASE
ARCHITECTURE AND FEATURES, Short Answer
Question No. 8. Type
3 Part:
See Topic:
QUERY AND CONCURRENCY CONTROL, Long Answer Type
Question No. 2(b).
.What is the flat transaction?
Explain with example. What are the factors affecting the allocation?
"& 2nd Part:
See
Topic: DISTRIBUTED TRANSACTION
MMANAGEMENT, Short Answer Type Question
Part: No. 3.
e
opic: DISTRIBUTED TRANSACTION NMANAGEMENT, Long Answer Type Question No.
(2d Part). 2(b)

MCA DBM-105
POPULAR PUBLICATIONS

QUESTION 2018
(Group- A
(Multiple hoice Type
Questions)
1.Choose the correct alternative for each of the following
)Which of the following is a replica control protocol?
a) Distnbuted 2PL b) Biased protocol
c) Mayority locking d) All of
these
) Which of the following is a ROWA protocol?
a) Primary copy 2PL
b) Majority locking
c) Distributed 2PL
d) Contralized 2PL

in) Which of the following operation is conflicting?

a) Read-Write
b) Write-Read
c) Write-Wnite d) All of these

iv) Which of the following techniques is used when the

information on stable storana
a) Shadow paging
b) Check point storage s lat
c) Cold restart
d) None of these
v) Which of the following failures does not occur in a distributed system?
a) Disk failures
b) Link failures
c) Message Loss
d) None of these

vi) Location
independence represents that
a) users are aware of the
location of the data.
b) users are unaware of the location of the data.
c) users are aware of the
physicdl names of database objects.
d) None of the above.

VI) Which of the

following refers to the operation multiple physical database
distributed systerm?
a) Backup
c) Repication b) Recovery
d) All of these

MCA DBM-108
 DISTRIBUTEDDATABASE MANAGEMENT
TO algorithm
Inbasic
a) younger transaction are executed first
) older transactic are restarted

c) older transaction are executed

first
) both older and younger
transaction are restarted
fa ictributed system
distributed system has.n
nas
sites, the total number of message transfers
a) 21 in centralized 2PL Is

c) 2n +3 b) 3n +2
d) Sn
ahich
Whi of the following is not a
feature of DDBMS?
a) Network transparency
c DBMS transparency b) OS transparency
d) Hardware transparency

Group B
(Short Answer
Type Questions)
nescribe the reference architecture of Distributed Database
Giagram. Management system with proper
Cae Tanic: DISTRIBUTED DATABASE ARCHITECTURE
Question No. 5. AND FEATURES, Short Answer
fype

3Exolain the different between the terms "deadlock

prevention" and
See Topic: QUERY AND CONCURRENCY CONTROL, Short Answer"deadlock avoidance".
Type No. Question 13.
4
Describe different levels of
transparencies in distributed database
See Topic:
DISTRIBUTED DATABASE management system.
ARCHITECTURE AND FEATURES, Short Answer
Question No. 2. Type

5.Whatare the differences between loosely coupled"

system and "tightly coupled' system?
SeeTopic: DISTRIBUTED DATABASE IAN.AGEMENT,
Short Answer Type Question No. I.

.
Explain different types of
See
fragmentation indicating their advantage
disadvantage. and
Topie: DISTRIBUTED DATABASE ARCHNTECTURE AND
FE.ATURE, Short Answer Type
Question No. 19.

MCA DBM-109