IncludeHelp_logo
Skip Navigation Links

Home » MCQs » DBMS MCQs

DBMS Schedule MCQs

DBMS Schedule MCQs: This section contains multiple-choice questions and answers on schedule in DBMS.
Submitted by Anushree Goswami, on April 18, 2022

1. It is called a schedule when it consists of a series of operations from one ___ to another.

  1. Transition
  2. Transaction
  3. Transportation
  4. Transcription

Answer: B) Transaction

Explanation:

It is called a schedule when it consists of a series of operations from one transaction to another.

Discuss this Question

2. In each individual transaction, the ___ preserves the order of operations.

  1. Schedule
  2. System
  3. Steps
  4. Syndrome

Answer: A) Schedule

Explanation:

In each individual transaction, the Schedule preserves the order of operations.

Discuss this Question

3. How many types of schedules are there?

  1. 2
  2. 3
  3. 4
  4. 5

Answer: B) 3

Explanation:

There are 3 types of schedules.

Discuss this Question

4. Which of the following is a type of schedule?

  1. Serial
  2. Non-serial
  3. Serializable
  4. All of the above

Answer: D) All of the above

Explanation:

There are 3 types of schedules -

  1. Serial
  2. Non-serial
  3. Serializable

Discuss this Question

5. The ___ schedule is a type of schedule where one transaction is executed completely before starting another transaction.

  1. Serial
  2. Non-serial
  3. Serializable
  4. Non-serializable

Answer: A) Serial

Explanation:

The serial schedule is a type of schedule where one transaction is executed completely before starting another transaction.

Discuss this Question

6. In a serial schedule, the next transaction is executed after the ___ one has completed its cycle.

  1. First
  2. Last
  3. Middle
  4. One-Fourth

Answer: A) First

Explanation:

In a serial schedule, the next transaction is executed after the first one has completed its cycle.

Discuss this Question

7. A non-serial schedule would result if ___ is allowed.

  1. Leaving
  2. Inter-leaving
  3. Intra-leaving
  4. None of the above

Answer: B) Inter-leaving

Explanation:

A non-serial schedule would result if interleaving is allowed.

Discuss this Question

8. A number of possible orders for executing individual operations of transactions are presented in the ___ Schedule.

  1. Serial
  2. Non-Serial
  3. Serializable
  4. Non-serializable

Answer: B) Non-Serial

Explanation:

A number of possible orders for executing individual operations of transactions are presented in it.

Discuss this Question

9. What is TRUE about Serializable Schedule?

  1. In order to find non-serial schedules, the serializability of schedules is checked to ensure the transactions can run concurrently without being interfered with.
  2. When the executions of the transactions have interleaving of their operations, it indicates which schedules are correct.
  3. If a non-serial schedule's result equals that of its serial transactions, it will be serializable.
  4. All of the above

Answer: D) All of the above

Explanation:

In case of Serializable Schedule -

  1. In order to find non-serial schedules, the serializability of schedules is checked to ensure the transactions can run concurrently without being interfered with.
  2. When the executions of the transactions have interleaving of their operations, it indicates which schedules are correct.
  3. If a non-serial schedule's result equals that of its serial transactions, it will be serializable.

Discuss this Question

10. Serializability of a schedule is tested using a ___.

  1. Serial Graph
  2. Non-serial Graph
  3. Serialization Graph
  4. Non-Serialization Graph

Answer: C) Serialization Graph

Explanation:

Serializability of a schedule is tested using a serialization graph.

Discuss this Question

11. Schedules are constructed using a graph known as a ___ graph.

  1. Accordance
  2. Precedence
  3. Serializable
  4. Non-Serializable

Answer: B) Precedence

Explanation:

Schedules are constructed using a graph known as a precedence graph.

Discuss this Question

12. It is shown that the precedence graph has a pair G = (V, E), where V and E are the ___, respectively.

  1. Edges
  2. Vertices
  3. Edges and Vertices
  4. Vertices and Edges

Answer: D) Vertices and Edges

Explanation:

