-
7.
last reply by CpjJwWHV • 12 years ago • asked in Computer Science And Engineering, 2010
View Comments [10 Reply]
-
8.
last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2010
View Comments [12 Reply]
-
9.
-
10.
last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2010
View Comments [3 Reply]
-
11.
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram.
[1] 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?
[2 marks]
(A) 4
(B) 3
(C) 2
(D) 1[2] 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? [2 marks]
(A) 0
(B) 1
(C) 2
(D) 3last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2010
View Comments [3 Reply]
-
12.
A hash table of length 10 uses open addressing with hash function h(k) = k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below.
0 1 2 42 3 23 4 34 5 52 6 46 7 33 8 9
[1] Which one of the following choices gives a possible order in which the key values could have been inserted in the table? [2 marks]
(A) 46, 42, 34, 52, 23, 33
(B) 34, 42, 23, 52, 33, 46
(C) 46, 34, 42, 23, 52, 33
(D) 42, 46, 33, 23, 34, 52[2] How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above? [2 marks]
(A) 10
(B) 20
(C) 30
(D) 40last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2010
View Comments [5 Reply]