Relational Database Management System Mcqs

Page No. 49

Which of the following is not a method in deadlock handling


aDeadlock prevention

✖


b Deadlock detection

✖


c Deadlock recovery

✖


dDeadlock distribution

✓


View Answer Deadlock distribution

A system is in a _______ state if there exists a set of transactions in which every transaction is waiting for another transaction in the set.


aDeadlock

✓


bStarved

✖


cIsolated

✖


dNone of the mentioned

✖


View Answer Deadlock

In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then


aRead operation is executed

✖


b Read operation is rejected

✖


c Write operation is executed

✖


dWrite operation is rejected

✓



In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then


aRead operation is executed

✖


b Read operation is rejected

✓


cWrite operation is executed

✖


dWrite operation is rejected

✖



Which of the following timestamp based protocols generates serializable schedules?


aThomas write rule

✓


bTimestamp ordering protocol

✖


c Validation protocol

✖


dNone of the mentioned

✖


View Answer Thomas write rule

State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol


a True

✓


b False

✖


ceither true of false

✖


dnone of these

✖


View Answer True

The default timestamp ordering protocol generates schedules that are


aRecoverable

✖


b Non-recoverable

✓


cStarving

✖


dNone of the mentioned

✖


View Answer Non-recoverable

A ________ ensures that any conflicting read and write operations are executed in timestamp order


aOrganizational protocol

✖


bTimestamp ordering protocol

✓


cTimestamp execution protocol

✖


d802-11 protocol

✖



R-timestamp(Q) denotes?


a The largest timestamp of any transaction that can execute write(Q) successfully

✖


bThe largest timestamp of any transaction that can execute read(Q) successfully

✓


cThe smallest timestamp of any transaction that can execute write(Q) successfully

✖


dThe smallest timestamp of any transaction that can execute read(Q) successfully

✖



W-timestamp(Q) denotes?


aThe largest timestamp of any transaction that can execute write(Q) successfully

✓


bThe largest timestamp of any transaction that can execute read(Q) successfully

✖


cThe smallest timestamp of any transaction that can execute write(Q) successfully

✖


dThe smallest timestamp of any transaction that can execute read(Q) successfully

✖



Goto Page No.

Page 49 of 54

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan