These are sample MCQs to indicate pattern, may or

may not appear in examination.

Mahatma Education Society’s

Pillai HOC College of Engineering and Technology

Program: BE Computer Engineering

Curriculum Scheme: Rev2012
Examination: Third Year Semester VI
Course Code: CPC603 and Course Name: Distributed Database
Time: 1 hour Max. Marks: 50
Note to the students:- All the Questions are compulsory and carry equal marks .
Q1. A DDBMS consists of a single logical database that is split into a number of
________________.

Option A: Parts

Option B: Lines

Option C: Tables

Option D: Partitions or Fragments

Q2. A distributed database system allows applications to access various data

items from _________ and ___________ databases.

Option A: Local and Remote

Option B: Remote and Central

Option C: Central and Distributed

Option D: Local and Distributed

Q3. ______________ techniques manage simultaneous data access and ensure data
consistency across database fragments in the distributed DBMS.

Option A: Transaction control

Option B: Concurrency Control

Option C: Data Control

Option D: Data Validation

Q4. A client/server system has the ability to distribute the computing workload
between ______________

Option A: client workstations and shared servers.

Option B: Local and Remote Database

Option C: Local Server and Remote Database

Option D: Only Remote Database

Q5. The reference architecture of a DDBMS is an extension of ________

architecture.

Option A: Client Server

Option B: ANSI–SPARC

Option C: peer to peer

Option D: Top Down

Q6. A server is defined as the _________ of services.

Option A: Manager

Option B: Requester

Option C: Provider

Option D: Controller

Q7. Which of the following means storing a separate copy of the database at
multiple locations?

Option A: Vertical Partitions

Option B: Horizontal Partitioning

Option C: Data Replication

Option D: Horizontal and Vertical Partitioning

Q8. ________ provide a general model of transactional processing

involving multiple sites and possibly human processing of certain
steps

Option A: Workflows

Option B: Data flow

Option C: location flow

Option D: Transaction Flow

Q9. Which of the following means some of the columns of a relation are at
different sites?

Option A: Data Replication

Option B: Horizontal Partitioning

Option C: Vertical Partitioning

Option D: Horizontal and Vertical Partitioning

Q10. ____ transparency exists when the end user or programmer must specify the
database fragment names but does not need to specify where these
fragments are located.

Option A: Transaction

Option B: Location

Option C: Local mapping

Option D: Fragmentation

Q11. In ____________ , for each transaction which is a first phase during which new
lock are acquired.

Option A: Shrinking Phase

Option B: Release phase

Option C: Commit phase

Option D: Growing Phase

Q12. The transactions are always ______________, if it always locks a data item in
shared mode before reading it.

Option A: well formed

Option B: well distributed

Option C: well locked

Option D: well shared

Q13. The ORDER concurrency control technique is based on the

_______________________ property.

Option A: ordering mechanism

Option B: inherent ordering

Option C: total ordering

Option D: partial ordering

Q14. A system is in a ___________ state if there exists a set of transactions such that
every transaction in the set is waiting for another transaction in the set.

Option A: die

Option B: Waiting

Option C: Deadlock

Option D: Ready

Q15. In order to maintain transactional integrity and database consistency, what

technology does a DBMS deploy?

Option A: Triggers
Option B: Pointers

Option C: Locks

Option D: Cursors

Q16. The process of mapping global queries to local ones can be realized as
follows. Select the incorrect option.

Option A: The tables required in a global query have fragments distributed across
multiple sites

Option B: The tables required in a global query have fully replicated & distributed
across multiple sites

Option C: If there is no replication, the global optimizer runs local queries at the sites
where the fragments are stored.

Option D: The global optimizer generates a distributed execution plan so that least
amount of data transfer occurs across the sites.

Q17. Distributed two-phase locking approaches can be of three types ,which one is
incorrect option.

Option A: Two phase locking protocol

Option B: Centralized two-phase locking

Option C: Primary copy two-phase locking

Option D: Distributed two-phase locking

Q18. A query tree is a tree data structure that corresponds to a relational algebra
expression. It represents the relational algebra operations as _________________.

Option A: internal nodes

Option B: leaf nodes

Option C: external nodes

Option D: root

Q19. For committing a transaction, the DBMS might discard all the records
 ___________________________.

Option A: after image

Option B: before image

Option C: log

Option D: redo log

Q20. Our basic principle to get a high performance is that we decompose a global
query to the finest level of subqueries in order to explore all possible
execution plans. This reduces _______________.

Option A: Cost

Option B: Execution time

Option C: overall processing cost in a heterogeneous distributed database

Option D: storage space

Q21. A heterogeneous DBMS, HDBMS, can be viewed as a DBMS that has a set of
participating DBMSs and provides _________________.

Option A: No integration of data

Option B: integration of data

Option C: interoperability of DBMSs

Option D: both interoperability of DBMSs as well as integration of data

Q22. How many Root element can be used in one XML file?

Option A: ONE

Option B: Two

Option C: Unlimited

Option D: Zero

Q23. Which is correct Syntax?

Option A: <!ELEMENT>

Option B: <?Element>

Option C: <?ELEEMENT?>

Option D: <!element?>

Q24. ________________________ is used to navigate through Elements & attributes in

XML Documents.

Option A: DTD

Option B: XQuery

Option C: XSLT

Option D: XPath

Q25. Which of the following protocols ensures conflict serializability and safety
from deadlocks?

Option A: Two-phase locking protocol

Option B: Time-stamp ordering protocol

Option C: Graph based protocol

Option D: one phase locking protocol