Toggle navigation
Home
KPSC Previous Question Papers
Article Category
kerala psc
upsc
General
Popular Pages
Multiple Choice Question in aptitude-area
Multiple Choice Question in non-verbal-reasoning-grouping-of-images
Multiple Choice Question in aptitude-compound-interest
Multiple Choice Question in engineering-mechanics-kinetics-of-a-particle-impulse-and-momentum
Multiple Choice Question in 035/2016
Multiple Choice Question in electronic-devices-bipolar-junction-transistors
Question Answer in
Multiple Choice Question in database-database-redesign
Question Answer in malayalam-kerala-psc-questions
Multiple Choice Question in malayalam-kerala-psc-questions
Multiple Choice Question in കറന്റ് അഫയേഴ്സ് മേയ് 11
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Multiple Choice Questions
Question Set
digital electronics boolean algebra and logic simplification
1. Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.
(A): F = ABD + ABC + CD
(B): F = AC + AD
(C): F = BC + AB
(D): F = CD + AD
Previous Question
Show Answer
Next Question
Add Tags
Report Error
Show Marks
Ask Your Doubts Here
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Show Similar Question And Answers
QA->During which period of evolution man discovered the use of jute and began to use cloth made of jute?....
QA->Which state government has announced a ban on the use of "single use plastic"?....
QA->Who is the author of “ Algebra of Infinite Justice”?....
QA->Who is the author of “Algebra of Infinite Justice”?....
QA->Who is credited with the invention of Algebra?....
MCQ->Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.....
MCQ->What will be the output of the program? public class BoolTest { public static void main(String [] args) { int result = 0; Boolean b1 = new Boolean("TRUE"); Boolean b2 = new Boolean("true"); Boolean b3 = new Boolean("tRuE"); Boolean b4 = new Boolean("false"); if (b1 == b2) / Line 10 / result = 1; if (b1.equals(b2) ) / Line 12 / result = result + 10; if (b2 == b4) / Line 14 / result = result + 100; if (b2.equals(b4) ) / Line 16 / result = result + 1000; if (b2.equals(b3) ) / Line 18 / result = result + 10000; System.out.println("result = " + result); } }....
MCQ->Consider the Boolean expression X = ABCD + AB CD + A BCD + A CB D The simplified form of X is....
MCQ->The Boolean expression B⊕E is a simplified version of expression A BE + BCDE+ BC D E + A B D E + B C D E + A B D E then which of the following choice is correct? don't care conditions doesn't existdon't care conditions existd( 16, 18, 20, 23, 27, 29) is the set of don't care conditionsd( 16, 20, 22, 27, 29) is the set of don't care conditions....
MCQ->interface Base { boolean m1 (); byte m2(short s); } which two code fragments will compile? interface Base2 implements Base {} abstract class Class2 extends Base { public boolean m1(){ return true; }} abstract class Class2 implements Base {} abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }} abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}....
×
×
Type The Issue
×
Your Marks
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use | Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions
Question ANSWER With Solution