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
In Boolean algebra,
= A.
Options
A. True
B. False
Correct Answer
True
Boolean Algebra and Logic Simplification problems
Search Results
1. A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
2. A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and the resulting output of each value.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
3. SOP stands for sum-of-powers.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
4. The VHDL editor provided with a schematic editor development system will produce a file with the extension .vhd, which can be used by the simulator to test the output of the logic design.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
5. Five-variable Karnaugh maps are impossible.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
6. Boolean algebra simplifies logic circuits.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
7. If you need a NAND, an AND, and an inverter you would purchase a 7400 IC.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
8. Most Boolean reductions result in an equation in only one form.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
9. The binary value of 1010 is converted to the product term
.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
10. The symbol shown below is for a 2-input NAND gate.
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