Q1.

Consider the following NPDA = ({q 0, q 1, q f}, {a, b}, {1, z}, δ, q 0, z, {q f})

δ(q 0, λ, z) = {(q f, z)}

δ(q 0, a, z) = {(q 1, 11z)}

δ(q 1, a, 1) = {(q 1, 111)}

δ(q 1, b, 1) = {(q 1, λ)}

δ(q 1, λ, z) = {(q f, z}

Which of the following Language L is accepted by NPDA?

Q2.

Consider the following statements:

Statement I: Conservative 2 PL is a deadlock-free protocol.

Statement II: Thomas's write rule enforces conflict serializability.

Statement III: Timestamp ordering protocol ensures serializability based on the order of transaction timestamps.

Which of the following is correct?