1 answer
5
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. Howbig will the window be if the next four transmission bursts are all successful? Assumethat...
2 answers
6
7 answers
8
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k 0$ which is independent of $n$, the time taken would be?$\Theta(n)$$\T...
7 answers
10
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
1 answer
12
T(n)=3T(n/4)+nlognIn this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
12 answers
14
2 answers
25
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is:$...