0 votes
0 answers
1
WHAT IS A VALID ITEM FOR A VIABLE PREFIX?CAM SOMEONE EXPLAIN IN EASY WAY.
0 votes
1 answer
5
we do forwarding from WB stage to EX or from WB to MEM stage??
0 votes
0 answers
7
I am unable to understand the memory access time for hierarchical and simultaneous access using write back policy even after reading from go sources. Can someone plz expl...
1 votes
1 answer
9
Which book is good for numerical problems for computer networks for GATE?
5 votes
3 answers
13
0 votes
1 answer
17
What is the output of this program?int main(void){int a = 10, b = 20, c = 30;printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2));return 0;}(A) 60..40..60(B) 110..40..60(C...
0 votes
1 answer
19
If both of the algorithms A and B need O(nlogn) time then theyboth are equally efficient and finish in same amount of time.TRUE OR FALSE
0 votes
1 answer
20
Find the complexity of the following code fragment:int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }