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?

A. Maximum distance in the routing table of the node
B. Minimum distance in the routing table of the node
C. Infinite distance that is unreachable
D. Total sum of the distances in the routing table

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

A. Routing tables have entry for only immediate neighbouring nodes
B. Routing tables have entry for all the nodes in the network
C. Routing tables have entry for those nodes who have minimum distance
D. Routing tables have entry for those nodes who have maximum distance

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

A. Finding shortest paths
B. Using less setup
C. Using local knowledge
D. Using hop count metric

How tables are updated in the distance vector routing algorithm?

A. Using flooding technique
B. By retrieving the information from all the nodes directly
C. By interchanging the information with neighbour nodes
D. By exchanging the information with a central device

What is the other name for distance vector routing algorithm?

A. Ford and fullman algorithm
B. Bellman €? ford algorithm
C. Ford and fulkerson algorithm
D. Bellman €? fulkerson algorithm

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?

A. It does not ensure mutual exclusion
B. It does not ensure bounded waiting
C. It requires that processes enter the critical section in strict alternation
D. It does not prevent deadlocks but ensures mutual exclusion

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)?

A. 1
B. 2
C. 3
D. None of the mentioned

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process P0 while(true) { wait(S0); print '0'; release(S1); release(S2); } Process P1 wait(S1); release(S0); Process P2 wait(S2); release(S0); How many times will P0 print ‘0’?

A. At least twice
B. Exactly twice
C. Exactly thrice
D. Exactly once

The code that changes the value of the semaphore is ____________

A. Remainder section code
B. Non €? critical section code
C. Critical section code
D. None of the mentioned

If the semaphore value is negative ____________

A. Its magnitude is the number of processes waiting on that semaphore
B. It is invalid
C. No operation can be further performed on it until the signal operation is performed on it
D. None of the mentioned