MCQOPTIONS
Bookmark
Saved Bookmarks
→
Computer Science Engineering (CSE)
→
Software Design Modeling
→
Simplify Y = AB’ + (A’ + B)C.
1.
Simplify Y = AB’ + (A’ + B)C.
A.
ab’ + c
B.
ab + ac
C.
a’b + ac’
D.
ab + a
Answer» B. ab + ac
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
For the device shown here, assume the D input is LOW, both S inputs are LOW and the input is LOW. What is the status of the Y’ outputs?
There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and operations.
The number of literals in the expression F=X.Y’ + Z are
There are cells in a 4-variable K-map.
A sequential logic can’t be executed by concurrent statements only.
A digital system consists of types of circuits.
If the decimal number is a fraction then its binary equivalent is obtained by the number continuously by 2.
The following timing diagram shows flip flop.
Don’t care conditions can be used for simplifying Boolean expressions in
Which of the following sequential circuit doesn’t need a clock signal?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
