Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following boolean expression for the logic circuit (shown in this picture) is correct?

Which of the following boolean expression for the logic circuit (shown in this picture) is correct? Correct Answer C(A+B)DE

The correct answer is option 3.

Concept:

The given circuit is,

The resultant expression is,

Y= (A+B). C.D.E   here (.) is and operation and (+) is or operation

Y=(A+B).CDE

This is also written as,

Y=C(A+B)DE

Hence the correct answer is C(A+B)DE.

Related Questions

interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
In which of the below-mentioned logic families, the transistors operate between cut-off and active (non-saturation) states? (i) Transistor-Transistor Logic (TTL) (ii) Schottky TTL (iii) Diode Transistor Logic (DTL) (iv) Emitter Coupled Logic (ECL) Choose the correct answer from the code given below: Code:
Consider the multiplexer based logic circuit shown in the figure. Which one of the following Boolean functions is realized by the circuit?
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?
Which of the following problems is NOT NP-complete? I. Checking satisfiability of arbitrary Boolean formulae II. Checking satisfiability of Boolean formulae in conjunctive normal form (CNF/product of sums) III. Checking satisfiability of Boolean formulae in disjunctive normal form (DNF/sum of products)
The general purpose of the Data Access Object (DAO) pattern is to avoid these logic related problems by separating data access logic from business logic and presentation logic.
What specifies the values of a Boolean expression for every possible combination of values of the variables in the Boolean expression?
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1’s by a 0. Consider the following example. Input sequence: 00100011000011100 Output sequence: 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s, t, b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b ?
For the picture shown above, which one of the following is the correct picture representing reflection with respect to the mirror shown as the dotted line?
Consider the following statements regarding the Moore and Mealy models: 1. In the Mealy circuit, the final output depends only on the present state of memory elements. 2. In the Moore circuit, output can change in between the clock edges if the external inputs change. 3. The implementation of a logic function in the Mealy circuit needs fewer states than the Moore circuit. Which of the above statements are not correct?