Students of class XII-A (Comp Sci) are instructed to fill in the above textFields without fail.
Name :
Email Id :
Mobile :
-------------------------------------------------------------------------------------------------------------------------
KENDRIYA
VIDYALAYA ASHOK NAGAR, CHENNAI – 83
|
||
CLASS : XII-A
|
APRIL
MONTHLY TEST – 2015
|
MARKS : 25
|
SUB: CS
|
Instructions : All questions are
compulsory.
|
TIME : 45 MIN
|
1
|
Define Tautology and Fallacy.
|
|
2
|
Represent NOT gate using NOR gates
only.
|
2
|
3
|
What is duality principle. Write the dual of
Absorptive law.
|
2
|
4
|
Write
the output expression for S and Cout
|
2
|
5
|
Construct an XOR gate using NAND gates only.
|
2
|
6
|
State and verify Distributive I law in Boolean
Algebra.
|
2
|
7
|
Convert into
Canonical Product of Sum (POS) form. PQR + PQ’R + PQ’R’ + P’Q’R
|
2
|
8
|
Obtain a simplified form for a Boolean expression
F (a,b ,c,d) = ∏ ( 0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 15) using
Karnaugh Map.
|
2
|
9
|
There are four railway tracks at a place. Design a logic circuit,
which can give a signal when three or more trains pass together at any given
time.
|
2
|
10
|
Reduce the following Boolean Expression using K-Map: F(A,B,C,D)=S(0,1,2,4,5,6,8,10)
|
2
|
11
|
Reduce the following Boolean Expression using K-Map: F(U,V,W,Z)=P(0,1,2,4,5,6,8,10)
|
2
|
12
|
Construct a full adder using NOR gates only.
|
2
|
--------------------------------------------------------------------------------------------------------------------------
4. Write the equivalent Boolean Expression F for the following circuit diagram:
5. F(a,b,c,d)=Σ(0,2,4,5,7,8,10,12,13,15), obtain the simplified form using K-Map.
CLASS - XII A (Computer Science)
Assignment Code: CS120415 ( 20 marks )
Topic : Boolean Algebra
Topic : Boolean Algebra
1. Convert the following Boolean expression into its equivalent Canonical (SOP) Form
2. Convert the following Boolean expression into its equivalent Canonical Product of Sum form (POS):
A.B’.C + A’.B.C +A’.B.C’
3. Prove that XY+YZ+YZ’=Y algebraically
4. Express the F(X,Z)=X+X’Z into canonical SOP form.
5. Design (A+B).(C+D) using NAND Gate
6. Prove x’.y’+y.z = x’yz+x’yz’+xyz+x’yz algebraically.
7. A Boolean function F defined on three input variable X,Y,Z is 1 if and only if the number of 1(One) input is odd (e.g. F is 1 if X=1,Y=0,Z=0). Draw the truth table for the above function and express it in canonical sum of product form.
Assignment Code: CS160415 ( 20 marks )
Topic : Boolean Algebra
4. Write the equivalent Boolean Expression F for the following circuit diagram:
5. F(a,b,c,d)=Σ(0,2,4,5,7,8,10,12,13,15), obtain the simplified form using K-Map.
Date of submission : 20.04.2015 ( Monday ) before 12.00 Noon