Q2.Which of the following concurrency control protocols ensure both conflict
serializability and freedom from deadlock?
I. 2-phase locking II. Time-stamp ordering
Answer : Option AExplaination / Solution: No Explaination.
Q5.Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91
respectively and they both use the same net mask N. Which of the values of N
given below should not be used if A and B should belong to the same network?
Answer : Option CExplaination / Solution: No Explaination.
Q6.Consider a network with 6 routers R1 to R6 connected with links having
weights as shown in the following diagram
All the routers use the distance vector based routing algorithm to update their
routing tables. Each router starts with its routing table initialized to contain an
entry for each neighbour with the weight of the respective connecting link.
After all the routing tables stabilize, how many links in the network will never
be used for carrying any data?
Answer : Option CExplaination / Solution: No Explaination.
Q7.Consider a network with 6 routers R1 to R6 connected with links having
weights as shown in the following diagram
Suppose the weights of all unused links in the previous question are changed
to 2 and the distance vector algorithm is used again until all routing tables
stabilize. How many links will now remain unused?
Answer : Option CExplaination / Solution: No Explaination.
Total Question/Mark :
Scored Mark :
Mark for Correct Answer : 1
Mark for Wrong Answer : -0.5
Mark for Left Answer : 0