Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
21 views

BooleanAssignment Class11

1. The document is a competency assignment for 11th grade computer science students on the topic of Boolean logic. It contains 10 questions testing students' knowledge of Boolean operators, logic gates, and expressions. 2. The questions cover multiple choice, fill in the blank, and short answer questions testing topics like Boolean operators, logic gates, truth tables, Boolean expressions, and drawing logic circuits. 3. Some sample questions include identifying logical statements, Boolean operators like AND and OR, deriving Boolean expressions from logic circuits, reducing Boolean expressions using identities, and preparing truth tables.

Uploaded by

Mudil Mathur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

BooleanAssignment Class11

1. The document is a competency assignment for 11th grade computer science students on the topic of Boolean logic. It contains 10 questions testing students' knowledge of Boolean operators, logic gates, and expressions. 2. The questions cover multiple choice, fill in the blank, and short answer questions testing topics like Boolean operators, logic gates, truth tables, Boolean expressions, and drawing logic circuits. 3. Some sample questions include identifying logical statements, Boolean operators like AND and OR, deriving Boolean expressions from logic circuits, reducing Boolean expressions using identities, and preparing truth tables.

Uploaded by

Mudil Mathur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Greenfields Public School

Dilshad Garden, GTB Enclave, Delhi-110093.


Tel; 22584740, 22118756. Email. Info @ greenfieldspublicschool.com
==================================================================
=======
COMPETENCY ASSIGNMENT
SUBJECT : Computer Science GRADE : XI

CHAPTER Boolean Logic MONTH: August

S.NO. QUESTIONS

1. Multiple choice Questions:

 When the result of any Boolean statement is always 1 is known as


___________.

1. True
2. Tautology
3. Fallacy
4. False

 When the result of any Boolean statement is always 0 is known as


______________.

1. True
2. Tautology
3. Fallacy
4. False

 The logical operations can be carried out by which of the following?

1. Values and Variables


2. Functions and Laws
3. Operators and Operands
4. None of these

 To denote NOT operation which of the following symbols is used?

1. bar
2. dot
3. plus
4. asterisk

 The dot symbol is used to represent which of the following operation?

1. AND
2. OR
3. NOT
4. NAND
 Which of the following are logical statements:

1. The Indian cricket team is a world champion in 2011.


2. What are the parts of the boolean function?
3. There are three types of boolean operators.
4. The NOT function can be operated on more than one Boolean
function.

 Which of the following gate is also known as an inverter

1. AND
2. OR
3. NOT
4. NAND

 Which of the following gate returns a true result if both inputs are true
otherwise false.

1. AND
2. OR
3. NOT
4. None of the above

 Which gate can be written like A & B

1. AND
2. OR
3. NOT
4. XOR

 Which gate returns true if both inputs are similar otherwise false.

1. NAND
2. NOR
3. XOR
4. None of the above
2. Find the dual of following :

3. Derive a Boolean expression for the output of following circuits:


4. Find the complement of the following:
a)F=(a+c)(a+b′)(a+b+c′)
b) F= (a+ac+b′c)(a+b+c′)

5. Fill in the blanks


a. A __________ statement returns either True or False value.
b. The logical values can be stored in ______________.
c. A __________ represents a Boolean function with all the input and
output in tabular form.
d. The only boolean function which operate on a single input variable
is ____________.
e. The _____________ is a boolean operation which perform
multiplication.
f. The ___________ is a boolean operation which perform addition.
g. The boolean expression evaluated from ________ to ___________.
h. The _________ operator has high (top) priority in boolean
statement evaluation.
i. The __________ is a graphical representation of turth table.
j. The __________ gate produces the reverse result of AND gate.

6. Define Boolean expression.

7. Using Boolean identities reduce the given Boolean expression:

a) F(P ,Q, R)=(P+Q)(P+R)


b) A = XY + X(Y+Z) + Y(Y+Z)

8. What is the equivalent expression for the Boolean expression x’y’z +yz+ xz?
9. Prepare the truth table for
a. X+(X.Y) b. X.(X+Y) c. X’ + Y’ d. (X.Y) + (Y.X)

10. Draw logical circuits for the following:


1. Y = AB + BC + CA
2. Y = (A+B)’ . (A+B)
3. Y = A’.B’ + (A.B)’
4. ( A + ̅̅̅̅ ̅̅̅̅
𝐵𝐶 )+𝐴𝐵

You might also like