3 votes
3 answers
1
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true?...
5 votes
3 answers
3
#includeint main( ){int x=5, y=9;x=(x= x+y)-(y= x-y);printf("%d %d ", x, y);return 0;} A. 9 5B. 5 14C. 14 5D. 5 9
1 votes
1 answer
4
1 votes
1 answer
6
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0What is the solution?