Humanities/Arts Exam  >  Humanities/Arts Tests  >  Computer Science for Class 11  >  Test: Boolean logic - Humanities/Arts MCQ

Test: Boolean logic - Humanities/Arts MCQ


Test Description

15 Questions MCQ Test Computer Science for Class 11 - Test: Boolean logic

Test: Boolean logic for Humanities/Arts 2024 is part of Computer Science for Class 11 preparation. The Test: Boolean logic questions and answers have been prepared according to the Humanities/Arts exam syllabus.The Test: Boolean logic MCQs are made for Humanities/Arts 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Boolean logic below.
Solutions of Test: Boolean logic questions in English are available as part of our Computer Science for Class 11 for Humanities/Arts & Test: Boolean logic solutions in Hindi for Computer Science for Class 11 course. Download more important topics, notes, lectures and mock test series for Humanities/Arts Exam by signing up for free. Attempt Test: Boolean logic | 15 questions in 15 minutes | Mock test for Humanities/Arts preparation | Free important questions MCQ to study Computer Science for Class 11 for Humanities/Arts Exam | Download free PDF with solutions
Test: Boolean logic - Question 1

 simplifies to: 

Detailed Solution for Test: Boolean logic - Question 1

Given expression: 

Test: Boolean logic - Question 2

Which of the is sufficient to represent any boolean operation.

Detailed Solution for Test: Boolean logic - Question 2
  • NOR, 
  • NAND,
  • {OR and NOT i.e It behaves like NOR Gate } and
  • {AND, NOT, It behaves like NAND Gate}

are the universal gates because they may be used to create any logic gate.  
The given option 1, option 2 and option 3 are not sufficient to represent any boolean operation.
Option 1:
{OR , OR} behaves like an OR gate. It can not sufficient for the universal gate.
Option 2:
{XOR} is a simple XOR gate. It can not sufficient for the universal gate.
Option 3:
{AND, AND} behaves like an AND gate. It can not sufficient for the universal gate.
Option 4:  
2×1 MUX or 2X1 multiplexer is functionally complete provided we have external 1 and 0 available.

  • For NOT gate, use x  as a select line and use 0 and 1 as inputs.
  • For AND gate, use y and 0 as inputs and x as select. With {AND, NOT} any other gate can be made.

Hence the correct answer is 2×1 MUX.

1 Crore+ students have signed up on EduRev. Have you? Download the App
*Multiple options can be correct
Test: Boolean logic - Question 3

Which of the following logical circuits is/are equivalent?

Detailed Solution for Test: Boolean logic - Question 3

Concept:
Options verification is the better way to solve this type of question.
Option 1:

The given circuit is gives (A+B)I.
Option 2: 

The given circuit is (And-Gate AB) with NAND blocks. It gives AB as the resultant gate.
Option 3:
The given circuit is 

The given circuit is gives (A+B)I.
Option 4:
The given circuit is 

The given circuit is gives (A+B)I.
Hence the correct answer is option 1, option 3 and option 4.

*Multiple options can be correct
Test: Boolean logic - Question 4

Let A, B, C, and D be boolean variables. Choose the correct options that is/are not equivalent to the boolean expression given below.

Detailed Solution for Test: Boolean logic - Question 4

Only Options (2), (3), and (4) are not Equivalent to the given expression.



Option (A):


Option (B):


Option (C):


Option (D):

Test: Boolean logic - Question 5

Match the following identities/laws to their corresponding name:

Detailed Solution for Test: Boolean logic - Question 5

Idempotent laws:
Boolean logic has idempotence within both AND and OR gates. A logical AND gate with two inputs A will also have an output of A. (1 AND 1 = 1, 0 AND 0 = 0). An OR gate has idempotence because 0 OR 0 = 0, and 1 OR 1 = 1.
Hence, x + x = x and x.x = x
Identity laws:
The first Boolean identity is that the sum of anything and zero is the same as the original “anything.” This identity is no different from its real-number algebraic equivalent: No matter what the value of A, the output will always be the same: when A=1, the output will also be 1; when A=0, the output will also be 0.
Hence, x + 0 = x and x.1 = 0
Dominance laws:
The complement is used in the operations to form these laws. The idea behind these laws is that if the first number is 1 then the negation of 1 is 0. In equation 1, the numbers are opposite therefore in any order: 0 OR 1 is equal to 1.
Hence, x + 1 = 1 and x.0 = 0.
Absorption law:
This law enables a reduction in a complicated expression to a simpler one by absorbing like terms.
A + (A.B) = (A.1) + (A.B) = A(1 + B) = A (OR Absorption Law)
A(A + B) = (A + 0).(A + B) = A + (0.B) = A (AND Absorption Law)
Hence, x.(x+y) = x
Hence the correct answer is A - 3, B - 4, C - 1, D - 2.

