Professional Documents
Culture Documents
Java 2
Java 2
Java 2
1|Page
UNIT 1(11 MARKS)
1. Simplify the Boolean function F(W,X,Y,Z) = ∑(1, 3, 7, 11, 15) and don’t care
conditions d(w, x, y, z) = ∑(0, 2, 5).
2. Simplify the Boolean function by using the tabulation method
F = ∑(0, 1, 2, 8, 10, 11, 14, 15).
3. Simplify the Boolean function F (A, B, C, D) = ∑ m(0, 2, 3, 6, 7, 8, 10, 12, 13)
4. State and prove the theorems of Boolean Algebra with illustration.
5. Convert the following numbers to the indicated bases.
(a) Decimal 225tobinary, octal and hexadecimal.
(b) Binary11010111 to decimal, octal and hexadecimal.
6. Simplify the following expression using K-map.
(a)F(x,y,z) = ∑(1,2,3,6,7)
(b)F(x,y,z) = ∑(0,1,5,7)
(c)F(w,x,y,z)= ∑(2,3,12,13,14,15)
7. Determine the prime implicants of the function
F(W,X,Y,Z) =∑(1,4,6,7,8,9,10,11, 15).
8. Explain Minterm and Maxterm in detail?
9. Explain the algorithm for subtraction using 10’s Complement method and also
find out the following using the same.
(a) (72532 – 3250)10
(b) (3250 – 72532)10
10. Explain Quine-McCluskey method with example?
2|Page
3|Page
4|Page
5|Page
6|Page
7|Page
8|Page
9|Page
10 | P a g e
11 | P a g e
12 | P a g e
13 | P a g e
14 | P a g e
15 | P a g e
16 | P a g e
17 | P a g e
18 | P a g e
19 | P a g e
20 | P a g e
21 | P a g e
22 | P a g e