0 votes
3 answers
91
0 votes
0 answers
93
Calculate the shortest path using TSP Greedy Appraoch
1 votes
1 answer
94
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having confusion How to solve using dy...
0 votes
1 answer
96
What is this Needham Schroeder and what is this Millicent ?
0 votes
1 answer
97
somebody please tell what is this Kerberos ?
1 votes
1 answer
98
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
0 votes
1 answer
99
0 votes
0 answers
100
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
1 votes
2 answers
101
0 votes
2 answers
102
S - AA | BA- BB | S B- c | ab
1 votes
1 answer
104
1 votes
1 answer
106
0 votes
0 answers
107
Consider the fuzzy set Sweet,where "Sweet" = {(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)}.Find the corresponding "...
1 votes
1 answer
108
$\begin{bmatrix} 0& 29& 19& 25& 22\\ 20& 0& 21& 23& 21\\ 19& 21& 0& 21& 20\\ 25& 23& 21& 0& 32\\ 22& 21& 20& 22& 0 \end{bmatrix}$Find the shortest tour for given graph us...
1 votes
1 answer
109
1 votes
1 answer
110
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}Given the capacity is 5,{W/M = 5 } Find the optimal solu...