MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 64 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
Isolation of the transactions is ensured by |
| A. | Transaction management |
| B. | Application programmer |
| C. | Concurrency control |
| D. | Recovery management |
| Answer» D. Recovery management | |
| 52. |
Constraint checking can be disabled in existing _______________ and _____________ constraints so that any data you modify or add to the table is not checked against the constraint. |
| A. | CHECK, FOREIGN KEY |
| B. | DELETE, FOREIGN KEY |
| C. | CHECK, PRIMARY KEY |
| D. | PRIMARY KEY, FOREIGN KEY |
| Answer» B. DELETE, FOREIGN KEY | |
| 53. |
State true or false: Information residing in the volatile storage does not usually survive system crashes |
| A. | True |
| B. | False |
| C. | May be |
| D. | Can't say |
| Answer» B. False | |
| 54. |
Which of the following is not a transaction state? |
| A. | Active |
| B. | Partially committed |
| C. | Failed |
| D. | Compensated |
| Answer» E. | |
| 55. |
A transaction that has not been completed successfully is called as _______ |
| A. | Compensating transaction |
| B. | Aborted transaction |
| C. | Active transaction |
| D. | Partially committed transaction |
| Answer» C. Active transaction | |
| 56. |
The execution sequences in concurrency control are termed as ________ |
| A. | Serials |
| B. | Schedules |
| C. | Organizations |
| D. | Time tables |
| Answer» C. Organizations | |
| 57. |
The scheme that controls the interaction between executing transactions is called as _____ |
| A. | Concurrency control scheme |
| B. | Multiprogramming scheme |
| C. | Serialization scheme |
| D. | Schedule scheme |
| Answer» B. Multiprogramming scheme | |
| 58. |
If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are |
| A. | Non conflict equivalent |
| B. | Equal |
| C. | Conflict equivalent |
| D. | Isolation equivalent |
| Answer» D. Isolation equivalent | |
| 59. |
With regards to transaction processing, any DBMS should be capable of: |
| A. | Ensuring that transactions are free from interference from other users. |
| B. | Parts of a transaction are not lost due to a failure. |
| C. | Transactions do not make the database inconsistent. |
| D. | All of the above. |
| Answer» E. | |
| 60. |
When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is |
| A. | Wait-die |
| B. | Wait-wound |
| C. | Wound-wait |
| D. | Wait |
| Answer» B. Wait-wound | |
| 61. |
What are the ways of dealing with deadlock ? |
| A. | Deadlock prevention |
| B. | Deadlock recovery |
| C. | Deadlock detection |
| D. | All of the mentioned |
| Answer» E. | |
| 62. |
When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is |
| A. | Wait-die |
| B. | Wait-wound |
| C. | Wound-wait |
| D. | Wait |
| Answer» D. Wait | |
| 63. |
Database locking concept is used to solve the problem of |
| A. | Lost Update |
| B. | Uncommitted Dependency |
| C. | Inconsistent Data |
| D. | All of the above |
| Answer» E. | |
| 64. |
What is ACID properties of Transactions? |
| A. | Atomicity, Consistency, Isolation, Database |
| B. | Atomicity, Consistency, Isolation, Durability |
| C. | Atomicity, Consistency, Inconsistent, Durability |
| D. | Automatically, Concurrency, Isolation, Durability |
| Answer» C. Atomicity, Consistency, Inconsistent, Durability | |