0 — Test 305

Each process Pi, i = 0,1,2,3,……,9 is coded as follows. repeat P(mutex) {Critical Section} V(mutex) forever The code for P10 is identical except that it uses V(mutex) instead of P(mutex). What is the largest number of processes that can be inside the critical section at any moment (the mutex being initialized to 1)?

Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes. Process P1 : while(true) { w1 = true; while(w2 == true); Critical section w1 = false; } Remainder Section Process P2 : while(true) { w2 = true; while(w1 == true); Critical section w2 = false; } Remainder Section Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?

What is the other name for distance vector routing algorithm?

How tables are updated in the distance vector routing algorithm?

Which of the following is not a similarity between flooding and distance vector routing?

Which statement is correct about routing tables in distance vector routing?

What is the default distance between two nodes in the initial routing table, if these two nodes are not immediate neighbors in distance vector routing?

What update can it be called, if a node sends its routing table to its neighbors if there are any modifications in the routing table?

Which protocols are considered as intra-domain routing protocols?

Which technique can be used in multicast routing to overcome the problem of count-to-infinity which occurs in distance vector routing?