Quiz Space

Database Management Systems · End Term · 10 May 2026 · January 2026 term · Set 1

Question 6: Schedule S is as given: Which of the following options is…

Question 6

+3 marksOne or more correct options

Schedule S is as given:

Which of the following options is/are correct?

Schedule S is as given:

Select all that apply.

  1. A

    Schedule S is not conflict serializable.

  2. B

    Schedule S can be two-phase lockable.

  3. C

    Two phase lockable schedules are always serializable.

  4. D

    Schedule S is not two-phase lockable.

Show answer

Correct answers

  • A

    Schedule S is not conflict serializable.

  • C

    Two phase lockable schedules are always serializable.

  • D

    Schedule S is not two-phase lockable.

See the whole paperTake it as a mock test

Question 6 of 20 in the IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 10 May 2026, in the January 2026 term (Database Management Systems 06 May 26). It carries 3 marks.

More questions from this paper

  1. Q1Consider a B-tree index to be built on the attribute EmployeeID of a table Employees, with the following properties: • …
  2. Q2Consider the table BandRecords as given below: Let us create two different bitmap indices, one on the Tour attribute an…
  3. Q3Consider the relational schemas Student, Course and Enrolled: Now consider the following SQL query: The query returns:
  4. Q4Consider the hash functions given below. • • • • Identify the hash function(s) that can generate unique hash values for…
  5. Q5Consider the definition of the table Products: The following sequence of queries is executed on this table: Which of th…
  6. Q7Consider a relation schema T(A,B,C,D,E,F) and the set of functional dependencies, F= {A → BC, C → D, D → C, B → E, E → …
  7. Q8Consider the following monthly backup schedule used by a company: If a failure occurs on the 24th day of the month afte…
  8. Q9Consider the instance of a relation V. Which among the following functional dependency set(s) can be inferred from the …
  9. Q10Consider the following relational schema: Choose the correct SQL query to find the names of departments where the total…
  10. Q11Choose the relational algebra expression that is equivalent to the following tuple calculus expression:
  11. Q12Consider a B+ tree index built on the key attribute of a data file having 62,50,000 records. Let the order of the B+ tr…
  12. Q13Choose the correct statement(s).
  13. Q14Consider the ER Diagram as shown below: Which of the following statement(s) is/are correct?
  14. Q15Consider the given log records at an instance of time: Suppose there is a system crash after the last log record. What …
  15. Q16Consider you have a file in your hard disk of size 900 KB. Seek time of your hard disk read head is 5 ms and rotational…
  16. Q17Consider a system using the Most Recently Used (MRU) page replacement policy. The system has a main memory buffer with …
  17. Q18Consider the following schedule S with five transactions T1, T2, T3, T4, T5: Where, Ri(X) denotes a read operation by t…
  18. Q19Consider the relation R(A, B, C, D, E, F) and the following functional dependencies set F = {AB → C, C → D, D → E, E → …
  19. Q20Consider a block nested-loop join for the two relations students and enrollments: Assuming the worst-case memory availa…