Consider the schedule R1(x), R2(x), W3(x), W1(x), R1(y), W1(y), W3(z), R2(z), W2(y), W2(z). Which of the following are correct.? a. Schedule is not recoverable, not cascadeless and not conflict serializable b. Schedule is not recoverable, cascadeless and not conflict serializable c. Schedule is recoverable, not cascadeless and not conflict serializable d. Schedule is recoverable, cascadeless and conflict serializable

Consider a system where processes can be dynamically created or terminated. A process can generate a new process. For example, Pi generates both P₂ and P3. Modify the happened-before relation and the linear logical clock scheme for events in such a dynamic set of processes.

Question 4: Write-ahead Log (15) Consider the following portion of a write-ahead log. In this log, UPDATE records are of the form UPDATE =; =. The system crashed after log ID 213; no further entries were written. Log-ID Trans-ID Record 200 100 UPDATE A=0; A=15 201 100 UPDATE B=0; B=15 202 100 COMMIT 203 101 BEGIN 204 101 UPDATΕ A-15; A-25 205 101 UPDATE B=15; B=20 206 102 BEGIN 207 102 UPDATE C=0; C=35 208 102 UPDATE D=0; D=20 209 102 СOMMIT 210 101 UPDATE D=20; D=55 211 101 UPDATE B=20; B=65 212 103 BEGIN 213 103 UPDATE C=35; C=70 /** CRASH **/ 1. After recovery, what are the values of A, B, C, and D? If it is impossible to determine the value for any of these variables, write "None" in the corresponding parameter. Please explain your answer. 2. Is log portion shown above consistent with a transaction processing system that is using two-phase locking? Explain your answer.

If a sporadic implicit deadline task set is schedulable under RM, will it be schedulable under RM after enlarging one of the deadlines (now it becomes an arbitrary deadline task set)? Note that we are still following the original RM priority order (not DM). What if we follow DM order?