Test: Boolean logic - Question 6

In Boolean algebra, 

Detailed Solution for Test: Boolean logic - Question 6


All Boolean algebra laws are shown below:

Test: Boolean logic - Question 7

Which one of the following is NOT a valid identity?

Detailed Solution for Test: Boolean logic - Question 7
  • (x ⊕ y) ⊕ z = x ⊕ (y ⊕ z) 

    Therefore exclusive OR is associative and hence (x ⊕ y) ⊕ z = x ⊕ (y ⊕ z) 


  • (x + y) ⊕ z ≠ x ⊕ (y + z) ∴ is it not a valid identity


  • x + y = x ⊕ y // if xy = 0
  • (xy + x'y')'
    = (x’ + y’).(x+y) // Demorgan’s Law
    = x’y +xy’
    = x ⊕ y
Test: Boolean logic - Question 8

Determine the minimised expression of Boolean function

Detailed Solution for Test: Boolean logic - Question 8

All Boolean algebra laws are shown below

Calculation:

Now using Distributive Law

Test: Boolean logic - Question 9

Boolean algebra obeys

Detailed Solution for Test: Boolean logic - Question 9


Test: Boolean logic - Question 10

Solve the following Boolean expression:

Select the correct option.

Detailed Solution for Test: Boolean logic - Question 10

Given 
This can be written as:

Since  the above expression can be written as:

With C.C = C, we can write:

Test: Boolean logic - Question 11

Let, x1 ⊕ x2 ⊕ x3 ⊕ x4 = 0 where x1, x2, x3, x4 are Boolean variables, and ⊕ is the XOR operator.
Which one of the following must always is TRUE?

Detailed Solution for Test: Boolean logic - Question 11

XOR gate is a gate that gives a true output when the number of true inputs is odd.
Explanation:
Given, x1 ⊕ x2 ⊕ x3 ⊕ x4 = 0
Where, x1, x2, x3, x4 are Boolean variables, and ⊕ is the XOR operator
Consider x1 = 1, x2 =1, x3 =1 and x4= 1
1 ⊕ 1 ⊕ 1 ⊕ 1 = 0
Now, consider all the options one by one.
1) x1x2x3x4 = 0 [Incorrect]
Here, put the value of x1,x2, x3, x4 as 1
So, 1.1.1.1 = 1
2) x1x3 + x2 = 0 [Incorrect]
1.1 + 1 =1

So, 0 ⊕ 0 = 0 ⊕ 0,
0 = 0
4) x1 + x2 + x3 + x4 = 0 [Incorrect]
As, 1+1+1+1 = 1

Test: Boolean logic - Question 12

Let # be a binary operator defined as
X # Y = X’ + Y’ where X and Y are Boolean variables.
Consider the following two statements.
(S1) (P # Q) #R = P# (Q # R)
(S2) Q # R = R # Q
Which of the following is/are true for the Boolean variables P, Q and R?

Detailed Solution for Test: Boolean logic - Question 12


∴ S1 is FALSE
But

∴ S2 is TRUE
Important Points:

It is a NAND operation and NAND is commutative but not associative.

Test: Boolean logic - Question 13

According to Boolean law: 

Detailed Solution for Test: Boolean logic - Question 13
  • The branch of algebra which deals with the values of the variables in the form of the truth values true and false is called Boolean algebra.
  • True and false are usually denoted by 1 and 0 respectively.

Explanation
If we take complement, we get negation of the variable but if we again take the complement of complemented variable, we get the same variable.

Test: Boolean logic - Question 14

If function f(A, B) = ∑ m(0, 1, 2, 3) is implemented using SOP form, the resultant Boolean function would be:

Detailed Solution for Test: Boolean logic - Question 14

Laws of Boolean Algebra:

Application:
f(A, B) = ∑ m(0, 1, 2, 3)

Test: Boolean logic - Question 15


The truth table represents the Boolean function:

Detailed Solution for Test: Boolean logic - Question 15

From truth table:

F(x, y) = X

20 videos|20 docs|5 tests
Information about Test: Boolean logic Page
In this test you can find the Exam questions for Test: Boolean logic solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Boolean logic, EduRev gives you an ample number of Online tests for practice

Top Courses for Humanities/Arts

20 videos|20 docs|5 tests
Download as PDF

Top Courses for Humanities/Arts