2 answers
1
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
5 answers
2
3 answers
4
1 answer
7
Memory=1GB16 bit processorSystem is byte addressableHow many address lines required?I think 30 should be the ans as though processor is of 16bit but system is byte addre...
1 answer
8
Bias formula for floating point representation is 2^k-1bias formula for IEEE floating point representation is 2^(k-1)-1 Is it right????
0 answers
11
0 answers
13
whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex.I think this is wrong as this statemnt is nit valid for graph...
0 answers
14
Someone please give the formula for average memory access time when there is Tlb, cache memory and pagefault all 3 things are considered. Because i m confuse in few thin...
1 answer
15
1 answer
16
How to solve it?
1 answer
17
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
1 answer
18
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?
7 answers
22