The set of ________ in a precedence graph consists of all the transactions participating in the schedulea.None of theseb.Verticesc.Directionsd.Edges

Transactions: precedence graphsWe consider the following schedule:T1W(D)W(C)R(D)T2W(A)W(C)R(B)T3W(A)W(B)Determine the precedence graph of this schedule. Write the graph in the following format:T1 -> T3T2 -> T3

Consider the following transactions with data items P and Q initialized to zero:T1: read (P) ;read (Q) ;if P = 0 then Q : = Q + 1 ;write (Q) ;T2: read (Q) ;read (P) ;if Q = 0 then P : = P + 1 ;write (P) ;Any non-serial interleaving of T1 and T2 for concurrent execution leads toA serializable scheduleA schedule that is not conflict serializableA conflict serializable scheduleA schedule for which a precedence graph cannot be drawn

If vertices 2, 3 and 4 are added in the queue in the given order during the BFS visit, which vertex will be marked as visited first? Vertex 2 will be marked as visited first. Vertex 3 will be marked as visited first. Vertex 4 will be marked as visited first. None of the three given vertices will be marked as visited first.

A graph can be defined as a collection of:a.Verticesb.Edgesc.Both vertices and edgesd.None of the above

In a project, a network diagram shows the ------------ relations of theinter related activities along with their corresponding activity times. deterministic and probabilistic precedence or succession union and intersection dummy and artificial