0

Boolean Algebra - 1

Description: Boolean Algebra - 1
Number of Questions: 15
Created by:
Tags: Boolean Algebra - 1 Basic Fundamentals Hardware and Software Boolean Algebra Boolean Algebra and Its Application
Attempted 0/15 Correct 0 Score 0

_______ can be used to control the order in which logical operators will be evaluated.

  1. Quotation marks

  2. Parenthesis

  3. Commas

  4. Relational operators


Correct Option: B

When the logical operator(s) _______ is/are used, only one expression must evaluate as true in order for the entire expression to be true.

  1. AND

  2. OR

  3. Either AND or OR

  4. NOT


Correct Option: B

Which of the following expressions is true?

  1. (10 > 14) AND ("ABLE" > "BEE")

  2. (10 > 14) OR ("ABLE" > "BEE")

  3. NOT ("X" > "M") OR (14 = 10)

  4. NOT (15 > 15)


Correct Option: D

The output of EX-NOR gate is 1, when

  1. A = 1 and B = 0

  2. A = 0 and B = 0

  3. A = 1 and B = 1

  4. Both 2 and 3


Correct Option: D
Explanation:

Yes, the output of EX-NOR gate is 1 when both the options 3 and 4 follow. Yes, the output of EX-NOR gate is 1 when both the options 3 and 4 follow.

If the logic function F = (AB + B') 'A', then what is the value of A?

  1. A' . B'

  2. A' . B

  3. AB

  4. A' B' + A

  5. None of the above


Correct Option: A
Explanation:

F = A.A.B + A'. B' = 0 + A' B' = A'.B'

Which of the following is not a combinational circuit?

  1. NAND gate

  2. Multiplexer

  3. Encoder

  4. Binary counter


Correct Option: D
Explanation:

This is not a combinational circuit because its output depends on the previous output. This is not a combinational circuit because its output depends on the previous output.

When AND gate is used to combine two Boolean expressions, _______.

  1. both the expressions must be true for the entire expression to be true

  2. at least one of the expressions must be true for the entire expression to be true

  3. neither expression should be true for the entire expression to be true

  4. the program stops executing


Correct Option: A

Boolean algebra is used to analyse and design _____ circuits.

  1. analog

  2. digital

  3. hybrid

  4. combined


Correct Option: B

In Boolean algebra, x. 0 is equal to

  1. 0

  2. 1

  3. x

  4. y


Correct Option: A

In Boolean algebra, x (y + z) is equal to

  1. x

  2. y

  3. x.y

  4. x.y + x.z


Correct Option: D

(xy)' = x' + y' is commonly referred to as

  1. Demorgan's theorem

  2. Karnaugh theorem

  3. Kelvin theorem

  4. Commutative property


Correct Option: A

In Boolean algebra, (xy)' is equal to

  1. x'

  2. y'

  3. x' + y'

  4. x'y'


Correct Option: C

A Boolean expression is specified by

  1. a table

  2. a truth table

  3. a false table

  4. the number of gates


Correct Option: B

All the basic Boolean laws are proved by means of

  1. table

  2. truth table

  3. false table

  4. combinational circuits


Correct Option: B

(x + y)' = x' y' is defined under

  1. Demorgan's theorem

  2. Karnaugh theorem

  3. Kelvin theorem

  4. Associative property


Correct Option: A
- Hide questions