0 votes
1 answer
1
Could you please differentiate below. Memory access time.hit time. search time??Arey yar some one answer this.. why so dumb
0 votes
1 answer
2
How to implement indirect addressing mode using register indirect addressing mode???
1 votes
0 answers
3
Previous comments are disappearing after clicking on the "show previous 11 comments" ...
0 votes
0 answers
4
Fully associative cache yields no conflict misses?? Or yields very very very very less conflict misses
1 votes
1 answer
6
BigO notation ofT(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
0 votes
1 answer
7
Please list the problems where BFS alone can do and DFS alone can do and both can do??
1 votes
0 answers
8
Hey How is Gateoverflow test series .. better than other institutes, that means little harder than gate and quality of questions??. #Genuine answers please…
2 votes
1 answer
9
Could you please explain How we can implement indirect addressing mode using Index addressing mode.. and vice versa..??
0 votes
1 answer
10
HowProgress+bounded waiting staration free??
0 votes
0 answers
11
why option one is correct??
0 votes
0 answers
12
DFS and BFS are equal in expressive power??? I(Independent on performances)??
0 votes
1 answer
13
We know vfork() shares parents memory..Does vfork() shares parents resources also??.What about the clone()??
0 votes
0 answers
14
The time complexity of Build heap using linked list and Binary search tree construction using linked list????.Need some detailed explanation
0 votes
0 answers
15
How FAT(File allocation table) suffers from internal fragmentation??