Register

GATE ECE 2017 Set 2 | Question: 16

• edited by
1,090 views
4 4 votes

Consider the circuit shown in the figure. 

The Boolean expression $F$ implemented by the circuit is

  1. $\overline{X} \overline{Y} \overline{Z} + X Y +\overline{Y} Z $
  2. $\overline{X} Y \overline{Z} + X Z + \overline{Y} Z $
  3. $\overline{X} Y \overline{Z} +XY + \overline{Y} Z  $
  4. $\overline{X} \overline{Y} \overline{Z}  + XZ+ \overline{Y}Z  $ 

1 Answer

Answer:
← Previous · GATE ECE 2017 Set 2 ...Next → · GATE ECE 2017 Set 2 ...
← Previous in category · GATE ECE 2017 Set 2 ...Next in category → · GATE ECE 2017 Set 2 ...
Position:
Show:
Voting & Accepting an answer helps improve the community

Related questions

1 1 vote
2 2 answers
6.0k
6.0k views
admin asked Nov 25, 2017
6,008 views
GATE ECE 2017 Set 2 | Question: 44
Figure Ⅰ shows a $4$-bit ripple carry adder realized using full adders and Figure Ⅱ shows the circuit of a full-adder (FA). The propagation delay of the XOR, AND and OR g...
2 2 votes
1 1 answer
1.2k
1.2k views
Milicevic3306 asked Mar 26, 2018
1,237 views
GATE ECE 2014 Set 3 | Question: 16
Consider the multiplexer based logic circuit shown in the figure.Which one of the following Boolean functions is realized by the circuit?$F= W \overline{S_1} \: \overline...
0 0 votes
0 0 answers
695
695 views
Milicevic3306 asked Mar 27, 2018
695 views
GATE ECE 2016 Set 2 | Question: 18
A $4:1$ multiplexer is to be used for generating the output carry of a full adder. $A$ and $B$ are the bits to be added while $C_{in}$ is the input carry and $C_{out}$ is...
0 0 votes
0 0 answers
895
895 views
Milicevic3306 asked Mar 27, 2018
895 views
GATE ECE 2016 Set 1 | Question: 43
The functionality implemented by the circuit below is$2$-to-$1$ multiplexer $4$-to-$1$ multiplexer$7$-to-$1$ multiplexer$6$-to-$1$ multiplexer

Add Synced Question

×