edited by
9,266 views
24 votes
24 votes

Consider the two cascade $2$ to $1$ multiplexers as shown in the figure .

    

The minimal sum of products form of the output $X$ is 

  1. $\overline{P} \ \overline {Q}+PQR$
  2. $\overline{P} \ {Q}+QR$
  3. $PQ +\overline{P} \ \overline{Q}R$
  4. $\overline{Q} \ \overline{R} + PQR$
edited by

7 Answers

Best answer
48 votes
48 votes

For $2 :1$ MUX, output $Y=S'I_o+SI_1$

So, output of MUX$1$ ,$f_1=P'0+PR =PR$


Output of MUX$2$ , $f_2=Q'R'+Qf_1=Q'R'+PQR$


which is option D

selected by
1 votes
1 votes

Answer : D

Lets say output of 1st  multiplexer = m

table for 1st multiplexer

P m
0 0
1 R

m = (P' * 0) + (P * R ) = PR ...(1)

table for 2nd multiplexer

Q X
0 R'
1 m

X = (Q' * R') + (Q * m) ...(2)

put (1) in (2)

X=(Q' * R') + (Q * PR)

X= Q' R'+PQR

 

0 votes
0 votes
Let the output of 1st mux be S

S=P'.0+PR=>PR

now the 2nd Mux would give the output =>

Q'R'+QPR

so option D is the right answer..
0 votes
0 votes
the output of the first MUX is Y= PR+P' 0=PR and this will input for the second mux as these are cascaded.

for the second mask   output=PRQ+Q'R' which is the option D.
Answer:

Related questions

85 votes
85 votes
9 answers
1
Sandeep Singh asked Feb 12, 2016
30,725 views
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...
113 votes
113 votes
20 answers
2
Sandeep Singh asked Feb 12, 2016
51,651 views
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this ...
34 votes
34 votes
9 answers
3
Sandeep Singh asked Feb 12, 2016
12,117 views
The $16\text{-bit}\;2's$ complement representation of an integer is $1111 \quad 1111 \quad 1111 \quad 0101;$ its decimal representation is ____________