Computer Networks - Online Test
Q1. Which one of the following is not a client server application?
Answer : Option A
Explaination / Solution:
No Explaination.
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 A
Explaination / Solution:
No Explaination.
Q3. What is the appropriate pairing of items in the two columns listing various
activities encountered in a software li fe cycle?
P. Requirements Capture 1. Module Development and Integration
Q. Design 2. Domain Analysis
R. Implementation 3. Structural and Behavioral Modeling
S. Maintenance 4. Performance Tuning
Answer : Option B
Explaination / Solution:
No Explaination.
Q4. A system has n resources R0,…,Rn-1, and k processes P0,…..Pk-1. The
implementation of the resource request logic of each process Pi. is as follows:
if (i% 2==0) {
if (i<n) request Ri;
if (i+2<n)request Ri+2 ;
}
else {
if (i<n) request Rn-i ;
if (i+2<n)request Rn-i-2 ;
}
In which one of the following situations is a deadlock possible?
Answer : Option B
Explaination / 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 C
Explaination / 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 C
Explaination / 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 C
Explaination / Solution:
No Explaination.
