411 views
0 0 votes
What should be the input combinations of the 2:1 MUX to prove that MUX is functionally complete for the set (+,~) which is already functionally complete?

1 Answer

Position:
Show:

Related questions

3 3 votes
2 2 answers
428
428 views
GO Classes asked Jul 29, 2025
428 views
$A(4 \times 1) M U X$ is used to implement a 3-input Boolean function as shown in the figure. The Boolean function $F(A, B, C)$ implemented isA. $F(A, B, C)=\Sigma(1,2,4,...
1 1 vote
3 3 answers
404
404 views
GO Classes asked Jul 18, 2025
404 views
Without any additional circuitry, an $8:1$ MUX can be used to obtainsome but not all Boolean functions of $3$ variablesall functions of $3$ variables but none of $4$ vari...
1 1 vote
3 3 answers
440
440 views
GO Classes asked Jul 3, 2025
440 views
A 3-bit gray counter is used to control the output of the multiplexer as shown in the figure. The initial state of the counter is $000_2$. The output is pulled high. The ...
3 3 votes
2 2 answers
561
561 views
GO Classes asked Jun 19, 2025
561 views
The propagation delay of the $2 \times 1 \mathrm{MUX}$ shown in the circuit is 10 ns . Consider the propagation delay of the inverter as 0 ns .If $S$ is set to 1 then the...