Beehive College of Advance Studies Beehive College of Advance Studies

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

Beehive College of Advance Studies Beehive College of Advance Studies

1st Internal Assessment Examination 2019 1st Internal Assessment Examination 2019
(MSC IT- 3rd SEM) (MSC IT- 3rd SEM)
(ARDBMS) (ARDBMS)
M.M. 50 SET-1 Time: 2 hr M.M. 50 SET-2 Time: 2 hr

Attempt any 6 questions. All questions carry equal marks. 6*5 Attempt any 6 questions. All questions carry equal marks. 6*5

Q1. Explain the overview of DBMS. Q1. How we do recovery from Transaction Failures?

Q2. What is Data mining? Explain the Data Warehouse. Q2.what is deadlock prevention protocol how it protect the process from being deadlock condition.

Q3. Explain the Concurrency Control. How we do the Shared Lock and Exclusive Lock in the Q3. Explain the ACID properties.
Concurrency Control explain with example.
Q4. Find out what is DDL?
Q4. Define the Deadlock. Explain the Deadlock handing methods?
Q5. Explain the ARDBMS architecture.
Q5.What is Data Base Model explain it with Object Oriented Data Base Model with suitable example
Q6. Describe the distributed database and file system.
Q6. What is Shadow Paging? Explain it with schematic diagram.
Q7. Which are locking techniques for concurrency control?
Q7. What is Deadlock Detection? Which are the important methods of Deadlock Detection?
Q8. What are the perspectives of Data modeling?
Q8. Give the brief notes on these.

A. Transaction System.

B. Transaction Properties
Attempt any 2 questions. All questions carry equal marks 2*10

Q1. Find which schedules possible exist here in the transaction:


Attempt any 2 questions. All questions carry equal marks 2*10 A. 𝒓𝟏 (𝑿), 𝒓𝟑 (𝑿), 𝒘𝟏 (𝑿), 𝒓𝟐 (𝑿), 𝒘𝟑 (𝑿)

Q1. Check whether the given schedule is Conflict Serializable or not: and explain Conflict Condition. B. 𝒓𝟏 (𝑿), 𝒓𝟐 (𝑿), 𝒘𝟑 (𝑿), 𝒘𝟐 (𝑿), 𝒓𝟐 (𝑿)

A.: 𝒓𝟏 (𝑸), 𝒘𝟐 (𝑸), 𝒓𝟏 (𝑸) C. 𝒓𝟑 (X)𝒘𝟏 (𝑿), 𝒓𝟏 (𝑿, )𝒘𝟐 (𝑿), 𝒘𝟑 (𝑿), 𝒓𝟑 (𝑿)

B.: 𝒓𝟏 (𝑸), 𝒘𝟐 (𝑸), 𝒘𝟏 (𝑸), 𝒘𝟑 (𝑸) Q2. Explain the followings with suitable example:

Q2. Show the View Serial Schedule at any Transaction with a suitable example. Explain the A. Serial schedules. B. conflict schedules.
advantages of ARDBMS.
Q3. What are CODD rules? Explain it
Q3. What is precedence graph? Describe it with deadlock detection and how we do recovery in any
process and transaction? Describe Data Base Manager Responsibilities.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy