0% found this document useful (0 votes)
8 views2 pages

BCAD 601F Advanced Database

This document is an examination paper for Advanced Database and PL/SQL at Maulana Abul Kalam Azad University of Technology. It includes various types of questions such as very short answer, short answer, and long answer questions covering topics like query optimization, object-oriented databases, concurrency control, and distributed databases. The paper is structured into three groups with a total of 70 marks and a time allotment of 3 hours.
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
0% found this document useful (0 votes)
8 views2 pages

BCAD 601F Advanced Database

This document is an examination paper for Advanced Database and PL/SQL at Maulana Abul Kalam Azad University of Technology. It includes various types of questions such as very short answer, short answer, and long answer questions covering topics like query optimization, object-oriented databases, concurrency control, and distributed databases. The paper is structured into three groups with a total of 70 marks and a time allotment of 3 hours.
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

CS/BCA(A)/EVEN/SEM-6/600115/2023-2024/I176

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL


Paper Code : BCAD601F Advanced Database and PL/SQL
UPID : 600115

Time Allotted : 3 Hours Full Marks :70


The Figures in the margin indicate full marks.
Candidate are required to give their answers in their own words as far as practicable

Group-A (Very Short Answer Type Question)


1. Answer any ten of the following : [ 1 x 10 = 10 ]
(I) What is query optimization?
(II) What is ARQ?
(III) What is a Dirty Read problem?
(IV) The _____ operation marks the successful completion of a transaction and makes its changes permanent.
(V) What are the storage issues associated with OODBMS?
(VI) What is data fragmentation?
(VII) What is a transaction in a database system?
(VIII) ________ is known as lowest level operator to access data in query processing.
(IX) In context of database, let T1 and T2 are two concurrent transactions. Consider the following sequence of
operations on data X:
T1:R(X) T1:W(X) T2:R(X) T2:W(X)
This is a _________ problem.
a. Dirty read
b. Lost update
c. Incorrect summary
d. Unpredictable read
(X) Choose the correct option for the following-
Assume transaction T1 holds a shared lock R. If a transaction T2 also requests for a shared lock on R, (MEDIUM)
a. it will result in a deadlock situation
b. it will immediately be granted
c. it will immediately reject
d. it will be granted as soon as it is released by T1
(XI) What is recoverability in DBMS?
(XII) What is an Object Identifier (OID) in an OODBMS?

Group-B (Short Answer Type Question)


Answer any three of the following : [ 5 x 3 = 15 ]
2. What are the major storage issues faced in object-oriented database management systems and how are [5]
they addressed?
3. What are some of the common architectures used in distributed databases? [5]
4. What is an identifier in object-oriented programming and how does it relate to object-oriented database [5]
management systems?
5. What are the different types of select operations in DBMS? [5]
6. What are the major applications of a Database? [5]

Group-C (Long Answer Type Question)


Answer any three of the following : [ 15 x 3 = 45 ]
7. (a) Explain cost based-approach to query optimisation in details. [5]
(b) What are the advantages and disadvantages of heuristic-based query optimization? [5]
(c) Explain the difference between a hash join and a nested loop join in SQL. [5]
8. (a) What is buffer management in DBMS? [2]
(b) What is a buffer manager? Why is it necessary? [5]
(c) What are physical query plan operators? Explain at least three such operators with examples. [5]
1/2
(d) Explain the basic steps of two-pass sort based algorithm for query processing. [3]
9. (a) What is Concurrency-Control protocol? Elaborate. [5]
(b) What is Lock-Based protocol? [2]
(c) Define Strict 2PL, Rigorous 2PL and Conservative 2PL. [3]
(d) Explain Deadlock and Starvation with example. [5]
10. (a) Discuss the different types of replication strategies that can be used in a distributed database [5]
system and their trade-offs.
(b) Explain the concept of distributed concurrency control and the different techniques that can be used [5]
to ensure concurrency control in a distributed database system.
(c) Discuss the challenges involved in ensuring data security and privacy in a distributed database [5]
system and the different techniques that can be used to achieve it.
11. (a) Compare and contrast serializability and recoverability in transaction processing. Explain how these [ 10 ]
concepts are related and discuss their importance in ensuring data consistency and system
availability.
(b) Describe the steps involved in resolving a deadlock in a transaction processing system. Discuss the [5]
advantages and disadvantages of each approach and provide an example of each.

*** END OF PAPER ***

2/2

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