11 answers
2
5 answers
4
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
4 answers
5
If we have 3 bits in the subnetid then how many subnets we have..??6 or 8?
9 answers
10
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...
4 answers
12