Scribd
Upload
832 views2 pages

M. Tech. (Sem-Ii) Theory Examination 2017-18 Distributed Data Base

The document is an exam paper for a distributed database course. It contains 7 sections with multiple choice and short answer questions. Section A contains 7 short questions defining key distributed database concepts like data replication, transactions, distributed database architectures, and concurrency control techniques. Sections B-F contain longer answer questions requiring explanations of topics such as conflict serializability, commitment protocols, query processing, and concurrency control algorithms. The exam tests students' understanding of fundamental distributed database principles and techniques.

Uploaded by

Gopal Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
832 views2 pages

M. Tech. (Sem-Ii) Theory Examination 2017-18 Distributed Data Base

The document is an exam paper for a distributed database course. It contains 7 sections with multiple choice and short answer questions. Section A contains 7 short questions defining key distributed database concepts like data replication, transactions, distributed database architectures, and concurrency control techniques. Sections B-F contain longer answer questions requiring explanations of topics such as conflict serializability, commitment protocols, query processing, and concurrency control algorithms. The exam tests students' understanding of fundamental distributed database principles and techniques.

Uploaded by

Gopal Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Printed pages: 2 Sub Code: MTCS041

Paper Id: 210207 Roll No.                    

M. TECH.
(SEM-II) THEORY EXAMINATION 2017-18
DISTRIBUTED DATA BASE

Time: 3 Hours Total Marks: 70


Note: Attempt all Sections. If you require any missing data; then choose suitably.

SECTION – A
1. You are required to answer all the parts of this question. (2×7=14 marks)
(a) Define data replication.
(b) Explain the concept of transaction.
(c) Explain R* Algorithm.
(d) List the types of Distributed DBMS Architecture.
(e) What is query decomposition?
(f) Define atomicity in distributed database.
(g) Define Granularity of locks.
SECTION – B
2. Attempt any three parts of the following: (7×3=21 marks)
(a) Explain conflict serializability with suitable example.
(b) Define reliability. Write short notes on non blocking commitment protocols.
(c) Write short notes on redundant and non redundant databases.
(d) Explain 2 Phase commitment protocol.
(e) Explain SDD-1 Algorithm

SECTION – C
3. Attempt any one part of the following: (7×1=7 marks)
(a) Explain query execution with example.
(b) Explain Object query processor architecture.
4. Attempt any one part of the following: (7×1=7 marks)
(a) Explain Multi database concurrency control.
(b) Explain PUSH based technology in distributed databases.
.
5. Attempt any one part of the following: (7×1=7 marks)

 
 
(a) Explain the architecture of a distributed database management function with
diagrammatic illustration.
(b) Give brief details of Distributed Deadlocks.
6. Attempt any one part of the following: (7×1=7 marks)
(a) What is a query? Explain query optimization techniques in details.
(b) Define Transactions. Explain the different properties of transactions

7. Attempt any one part of the following: (7×1=7 marks)


(a) Explain concurrency control based on Time stamps in distributed databases.
(b) Write short notes on allocation techniques for distributed database design.

 
 

You might also like