Exam Details

Subject distributed database system
Paper
Exam / Course m.c.a.commerce
Department
Organization savitribai phule pune university
Position
Exam Date April, 2018
City, State maharashtra, pune


Question Paper

Total No. of Questions—4] [Total No. of Printed Pages—3
Seat
No. [5361]-403
M.C.A. (Sem. IV) EXAMINATION, 2018
(Commerce Faculty)
CS-403 DISTRIBUTED DATABASE SYSTEM
(2013 PATTERN)
Time Three Hours Maximum Marks 50
1. Attempt any seven
What is Autonomy Explain different types of Autonomy.
What is DDBMS
What is Bushy Join Tree
State the different steps of query processing in a DDBMS.
List different types of failure in DDBMS.
What are correctness rules for fragmentation
What are different ways in which global directories can be
stored in DDBMS
Define dirty read problem.
2. Attempt any three
Write a note on Top-Down Approach of DDB design.
Explain Complicated Factors of distributed database.
Differentiate between MDBS and DDBMS.
Write a note on "Components of DDBMS" with the help of
diagram.
P.T.O.
[5361]-403 2
3. Attempt any three
Write a note on Out-Place-Order.
Write a note on Basic Timestamp Ordering protocol in case
of DDBMS.
What is Transaction Explain different types of transaction.
Write a note on Distributed deadlock detection.
4. Attempt any three
Consider the following relational schema
Student(Sno, Sname, City, Class)
Subject(Sub_no, Sub_Name)
Stud_Sub(Sno, Sub_No, Marks)
Construct optimized operator tree for the following query.
Select Sname, City
from Student, Subject, Stud_Sub
where Student.Sno=Stud_Sub.Sno. and
Subject.Sub_no=Stud_Sub.Sub_No and
Class="MCA" and Sub_name="DDBMS"
and Marks>75
Consider the following DWFGs
Consider the following scenario. Transaction T1 and T2 are
executing at site 1. T3 and T4 are executing at site 2. Transaction
T1 is waiting for Transaction T2. Transaction T3 is waiting
for Transaction T4. Transaction T1 is waiting for Transaction
T3. Transaction T4 is waiting for Transaction T2.
Draw LWFG and GWFG. Detect the deadlock.
[5361]-403 3 P.T.O.
Consider relation PROJ(Pno, Panme, Budget)
Assume that PROJ relation is horizontally fragmented as
PROJ1 6PNO<= 15 (PROJ)
PROJ2 6PNO> 25 55 (PROJ)
PROJ3 6PNO> 55 (PROJ)
Draw an optimized operator tree for the following query. Convert
the generic tree into reduced tree considering the fragmentation
format
Select Budget
From PROJ
Where Pno 65;
Consider the following relational schema
Book(Bno, Bname, Pubname, Price)
Author Aname, City)
Ano)
Draw a query graph for the following query.
Select Aname, Bname
from Book, Author, B_A
where Book.Bno=B_K.Bno
and Author.Ano=B_K.Ano
and Pubname="Techmax" and Price>150
and City="Nashik"



Other Question Papers

Subjects

  • advance java
  • advanced database management system
  • advanced networking
  • advanced operating system
  • advanced web programming
  • business and professional skills
  • business communication
  • business strategies
  • content management system
  • core java
  • cyber law and ethics
  • data structure using-c
  • data warehousing and data mining
  • database management system
  • distributed database system
  • e-commerce practices andtechnologies
  • element of statistics
  • elements of mathematics
  • financial and investment analysis
  • fundamental of informationtechnology
  • human resource management
  • information system audit
  • it project management
  • knowledge management for business
  • m-commerce
  • management information system
  • mobile communication
  • networking operations
  • numerical and statistical methods
  • oop’s using c++
  • operating system
  • operating systems
  • principles of management
  • programming fundamentals : ‘c’ programming
  • programming in ‘c’
  • relational database management systems
  • software engineering
  • system analysis and design
  • system organisation and management
  • system simulation and modeling
  • visual programming
  • web technologies