Recent posts tagged post-gate

Let N(n) be the no of leaves in a binary tree which has n internal nodes of degree 2 Now consider the base condition to be N(1)=2 i.e. a BT where I have only one root nod...

$2(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.

In TCP, a unique sequence number is assigned to eachbytewordsegmentmessage

hmm...you are correct. I have edited the answer, please check if now it looks correct ?

Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...