0 votes
0 answers
61
In case of conditional branch only PC is updated with the target address and there is no need to store the old PC value into the memory.Why is it like that? if we dont sa...
0 votes
0 answers
63
0 votes
0 answers
64
2 votes
1 answer
65
Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 an...
0 votes
0 answers
67
1 votes
0 answers
68
A symmetric matrix has n eigenvalues and there exist n linearly independent eigenvectors (because of orthogonality) even if the eigenvalues are not distinct.Can we infer ...
0 votes
0 answers
69
https://gateoverflow.in/394/gate2008-84Here option A also leads to infinite loop right?it gets stuch at index 8because 8 + 9 / 2 = 8it never reaches 9
0 votes
1 answer
74
Assume that CISC processor contains 10 global registers, 10 local registers, 6 In register and 6 Out register. It contain 4 register windows what is the size of window an...
0 votes
0 answers
75
How fibonacci timecomplexity on dynamic approach and recursive approach is differentCouldnt understand the algo properly If someone could help :)
0 votes
0 answers
76
Sorting that will work best for powers of base n
0 votes
1 answer
77
T(n) = T(sqrt(n)) + nTaking 2m = n we can convert this as S(m/2) + 2mafter this how to solve by masters?
7 votes
4 answers
78
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6.......
2 votes
0 answers
79
To reduce compulsory misses , increase the cache line sizeHow does that workive already read some of the discussions here but still not clear with how it works
3 votes
1 answer
80
Merge sort using linked list is better than array in terms of space complexitytrue or not with explanation :)