Essa empresa é sua?
Given a tree of 2-bit adders (no branching and looping), how would write an algorithm to reduce its over all delay?
Sigiloso
Identify the primary inputs to the adders, which will give you an equation of e.g. three 2-bit adders in series will be X = ((A + B) + C) + D), then rearrange this equation into 2 adders in parallel and in series with the third one e.g. X = (A + B) + (C + D). Perform breath first search on the tree while identifying all the primary inputs, then create a new tree with later arrangement.