The University of Azad Jammu & Kashmir

Department of Computer Science and IT.

Mid Term Exam (Spring 2021) Subject: Distributed Database Systems

MCS-IV (2019-2021) Total Marks: 25
Name: ______________ Roll Number: _____________

Objective Type

Note: Choose the appropriate answer. Please submit objective paper on the answer sheet
provided at page 3.
1. When all the users are getting single common view is called single integration. Cost
a. True
b. False
2. When you decompose a relation in a situation like no information is lost then it is called
lossless decomposition.
a. True
b. False
3. A candidate key is a super key that can have extra attribute.
a. True
b. False
4. A domain is a collection of all possible values of one attribute.
a. True
b. False
5. System perform record identification in semantic data models.
a. True
b. False
6. Multiple queries related to dingle site are called inter queries
a. True
b. False
7. Multiple queries related to different sites are called intra query.
a. True
b. False
8. Storing data to nearby locations for local access is called data localization.
a. True
b. False
9. With the increase in levels of transparency cost and implementation effort also increases.
a. True
b. False
10. Physical data independence represents conceptual schema.
a. True
b. False
11. Logical data independence represents storage structure.

1
 a. True
b. False
12. Only computers can be places as a network node.
a. True
b. False
13. Database Administrator is responsible for managing interval schema.
a. True
b. False
14. A2, D2, H1 represents semi-autonomous system.
a. True
b. False
15. A Publisher is a server that is the source from where the data is to be replicated.
a) True
b) False
16. In case of merge replication, we are not allowed to use primary key as a replication agent.
a) True
b) False
17. In bond energy algorithm n represents the total number of columns.
a) True
b) False
18. Using Bond Energy Algorithm complexity of computation of Affinity Matrix can be
reduced.
a) True
b) False
19. Affinities with weaker associations are clustered together in Clustered affinity matrix/
a) True
b) False
20. In vertical fragmentation number of tuples remains same.
a) True
b) False
21. For defining the predicates, we don’t need to perform PHF on the primary table?
a) True
b) False
22. Min Term predicates provides the basis for the horizontal fragmentation that is why PHF
are also called min term fragments.
a) True
b) False
23. While making MDBS we use schema integration to make global conceptual schema.
a) True
b) False
24. Semantic data models are economically rich because they are easy to implement.
a) True
b) False
25. Global conceptual Schema is the additional layer in a distributed environment.
a) True
b) False

2
 The University of Azad Jammu & Kashmir

Department of Computer Science and IT.

Final Term Exam (Spring 2021) Subject: Distributed Database Systems

MCS-IV (2019-2021) Total Marks: 25
Name: ______________ Roll Number: _____________

Answer Sheet for Objective Type Paper

Q# Answer

10

11

12

13

14

15

16

3
17

18

19

20

21

22

23

24

25

4
 The University of Azad Jammu & Kashmir

Department of Computer Science and IT.

Final Term Exam (Spring 2021) Subject: Distributed Database Systems

MCS-IV (2019-2021) Total Marks: 50
Name: ______________ Roll Number: _____________

Subjective Type

Question # 1:

a. What is DBMS standardization and what different approaches are used for this
purpose? (5)
b. How federated Schema architecture is different from Global schema architecture?
(5)

Question # 2:

How PHF COMM-Min Algorithm can be applied in distributed database environment?

Explain with example? (10)

Question # 3:

Consider Q= {Q1, Q2, Q3, Q4} as a set of queries, A= {A1, A2, A3, A4} as a set of

attributes for the relation R, and S= {S1, S2, S3} as a set of sites in the distributed systems.

Assume that A1, is the primary key of the relation R, And the following matrices represents

the attribute usage values of the relation R and application access frequencies at different

sites:

A1 A2 A3 A4

Q1 0 0 1 0

Q2 1 1 1 0

Q3 1 0 0 1

5
 Q4 0 1 1 0

S1 S2 S3 Sum

Q1 0 10 0 10

Q2 5 0 10 15

Q3 0 35 5 40

Q4 10 20 0 30

a. Calculate attribute affinity matrix, Global Affinity Measure? (10)

b. Also calculate using bond energy algorithm? (10)

Question # 4:

a. How we can say that replication is better than fragmentation in a distributed

database systems environment? (5)
b. What type of replication agents we can apply in a particular scenario? (5)