1) The law which represents the Boolean equation (A+A’) = 1 is [1]

2) The dual of the Boolean equation A+1+B’+C [1]

D. A.0.B’.C

3) If A=1, B=0, C=0 and D=1, then MINTERM will be [1]

4) The complement of the Boolean Expression is (A+B) (B+C) (A+C). [1]

5) The propositional operator <-> represents [1]

D. Bi-implication

6) (3X8) Decoders are used for: [1]     

7) Choose the correct expression For XNOR gate [1]

8) The combinational circuit which adds three binary bits is [1]

9) The octet group in a Kmap eliminates [1]

10) The Proposition [[(p(q) ^p](q is a [1]

11) the input in a decoder is AB’C’D’ , then the decimal equivalent output will be [2]

12) A character array B[7] [6] has a base address 1046 at 0, 0. Calculate the address at [B[2] [3] if the array is stored Column Major wise. Each character requires two bytes of storage

13) With reference to the given proposition ~P(~Q, answer the following questions:

The contrapositive of the proposition is: [1]

14) The inverse of the proposition is: [1]

15) dual of P’QR’ + PQ’R + P’Q’R is equal to the complement of [2]

16) State the final value of q after the execution of the given code [2]

int m,n,q=0,p;

    for(m=2;m<=3;++m);

    {

        for(n=1;n<=m;++n);

        {

            p=m+n-1;

            if(p%3==0)

            q+=p;

            else

            q+=p+4;

        }

    }

17) What is the output of the statement given below? [2]

System. out .print(Integer .parseInt(“234”)+’A’);

18) What is the output of the statement given below [2]

System. out. print(‘A’+’1’+’C’)

20) A square matrix is said to be a lower triangular matrix if all the entries above the =[diagonal are zero. The following code checks for whether mat array is lower triangular matrix and returns 1 if it’s a triangular matrix otherwise it returns 0

int check_ lower _triangular _matrix(int mat[N][N])

{

 int i, j;

 for (i = 0; i < N; i++)

  for (j = i + 1; j < N; j++)

   if (?????1??? ???2???)

    return 0;

return 1;

}

What should be replaced with ????!???? and ?????2?????

21) The proposition ( X⇔Z) . [(X⇒Y). (Y⇒Z) is a [2]

22) Reduce the given Boolean function F (A, B, C,D)=∑( (0, 2, 3, 4, 5, 8, 10, 11, 12, 13). By using 4-variable K-Map and answer the following questions:

what will be the least number of groups and their types formed for reduction? [1]

23. The reduced expression of the Boolean function given above is: [2]

24. The owner of a company pays the bonus to his salesmen as per the criteria are given below:

If the salesman works overtime for more than 4 hours but does not work on off days/ holidays.

                                                         OR

If the salesman works when festival sales are on and updates showroom arrangements.

                                                         OR

If the salesman works on an off day/holiday when the festival sales are on.

The inputs are:

O

Works overtime for more than 4 hours

F

Festival sales are on

H

Working on an off day/holiday

U

Updates showroom arrangements

(In all the above cases 1 indicates yes and 0 indicates no) [2]

The POS expression for X(O,F,H,U) will be

25) The maximum input combinations for the above truth table will be: [1]

26) Given the Boolean function : F(P, Q, R, S) = Π (0, 1, 3, 5, 7, 8, 9, 10, 11, 14, 15) by using 4 variable kmap answer the following questions    

What will be the least number of groups and their types formed for reduction [1]

27. The reduced expression of the Boolean function is [2]

28) Given the Boolean expression F = ( P + R) · ( P·Q + Q·R’ ), identify

The law used is: [1]