Sonali posted an Question
September 29, 2020 • 20:55 pm 20 points
  • UGC NET
  • Computer Science & Applications

And t, consider the following schedule for transactions t, 1 t2 t, read(x read (y) read(y) write(y) e.com write(x) write(x) read(x) write(x) which one of the sc

and T, Consider the following schedule for transactions T, 1 T2 T, Read(X Read (Y) Read(Y) Write(Y) e.com Write(X) Write(X) Read(X) Write(X) Which one of the schedules below is the correct serialization of the above? T,T T (C)T- T, -T, (B) T T,T (D) T,-»T, T (A) lo com 1 Call us: 7665435300 77

1 Answer(s) Answer Now
  • 0 Likes
  • 6 Comments
  • 0 Shares
  • comment-profile-img>
    Nabeela best-answer

    firs tmake the graph based on these transaction.. if it contains cycle then it is not conflict serializable else it is...if it is CS , then arrange them according to topological sorting

    eduncle-logo-app

    do you know how to make a graph to check CS

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers