Crowdly
Add to Chrome
Questions Bank (1229730 total)
Self complementing codes are:
The given network is :I. Valid gate networkII. Z= III. Invalid gate network IV. There are 3 levels in the network.
A Boolean expression of n variables would require a K-map of size:
How many bits are required to cover the numbers from +63 to -63 in one’s complement representation?
Minimum no of bits required for binary coding of date (month, day, year till 2500):
The decimal value of single precision representation with S=0, E=10000 0011, M=1100…...0 is:
What does represent in the decimal number system?
The Boolean expression can be simplified to:
For the function I. Prime Implicants are : II. Essential Prime Implicants are: III. Prime Implicants are: IV. Essential Prime Implicants are:
Match the following:Column A Column BI. Load i) Number of gates connected at the output of a moduleII. Size of the network ii) Critical pathIII. No. of levels iii) Depends on the number of inputs to a gate