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
Which of the following is an important feature of the sum-of-products (SOP) form of expression?
Options
A. All logic circuits are reduced to nothing more than simple AND and OR gates.
B. The delay times are greatly reduced over other forms.
C. No signal must pass through more than two gates, not including inverters.
D. The maximum number of gates that any signal must pass through is reduced by a factor of two.
Correct Answer
No signal must pass through more than two gates, not including inverters.
Boolean Algebra and Logic Simplification problems
Search Results
1. Applying DeMorgan's theorem to the expression
, we get ________
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
2. 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
3. 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
4. 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
5. 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
6. Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example,
A
+
B
=
B
+
A
]?
Options
A. associative
B. commutative
C. Boolean
D. distributive
Show Answer
Scratch Pad
Discuss
Correct Answer: commutative
7. Derive the Boolean expression for the logic circuit shown below:
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
8. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.
Options
A. NOT
B. OR
C. NOR
D. NAND
Show Answer
Scratch Pad
Discuss
Correct Answer: NOR
9. The truth table for the SOP expression
has how many input combinations?
Options
A. 1
B. 2
C. 4
D. 8
Show Answer
Scratch Pad
Discuss
Correct Answer: 8
10. Which of the following expressions is in the sum-of-products (SOP) form?
Options
A. (
A
+
B
)(
C
+
D
)
B. (
A
)
B
(
CD
)
C.
AB
(
CD
)
D.
AB
+
CD
Show Answer
Scratch Pad
Discuss
Correct Answer:
AB
+
CD
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