DISTRIBUTED DATABASES ONLINE BITS

Code No: 05411203 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DISTRIBUTED DATABASES
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
2. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
3. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
4. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
5. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
6. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
7. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
8. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
9. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
10. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
Cont..2

A
: 2 :
Code No: 05411203 Set No. 1
II. Fill in the blanks:
11. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
12. OMG stands for____________
13. The set of data items written by Transaction Ti are called_______
14. The protocols which use a weighted majority are called ________ protocols.
15. IS and IX locks are available in _______________ Locking Technique
16. The task of mapping from one schema to another is called _____
17. Determination of structural and semantic problems of each component Database is called ________
18. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called__________ rule
19. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called_______.
20. In query processing, that site receives the query and performs the splitting is called __________
-o0o-
Code No: 05411203 Set No. 2
DISTRIBUTED DATABASES
Objective Exam
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
2. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
3. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
4. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
5. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
6. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
7. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
8. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
9. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
10. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
Cont..2

A
: 2 :
Code No: 05411203 Set No. 2
II. Fill in the blanks:
11. The protocols which use a weighted majority are called ________ protocols.
12. IS and IX locks are available in _______________ Locking Technique
13. The task of mapping from one schema to another is called _____
14. Determination of structural and semantic problems of each component Database is called ________
15. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called __________ rule
16. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called _______.
17. In query processing, that site receives the query and performs the splitting is called __________
18. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
19. OMG stands for ____________
20. The set of data items written by Transaction Ti are called _______
-o0o-
Code No: 05411203 Set No. 3
DISTRIBUTED DATABASES
I. Choose the correct alternative:
1. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
2. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
3. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
4. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
5. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
6. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
7. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
8. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
9. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
10. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
Cont..2

A
: 2 :
Code No: 05411203 Set No. 3
II. Fill in the blanks:
11. The task of mapping from one schema to another is called _____
12. Determination of structural and semantic problems of each component Database is called ________
13. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called __________ rule
14. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called _______.
15. In query processing, that site receives the query and performs the splitting is called __________
16. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
17. OMG stands for ____________
18. The set of data items written by Transaction Ti are called _______
19. The protocols which use a weighted majority are called ________ protocols.
20. IS and IX locks are available in _______________ Locking Technique
-o0o-
Code No: 05411203 Set No. 4
DISTRIBUTED DATABASES
Objective Exam
Marks: 20.
I. Choose the correct alternative:
1. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
2. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
3. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
4. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
5. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
6. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
7. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
8. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
9. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
10. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
Cont..2

A
: 2 :
Code No: 05411203 Set No. 4
II. Fill in the blanks:
11. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called__________ rule
12. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called_______.
13. In query processing, that site receives the query and performs the splitting is called __________
14. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
15. OMG stands for____________
16. The set of data items written by Transaction Ti are called_______
17. The protocols which use a weighted majority are called ________ protocols.
18. IS and IX locks are available in _______________ Locking Technique
19. The task of mapping from one schema to another is called _____
20. Determination of structural and semantic problems of each component Database is called ________
-o0o-