It is shown that the precedence graph has a pair G = (V, E), where V and E are the vertices and edges, respectively.

Discuss this Question

13. All the transactions participating in the ___ are represented by the set of vertices in the precedence graph.

  1. Set
  2. Schedule
  3. System
  4. Serial

Answer: B) Schedule

Explanation:

All the transactions participating in the schedule are represented by the set of vertices in the precedence graph.

Discuss this Question

14. All edges Ti -> Tj that satisfy one of the following conditions are contained in the set of edges:

  1. In the case of Ti executing write (Q) before Tj executing read (Q), create node Ti * Tj.
  2. If Ti executes the read operation (Q) before Tj executes the write operation (Q), create a node Ti * Tj.
  3. When Ti executes write (Q) before Tj executes write (Q), a node Ti * Tj is created.
  4. All of the above

Answer: D) All of the above

Explanation:

All edges Ti -> Tj that satisfy one of the following conditions are contained in the set of edges:

  1. In the case of Ti executing write (Q) before Tj executing read (Q), create node Ti * Tj.
  2. If Ti executes the read operation (Q) before Tj executes the write operation (Q), create a node Ti * Tj.
  3. When Ti executes write (Q) before Tj executes write (Q), a node Ti * Tj is created.

Discuss this Question

15. There will be no execution of the first instruction from Tj before all instructions of Ti from the ___ graph are executed.

  1. Schedule
  2. Precedence
  3. Serializable
  4. Serial

Answer: B) Precedence

Explanation:

There will be no execution of the first instruction from Tj before all instructions of Ti from the precedence graph are executed.

Discuss this Question

16. A precedence graph that contains cycles on schedule S is ___.

  1. Serializable
  2. Non-serializable
  3. Serial
  4. Non-serial

Answer: B) Non-serializable

Explanation:

A precedence graph that contains cycles on schedule S is non-serializable.

Discuss this Question

17. ___ graphs do not have cycles.

  1. Serializable
  2. Non-serializable
  3. Serial
  4. Non-serial

Answer: A) Serializable

Explanation:

Serializable graphs do not have cycles.

Discuss this Question

18. Conflict serializability occurs when a schedule can become a ___ schedule after swapping non-conflicting operations.

  1. Serial
  2. Non-Serial
  3. Serializable
  4. Non-serializable

Answer: A) Serial

Explanation:

Conflict serializability occurs when a schedule can become a serial schedule after swapping non-conflicting operations.

Discuss this Question

19. If a schedule is ___ equivalent to a serial schedule, it will be a conflict serializable schedule.

  1. Serial
  2. Non-Serial
  3. Conflict
  4. Non-conflict

Answer: C) Conflict

Explanation:

If a schedule is conflict equivalent to a serial schedule, it will be a conflict serializable schedule.

Discuss this Question

20. Which condition(s) must be met for the two operations to conflict?

  1. Both transactions are separate.
  2. The data item is the same for both of them.
  3. A write operation is present in at least one of them.
  4. All of the above

Answer: D) All of the above

Explanation:

All conditions must be met for the two operations to conflict:

  1. Both transactions are separate.
  2. The data item is the same for both of them.
  3. A write operation is present in at least one of them.

Discuss this Question

21. A ___ operation can be swapped for a conflicting one in the conflict equivalent.

  1. Conflicting
  2. Non-conflicting
  3. Serializable
  4. Non-serializable

Answer: B) Non-conflicting

Explanation:

A non-conflicting operation can be swapped for a conflicting one in the conflict equivalent.

Discuss this Question

22. When two schedules are conflict equivalent, the following conditions must be met?

  1. The transactions in both are identical.
  2. The same order should be followed in each pair of conflict operations.
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

When two schedules are conflict equivalent, the following conditions must be met:

  1. The transactions in both are identical.
  2. The same order should be followed in each pair of conflict operations.

Discuss this Question

23. ___ scheduling is achieved by completing T1 operations before undertaking any operations on S2.

  1. Serial
  2. Non-serial
  3. Serializable
  4. Non-serializable

Answer: A) Serial

Explanation:

