Aspire Faculty ID #18798 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

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?

Solution

Statement I:

Conservative $2PL$ means Conservative Two Phase Locking.

In this protocol, a transaction obtains all required locks before it starts execution.

If all locks are not available, the transaction does not start.

Because a transaction does not hold some locks while waiting for other locks, circular wait cannot occur.

So, Conservative $2PL$ is deadlock-free.

Therefore, Statement I is true.

Statement II:

Thomas's write rule is a modification of timestamp ordering.

It allows some obsolete write operations to be ignored.

Because of this, it can generate schedules that are view serializable but not necessarily conflict serializable.

So, Thomas's write rule does not enforce conflict serializability.

Therefore, Statement II is false.

Statement III:

Timestamp ordering protocol assigns a timestamp to every transaction.

The serial order of transactions is decided according to their timestamps.

So, it ensures serializability based on the timestamp order.

Therefore, Statement III is true.

Hence, Statement I and Statement III are true, and Statement II is false.

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Consider the following:List IList II(A) Stack algorithm(I) Deadlock(B) Elevator algorithm(II) Disk scheduling(C) Priori…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider the following algorithms and their running times:List IList II(A) Breadth First Search(I) $\theta(V+E)$(B) Rab…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Match List I with List II:List IList II(A) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Match List I with List II:List IList II(A) BIND(I) Block the caller until a connection attempt arrives(B) LISTEN(II) Gi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Match List I with List II:List IList II(A) DES(I) Key size - 256(B) AES(II) Key size - 1024(C) 3 DES(III) Key size - 56…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Match List I with List II:List IList II(A) Firmware(I) Number of logical records into physical blocks(B) Batch file(II)…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Match List I with List II: List I List II (A) Least frequently used (I) Memory is distributed among processors (…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Match List I with List II:List-IList-II(A) Ontological Engineering(I) Organizing subclass relations(B) Taxonomy Hierarc…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Match List I with List II:List IList II(A) Type 0(I) Finite Automata(B) Type 1(II) Turing Machine(C) Type 2(III) Linear…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
1
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider the following statements:Statement I: LALR parser is more powerful than canonical LR Parser.Statement II: SLR …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Consider the following statements about Context Free Language (CFL):Statement I: CFL is closed under homomorphism.State…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the following in Boolean Algebra$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$$Y:a\land(b\lor(a\land c))=(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
A good software requirement specification does NOT have the characteristic
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R):Assertion (A):…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Of the following, which is NOT a logical error?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R):Assertion (A):…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Which statement is false?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...