binary codes for decimal digits require a minimum of .. bits

It's possible to assign negative weights to a decimal code

the weighted code 5043210 is called

A decimal code that has been used in some old computers is

The bits obtained from conversion are

the conversion of decimal 13 is

the coding of decimal 13 is

the excess-3, 2,4,2,1 and the 8,4,-2,-1 are self-complementary codes

the biquinary code is an example of ... bit code with error detection properties

The binary logic is equivalent to Boolean algebra.

There are two basic logical operations: AND and OR.

NOT operation is represented by a prime.

( X' = Z ) means that Z is what X is not.

In the earliest computers, switches were opened and closed by magnetic fields produced by energizing coils in relays. The switches, in turn, opened and closed the current paths.

Simplify : (A+B)' . (A' + B' )' =

Minimize the following boolean function : F(A, B, C, D) = Σm(1 , 3 , 5, 7 , 9 ) + Σd(6 , 12 , 13 )

simplify the boolean expression: A' B' C' D' + A C' D' + B' C D' + A' B C D + B C' D