2 votes
0 answers
1
the sequence is shown, the element at the lowest level?
3 votes
1 answer
2
2 votes
0 answers
3
3 votes
0 answers
4
Actually, In this problem what will, we consider getting the answer(upper bound or lower bound) and why?
2 votes
0 answers
5
please describe in detail I have no idea how to find rank of the node?
2 votes
1 answer
6
4 votes
2 answers
7
3 votes
0 answers
8
4 votes
0 answers
9
2 votes
0 answers
10
4 votes
0 answers
11
2 votes
1 answer
12
3 votes
1 answer
14
No. Of serial schedules view equal to SS: R1(A), R3(D), W1(B), R2(B), W3(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) .If possible please provide detailed solutions.Thank...
3 votes
0 answers
15
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
1 votes
1 answer
16
1 votes
2 answers
17
1 votes
1 answer
18
1 votes
1 answer
19