Sie sind auf Seite 1von 3

# BOE-II TUTORIAL SHEET ECE/EEE/CSE

## (a) (4310)5 (e) (10110.0101)2 (i) (1010.1010)2

(b) (198)12 (f) (16.5)16 (j) (BABA)16
(c) (735)8 (g) (26.24)8 (k) (ABCD)16
(d) (525)6 (h) (FAFA.B)16

## (a) 7562.45 to octal

(c) 175.175 to binary
3. Convert the hexadecimal number F3A7C2 to binary and octal.
4. Add and multiply the following numbers without converting to decimal. (110110) 2 and (110101)2
5. Determine the value of base x if (211)x = (152)8.
6. Determine the value of base x if (55)x = (30)10.
7. Determine the value of base x if (257)x = (140)10.
8. Determine the value of base x if (48)x = (120)8.
9. Determine the value of x (103)8- (45)8 = (x)5
10. Determine the value of x (4A)16 + (77)16 = (x)9
11. Describe in brief for AND,OR,NAND,NOR.
(i) Symbol, output function in term of inputs, Truth Table, enable and disable logic.
(ii) Whether it follow commutative law and Associative Law.
12. Proof that NAND and NOR as Universal Gate.
13. Convert the hexadecimal number 68BE to binary, and then convert it from binary to octal.
14. Convert the decimal number 431 to binary in two ways:
(a) Convert directly to binary
(b) Convert first to hexadecimal and then from hexadecimal to binary. Which method is faster?
15. The contents of a four-bit register are initially 1011. The register is shifted six times to the right, with
a serial input being 101111. What are the contents of the register after each shift.
16. Simplify the following Boolean function 𝑇1 𝑎𝑛𝑑 𝑇2 to a minimum number of literals:

17. Write Boolean expressions and construct the truth tables describing the outputs of the circuits
described by the following logic diagrams.
23. Simplify the following Boolean function to a minimum number of literals
(a) xy + xy' [ x]
(b) (x + y)(x + y') [ x]
(c) xyz + x'y + xyz' [ y]
(d) (A + B)'(A' + B') [ 0]
(e) xyz' + x'yz + xyz + x'yz' [ y]
(f) ABC + A'B + ABC' [ B]
(g) (𝐴 + 𝐵 + 𝐶) + (𝐵 + 𝐶) [0]
(h) (A+B+C)(A+B) [A+B]
(i) 𝐴B(𝐷 + 𝐶𝐷) +B(A +𝐴CD) [B]
(j)𝑋𝑌 + 𝑋𝑌𝑍 + 𝑋(𝑌 + 𝑋𝑌) [0]
(k)𝐴𝐵𝐶 + 𝐴𝐵 + 𝐵𝐶 [𝐴𝐵 ]
(l) (B+BC)(B+𝐵C)(B+D) [B]
(m) 𝐴𝐵𝐶 + 𝐴𝐵 + 𝐴(𝐵 + 𝐴𝐵) [0]
24. prove the following Boolean function to a minimum number of literals
(a) x'yz + xz = z(x + y)
(b) (x + y)'(x' + y') =x'y'
(c) xy + x(wz + wz') = x(w + y)
(d) (BC' + A'D)(AB' + CD') = 0
(e) (x + y' + z')(x' + z') = z' + x