Serial scheduling is achieved by completing T1 operations before undertaking any operations on S2.

Discuss this Question

24. By swapping ___ operations in S1, schedule S1 can be turned into a serial schedule.

  1. Conflicting
  2. Non-conflicting
  3. Serial
  4. Non-serial

Answer: B) Non-conflicting

Explanation:

By swapping non-conflicting operations in S1, schedule S1 can be turned into a serial schedule.

Discuss this Question

25. Serializable schedules are those that are viewed as equivalent to ___ schedules.

  1. Serial
  2. Non-serial
  3. Serializable
  4. Non-serializable

Answer: A) Serial

Explanation:

Serializable schedules are those that are viewed as equivalent to serial schedules.

Discuss this Question

26. A schedule can be serialized if it can ___ conflicts; otherwise, it can be serialized if it is viewable.

  1. Create
  2. Update
  3. Resolve
  4. Edit

Answer: C) Resolve

Explanation:

A schedule can be serialized if it can resolve conflicts; otherwise, it can be serialized if it is viewable.

Discuss this Question

27. ___ serializable contains blind writes when it doesn't conflict with serializable.

  1. Conflict
  2. Non-conflict
  3. View
  4. Non-view

Answer: C) View

Explanation:

View serializable contains blind writes when it doesn't conflict with serializable.

Discuss this Question

28. Views S1 and S2 are considered equivalent if they meet the following requirements:

  1. Initial Read
  2. Updated Read
  3. Final Write
  4. All of the above

Answer: D) All of the above

Explanation:

Views S1 and S2 are considered equivalent if they meet the following requirements:

  1. Initial Read
  2. Updated Read
  3. Final Write

Discuss this Question

29. The initial reading should be the ___ for both schedules.

  1. Same
  2. Different
  3. Partially Same
  4. Partially Different

Answer: A) Same

Explanation:

The initial reading should be the same for both schedules.

Discuss this Question

30. If in schedule S1, Ti is reading A from Tj, it should also read A from ___ in schedule S2.

  1. Ti
  2. Tj
  3. Ta
  4. Tb

Answer: B) Tj

Explanation:

If in schedule S1, Ti is reading A from Tj, it should also read A from Tj in schedule S2.

Discuss this Question

31. Both schedules must have the ___ final write.

  1. Same
  2. Different
  3. Serial
  4. Non-serial

Answer: A) Same

Explanation:

Both schedules must have the same final write.

Discuss this Question

32. If a transaction T1 updates A the last in S1, then T1 should also perform ___ writing operations in S2.

  1. Initial
  2. Final
  3. Middle
  4. Center

Answer: B) Final

Explanation:

If a transaction T1 updates A the last in S1, then T1 should also perform final writing operations in S2.

Discuss this Question

33. Software issues, system crashes, and hardware failures may cause a ___ not to execute completely.

  1. Transition
  2. Table
  3. Database
  4. Transaction

Answer: D) Transaction

Explanation:

Software issues, system crashes, and hardware failures may cause a transaction not to execute completely.

Discuss this Question

34. In the unlikely event that Ti commits before Tj commits, the schedule will be ___.

  1. Recoverable
  2. Irrecoverable
  3. Commit
  4. Rollback

Answer: B) Irrecoverable

Explanation:

In the unlikely event that Ti commits before Tj commits, the schedule will be irrecoverable.

Discuss this Question

35. In the scenario of Tj reading the updated value of Ti, the schedule will be ___ through cascading rollback.

  1. Recoverable
  2. Irrecoverable
  3. Serial
  4. Non-serial

Answer: B) Irrecoverable

Explanation:

In the scenario of Tj reading the updated value of Ti, the schedule will be recoverable through cascading rollback.

Discuss this Question

DBMS States of Transaction Multiple-Choice Questions
DBMS Log-Based Recovery Multiple-Choice Questions



Comments and Discussions!

Load comments ↻




Top MCQs
Top Programs/Examples
Top Tutorials
About
Student's Section
Subscribe

Copyright © 2024 www.includehelp.com. All rights reserved.