ICSE/ISC Guess Papers Computer Science Class XII

  CHHATTISGARH BOARD » Model Papers » Class XII » Geography You are here

ICSE/ISC Guess Paper 2009

Computer Science

Class XII

 

Q.1. a) Simplify using Boolean algebra:

                        XY’ (X’ YZ+X(YZ)’+ ( XY)’Z)                                          10

         b) Write the minterm & maxterm for a function

               F(W,X,Y,Z) when W=O, X=0, Y=1, Z=1 

         c) Convert the following expression to Sum of Product.         

                                 X + X’Y+X’Z’                         

         d) Using NOR gates only, draw AND, OR and NOT gate.    

 

Q.2.                                                                                                                 10

(a)    Convert the following infix expression to its postfix form:

A + ((B+C)-(D+E)*F)/G

(b)   What is the principle of duality? Give one example.

(c)    Find the complement of F= X + Y.Z; then show that F.F’=0 and F+F’=1

(d)   Obtain the logic circuit of the following boolean expression using NOR gates only

F(X,Y,Z) = (X + Y).(Y + Z).(Z + X)

(e)    Write the product-of-sum for the Boolean function, F(A,B,C) whose output is 0 only when:

A=1, B=0, C=0; A=0, B=1, C=0; A=0, B=0, C=1; A=1, B=1, C=1

 

Q.3.     a) Given the following expression:

            F(u,v,w,z) = å (0, 1, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15)                                 10

i)                    Make the Karnaugh’s map for the given Boolean equation

ii)                  Simplify using k-map

b) A combinational circuit having 4 input and one output produces 1 when                           

(i)         All inputs are 1

(ii)        None of the inputs are 1.

(iii)       odd number of 1 inputs.

               Draw the truth table and represent in SOP and POS form.

 

Download Attached PDF