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
CPLD software can be used to design original circuits that prove the Boolean rules and laws.
Options
A. True
B. False
Correct Answer
True
Boolean Algebra and Logic Simplification problems
Search Results
1. The OR function is Boolean multiplication and the AND function is Boolean addition.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
2. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
3. The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
4. The output of an XOR gate is HIGH only when ________.
Options
A. both inputs = 0
B. both inputs = 1
C. the two inputs are unequal
D. both inputs are undefined
Show Answer
Scratch Pad
Discuss
Correct Answer: the two inputs are unequal
5. A 2-input gate that can be used to pass a digital waveform unchanged at certain times and inverted at other times is a(n) ________.
Options
A. AND gate
B. OR gate
C. NAND gate
D. XOR gate
Show Answer
Scratch Pad
Discuss
Correct Answer: XOR gate
6. In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
7. The systematic reduction of logic circuits is performed using Boolean algebra.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
8. In Boolean algebra, A + 1 = 1.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
9. The product-of-sums (POS) is basically the ORing of ANDed terms.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
10. Five-variable Karnaugh maps are impossible.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
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