An 8-bit number in 2's complement form can represent values from \(-2^{n-1}\) to \(2^{n-1} - 1\).
Smallest value = \(-2^{8-1} = -2^7 = -128\)
The smallest integer that can be represented by an 8-bit number in 2's complement form is: -128
The NAND gate is functionally complete. It can be used to construct any logic gate (AND, OR, NOT, etc.) by combining multiple NAND gates.
The NOR gate is also functionally complete. It can be used to construct any logic gate (AND, OR, NOT, etc.) by combining NOR gates.
Both NAND and NOR gates are functionally complete.
We are asked to find the total number of binary functions that can be defined using n Boolean variables.
For n Boolean variables, the number of possible input combinations is 2n.
Each input combination can map to either 0 or 1, so there are 2 possible outputs for each of the 2n input combinations.
Total Binary Functions = 2(2n)
The total number of binary functions that can be defined using n Boolean variables is: 2(2n)
np = 4
npq = 2
q = 1/2, p = 1/2, n = 8
p(X = 1) = 8C1 (1/2)(1/2)7
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Commented Feb 06, 2021
1 Upvote 1 Downvote Reply
Your reply to this comment: