CuriousTab
Search
CuriousTab
Home
Aptitude
Computer
C Programming
C# Programming
C++ Programming
Database
Java Programming
Networking
Engineering
Biochemical Engineering
Biochemistry
Biotechnology
Chemical Engineering
Civil Engineering
Computer Science
Digital Electronics
Electrical Engineering
Electronics
Electronics and Communication Engineering
Mechanical Engineering
Microbiology
Technical Drawing
GK
Current Affairs
General Knowledge
Reasoning
Data Interpretation
Logical Reasoning
Non Verbal Reasoning
Verbal Ability
Verbal Reasoning
Exams
AIEEE
Bank Exams
CAT
GATE
IIT JEE
TOEFL
Jobs
Analyst
Bank PO
Database Administrator
IT Trainer
Network Engineer
Project Manager
Software Architect
Discussion
Home
‣
Digital Electronics
‣
Boolean Algebra and Logic Simplification
Comments
Question
The commutative law of addition and multiplication indicates that:
Options
A. we can group variables in an AND or in an OR any way we want
B. an expression can be expanded by multiplying term by term just the same as in ordinary algebra
C. the way we OR or AND two variables is unimportant because the result is the same
D. the factoring of Boolean expressions requires the multiplication of product terms that contain like variables
Correct Answer
the way we OR or AND two variables is unimportant because the result is the same
Boolean Algebra and Logic Simplification problems
Search Results
1. Determine the values of A, B, C, and D that make the product term
equal to 1.
Options
A. A = 0, B = 1, C = 0, D = 1
B. A = 0, B = 0, C = 0, D = 1
C. A = 1, B = 1, C = 1, D = 1
D. A = 0, B = 0, C = 1, D = 0
Show Answer
Scratch Pad
Discuss
Correct Answer: A = 0, B = 1, C = 0, D = 1
2. The systematic reduction of logic circuits is accomplished by:
Options
A. using Boolean algebra
B. symbolic reduction
C. TTL logic
D. using a truth table
Show Answer
Scratch Pad
Discuss
Correct Answer: using Boolean algebra
3. For the SOP expression
, how many 1s are in the truth table's output column?
Options
A. 1
B. 2
C. 3
D. 5
Show Answer
Scratch Pad
Discuss
Correct Answer: 3
4. How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)
Options
A. 1
B. 2
C. 4
D. 5
Show Answer
Scratch Pad
Discuss
Correct Answer: 5
5. Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.
Options
A. LM + MNOPQ
B. L + MNO + MPQ
C. LM + M + NO + MPQ
D. LM + MNO + MPQ
Show Answer
Scratch Pad
Discuss
Correct Answer: LM + MNO + MPQ
6. How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)
Options
A. 1
B. 2
C. 4
D. 5
Show Answer
Scratch Pad
Discuss
Correct Answer: 2
7. The commutative law of Boolean addition states that
A
+
B
=
A
×
B
.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
8. Determine the values of A, B, C, and D that make the sum term
equal to zero.
Options
A. A = 1, B = 0, C = 0, D = 0
B. A = 1, B = 0, C = 1, D = 0
C. A = 0, B = 1, C = 0, D = 0
D. A = 1, B = 0, C = 1, D = 1
Show Answer
Scratch Pad
Discuss
Correct Answer: A = 1, B = 0, C = 1, D = 0
9. A Karnaugh map is a systematic way of reducing which type of expression?
Options
A. product-of-sums
B. exclusive NOR
C. sum-of-products
D. those with overbars
Show Answer
Scratch Pad
Discuss
Correct Answer: sum-of-products
10. The Boolean expression
is logically equivalent to what single gate?
Options
A. NAND
B. NOR
C. AND
D. OR
Show Answer
Scratch Pad
Discuss
Correct Answer: NAND
Comments
There are no comments.
Enter a new Comment
Save
More in Digital Electronics:
Boolean Algebra and Logic Simplification
Code Converters and Multiplexers
Combinational Logic Analysis
Combinational Logic Circuits
Computers
Counters
Describing Logic Circuits
Digital Arithmetic Operations and Circuits
Digital Concepts
Digital Design
Digital Signal Processing
Digital System Projects Using HDL
Ex-OR and Ex-NOR Gates
Flip-Flops
Integrated-Circuit Logic Families
Integrated Circuit Technologies
Interfacing to the Analog World
Logic Families and Their Characteristics
Logic Gates
Memory and Storage
Microprocessor Fundamentals
MSI Logic Circuits
Multivibrators and 555 Timer
Number Systems and Codes
Programmable Logic Device
Shift Registers
Signals and Switches
The 8051 Microcontroller