0% found this document useful (0 votes)
57 views1 page

Class 11 Revision Worksheet 1

This document is a worksheet for Class 11 Computer Science covering Boolean Algebra, logic circuits, number systems, and propositional logic. It includes questions on truth tables, logic gates, and simplifications using Boolean laws. Additionally, it addresses criteria for awarding a medal based on specific conditions related to citizenship and service.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views1 page

Class 11 Revision Worksheet 1

This document is a worksheet for Class 11 Computer Science covering Boolean Algebra, logic circuits, number systems, and propositional logic. It includes questions on truth tables, logic gates, and simplifications using Boolean laws. Additionally, it addresses criteria for awarding a medal based on specific conditions related to citizenship and service.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

COMPUTER SCIENCE

WORKSHEET 1 (Chapter 1, 2)
CLASS 11

Q1. a) State the two complement properties of Boolean Algebra. Verify any one of them using the truth table.
b) State DeMorgans law and prove anyone using truth table.
c) Differentiate between a tautology and a contradiction.
d) Show that x V ~(y Ʌ x) is a tautology.
e) Draw the logic circuit of a 3-input XOR gate.
f) Find the complement of the following Boolean function:
F1 = AB’ + C’D’
g) Write the dual of P’QR’ + PQ’R + 0 = P +1.
h) If p denotes “It is below freezing” and q denotes “It is snowing” then express the following statement in symbolic
forms :
i. It is below freezing but not snowing.
ii. If it is below freezing, then it is also snowing.
i) Define Octal and Hexadecimal number system with an example.
j) Define radix of a number system.
k) If (~P ➔ Q) then write its:
i. Inverse ii. Converse

Q2 A Government institution intends to award a medal to a person who qualifies any one of the following criteria:
• The person should have been an Indian citizen and had lost his/her life in a war but had not completed 25 years
of service. OR
• The person must be an Indian citizen and has served the nation for a continuous period of 25 years or more but
has not lost his/her life in a war. OR
• The person is not an Indian citizen but has taken active part in activities for the upliftment of the nation.
INPUTS ARE :
A : The person is/was an Indian citizen.
B : Has continuous service of more than 25 years.
C : Lost his/her life in a war.
D : Taken part in activities for upliftment of the nation.
OUTPUT IS :
X : denotes, denotes eligible for medal. In all the above cases 1 indicates yes and 0 indicates no.
Draw the truth table for the inputs and outputs given above. Derive the terms with conjunctive operators for each
of the true values (1’s) from the output Column. Also, write a propositional expression by joining the terms with disjunction
operators.

Q3. a) Convert (ABC.45)16 = ( )2


b) (101011)2 * (1010)2 = ( )2
c) (100.25)10 = ( )16
d) Divide 11010 by 101
e) Add the following
i. (110010)2 + (11011)2
ii. (2765)8 + (6435)8
f) Subtract the following -
i. (745)8 - (567)8
ii. 1E5)16 - (177)16

Q4. Give the truth table and logic diagram of a full adder. Write the sum and carry expression of full adder.
Q5. Draw the logic circuit for the following expression using NAND gate only.
F(X,Y,Z) = X.Y’ + X’ .Z
Q6. Draw the logic circuit for the following expression using NOR gate only:
A+B’+C’+D’ . A+B+C’+D’
Q7. Draw the truth table and logic circuit of a Half Adder.
Q8. Define syllogism. Name the two methods to draw conclusion.
Q9.Using Boolean law verify whether :
(p’ . q’ + p’) = p.q + p’
Q10. Simplify using Boolean laws :
A.B’C’ + A.B.C’ + A’C’ +C

You might also like