ASSIGNMENT

1. Find:

a) The 7's complement of the base-8 number "45201"

b) Multiplication of base-12 numbers "541" and "3"

c) Base-10 unsigned number "214.45" to its base-2 representation

d) Base-6 number "513" to its base-10 and then base-5 representations

e) Hexadecimal number "AF6" to its base-2 and base-8 representations

2. Convert 59.7210 to BCD.

3. Convert 8B3F16 to binary.

4. The BCD number for decimal (347) is

5. The sum of 11101 + 10111 equals ________.

6. The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101; its
decimal representation is

7. Find 1’s and 2’s complement of the following 8 digit binary numbers

a. 10101110
b. 10000001
c. 10000000

8. P is a 16-bit signed integer. The 2's complement representation of P is (F87B)16.The 2's

complement representation of 8*P

9. Consider the equation (123)5 = (x8)y with x and y is unknown. The number of possible
solutions is _____ .

10. The 2’s complement representation of decimal value -15 in 8 bits is…
11. If N2 = (7601)8 where N is a positive integer, then the value of N is

a.(241)5 b.(143)6 c.(165)7 d.(39)16

12. In 2’s complement representation the number 111100101 represents the decimal
number

13.No of bits required to represent (-64)10 in 2’s complement form:

14. The number of distinct Boolean expressions of 4 variables is ……
15. Which logic gate is used to detect overflow in 2's complement arithmetic?
16. The smallest integer that can be represented by an 8-bit number in 2’s complement form
is
17. Let A = 1111 1010 arid B = 0000 1010 be two 8-bit 2's complement numbers. Their
product in 2's complement is
18. Using a 4-bit 2’s complement arithmetic, which of the following additions will result in
an overflow? (i) 1100 + 1100 (ii) 0011 + 0111 (iii) 1111 + 0111
19. Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n.

20. The addition of 4-bit, two's complement, binary numbers 1101 and 0100 results in

21. The number of 1’s in the binary representation of (3*4096 + 15*256 + 5*16+3) are:

22. The K-map for a Boolean function is shown in the figure. The number of essential prime
implicants for this function is f=∑m (0,1,2,6,8,10,12)

23. The Boolean function Y=AB+CD is to be realized using only 2-input NAND gates. The
minimum number of gates required is

24. In the sum of products function f (x,y,z) = ∑m (2,3,4,5), the prime implicants are

25. The Boolean expression (X+Y) (X+Y’) +((XY’)+X’)’ simplifies to

26. For an n - variable Boolean function maximum number of prime implicants is

27. The minimized form of the logical expression A’B’C+B’C’+A’BC’+A’BC+ABC’

1
Sumedha IT Confidential Information
28. A Boolean function 'f' of two variables x and y is defined as follows: f (0,0) =f(0,1)
=f(1,1)=1;f(1,0)=0 Assuming complements of x and y are not available, a minimum cost
solution for realizing F using only 2-input NOR gates and 2-input OR gates (each having unit
cost) would have a total cost

29. Consider the Boolean function,

F(w, x, y, z)=wy+ xy+w¯xyz+w¯x¯y+xz+x¯y¯z¯ write essential prime implicants.

30. The four variable function f is given in terms of min-terms as:

f (A B C D) = ∑m (2,3,8,10,11,12,14,15.) Using the K-map minimize the function in

the sum of product form. Also, given the realization using only two-input NAND
gates.

31. Minimum number of 2-input NAND gates required to implement the function, f=(X’+Y’)
(Z+W) is

32. The minimum number of 2-input NAND gates required to implement the Boolean
function Z=AB’C, assuming that A, B and C are available

33.

y=?

2
Sumedha IT Confidential Information
34.For the logic circuit shown in the figure, the required input condition (A, B, C) to make
the output X =1 is

a. 1,0,1 B.0,0,1 c.1,1,1 d. 0,1,1

35. If f(w,x,y,z) such that f(w,0,0,z)=1 ,f(1,x,1,z)=x+z ,f(w,1,y,z)=wz+y. The number of

literals in the minimal SOP expression of f is...

3
Sumedha
SumedhaITITConfidential
ConfidentialInformation
Information