THE AKSHAYA ACADEMY CAMPUS
GRADE : XI SLIP TEST - 4 MARKS : 30
SUB : COMPUTER SCIENCE TIME : 1 hr
SECTION – A 8x1=8
1. Which gate produces 1 when all inputs are low ?
a) NOT b) AND c) NAND d) NOR
2. Which gate produces 0 when all inputs are HIGH ?
b) NOT b) AND c) NAND d) NOR
3. Gate XNOR can be simplified as :
a) XOR followed by OR b) XOR followed by NOT
c) NOT followed by XOR d) XOR followed by AND
4. NAND cannot implement ______ gate.
a) AND b) OR c) NOT d) All the above
5. The NOR gate produces ______ when all inputs are high.
6. State True or False : Inverted XOR is called the OR gate.
Q 7 and 8 are ASSERTION AND REASONING based questions. Mark the correct choice as
(a) Both A and R are true and R is the correct explanation for A
(b) Both A and R are true and R is not the correct explanation for A
(c) A is True but R is False (d) A is false but R is True
7. Assertion (A) :- NAND and NOR gates are also known as the universal gates.
Reasoning (R) :- All other gates can be represented through a combination of NAND gates or
NOR gates.
8. Assertion (A) :- If a Boolean expression is True ,then its dual is also True .
Reasoning (R) :- The duality principle states that every Boolean expression has a dual with
OR/AND exchanged and 0 / 1 exchanged.
SECTION – B 3x2=6
9. State and Verify Commutative law.
10. Sate and Verify Absorption law.
11. Name the law shown below and verify that using a truth table : A + BC = ( A + B ) ( A + C )
SECTION – C 1x3=3
12. a) Expand ASCII , ISCII
b) Derive the Boolean expression of the following :
SECTION – D
2X4=8
13. Given Boolean function ( A + B + C ) ( A1 B + B1 C1 )
1 1
a) Obtain truth table b) Draw the logic circuit diagram.
14. a) Draw a truth table for NAND gate and NOR gate.
SECTION – E 1+2+2
15. What are DEMorgan’s theorems ? Prove algebraically the DEMorgan’s theorems.