adplus-dvertising
frame-decoration

Question

What are the characteristics of transaction semantics ?

a.

Suitable for applications that are concerned about coherence of data

b.

The users of this model are interested in the atomicity property for their transaction

c.

Easy to implement in a single processor system

d.

Write-back enhances access performance

Posted under Operating System

Answer: (b).The users of this model are interested in the atomicity property for their transaction

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What are the characteristics of transaction semantics ?

Similar Questions

Discover Related MCQs

Q. What are non characteristics of session semantics ?

Q. The file once created can not be changed is called

Q. ______ of the distributed file system are dispersed among various machines of distributed system.

Q. _______ is not possible in distributed file system.

Q. Which one of the following hides the location where in the network the file is stored?

Q. In distributed file system, when a file’s physical storage location changes

Q. In distributed file system, _______ is mapping between logical and physical objects.

Q. In distributed file system, a file is uniquely identified by

Q. There is no need to establish and terminate a connection through open and close operation in

Q. In distributed file system, file name does not reveal the file’s

Q. Which one of the following is a distributed file system?

Q. In distributed systems, a logical clock is associated with

Q. If timestamps of two events are same, then the events are

Q. If a process is executing in its critical section

Q. A process can enter into its critical section

Q. For proper synchronization in distributed systems

Q. In the token passing approach of distributed systems, processes are organized in a ring structure

Q. In distributed systems, transaction coordinator

Q. In case of failure, a new transaction coordinator can be elected by

Q. In distributed systems, election algorithms assumes that