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 Boolean expression
is equal to ________.
Options
A. C
B. D
C. C + D
D. 1
Correct Answer
C + D
Boolean Algebra and Logic Simplification problems
Search Results
1. Applying DeMorgan's theorem and Boolean algebra to the expression
results in ________.
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
2. In Boolean algebra, the word "literal" means ________.
Options
A. a product term
B. all the variables in a Boolean expression
C. the inverse function
D. a variable or its complement
Show Answer
Scratch Pad
Discuss
Correct Answer: a variable or its complement
3. The standard SOP form of the expression
is ________.
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
4. The Boolean expression
can be reduced to ________.
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
5. The Boolean expression C + CD is equal to ________.
Options
A. C
B. D
C. C + D
D. 1
Show Answer
Scratch Pad
Discuss
Correct Answer: C
6. The Boolean expression for the logic circuit shown is _____.
Options
A.
B.
C.
D.
Show Answer
Scratch Pad
Discuss
Correct Answer:
7. When four 1s are taken as a group on a Karnaugh map, the number of variables eliminated from the output expression is ________.
Options
A. 1
B. 2
C. 3
D. 4
Show Answer
Scratch Pad
Discuss
Correct Answer: 2
8. A NAND gate can function as a negative-OR gate.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
9. An AND gate is a universal gate.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: False
10. If one input to a 2-input AND gate is HIGH, the output reflects the other input.
Options
A. True
B. False
Show Answer
Scratch Pad
Discuss
Correct Answer: True
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