# Recent posts in Digital Logic

1
oops ... I have edited the answer Please check it again ...
2
Logic Gates [closed]
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
3
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
4
Let page size = 2p bytes (p is page offset ) now, number of page entries in 1st level = 2p / 4 = 2p-2 bytes (as it uses 32 bit = 4 byte Physical address) Similarly in 2nd level -> 22(p-2) and considering 3rd level it would be 23(p-2) so, 23(p-2 ... any two synonym to map with same set they should be colored with same color of that respective set. So minimum we need 8 colors for this mapping. (C)
To see more, click for the full list of questions or popular tags.