Class – XII

Computer Test 1
1. a) State the two absorption laws of and Prove it with help of truth table. [5]
b) Simplify using Boolean laws:
(A+B)’+(AB)’+A
c) Given F(A,B,C) = (A+B’+C) +(A’+B’+C)+(A+B’+C’)
Convert the function F into its cardinal form.
d)
Find the compliment of the following:
F=(X.Y) + (X’+Y’). X

2. The following is a function of some class. What will be the output for the function result() when
the value of count is equal to 3? Show the dry run/working. [5]
void result(int count)
{
if(count==6)
System.out.println(“#”);
else
{
System.out.println(“Out”+count);
result(++count);
System.out.println(“ ”+count);
}
}
3. a) Given the Boolean function: F ( P, Q, R, S ) = ∑ (2,3,5,6, 9,10,12,13,15 ) [5]
Use Karnaugh’s map to reduce the function F, using the SOP form. Draw a logic gate
diagram for the reduced SOP form. You may use gates with more than two inputs.
Assume that the variable and their complements are available as inputs.

b) Given the Boolean function X ( P, Q, R, S ) = ∏ (0,1,2, 3,4,5, 8,9,10,12,13,14). [5]

Use Karnaugh’s map to reduce the function F, using the POS form. Draw a logic gate
diagram for the reduced POS form. You may use gates with more than two inputs. Assume
that the variable and their complements are available as inputs.

4. . a) Draw the truth table and logic circuit diagram for a Decimal to Binary Encoder. [5]
b) Represent the Boolean expression X+YZ’ with the help of NOR gate only. [2]
c) Define the terms Contingency, Inverse and Contrapositive. [3]