edited by
3,145 views

2 Answers

Best answer
12 votes
12 votes

it looks like asynchronous sequential circuit.
here, Next state, $Y = x \oplus y$ , where $x$ is input , $y$ is present state 

Present state $y$ input
$x$
Next state $Y$
0 0 0
0 1 1
1 0 1
1 1 0

At $x=0$, circuit reach to stable state, if y is $0$, it will remain $0$, or if it is $1$ it will remain $1$. 

At $x=1$ , states goes $0$ to $1$ , $1$ to $0$, so on , will not reach to stable state. 

At $x=y$, next state will remain always at $0$, as seen in table.

so , At $x=1$ , the above circuit will generate the sequence of 0,1,0,1.. , can be used as clock generator.

selected by
2 votes
2 votes

We know for $\mathrm{XOR}$ gate that
$\mathrm{A \bigoplus B=A\bar{B}+\bar{A}B}$

So $1 \bigoplus \mathrm{A} =1\cdot\bar{\mathrm{A}}+\bar{1}\cdot\mathrm{A}=\bar{\mathrm{A}}+0\cdot\mathrm{A}=\bar{\mathrm{A}}$

It means any one input of $\mathrm{XOR}$ gate is $1$, the output will be the negation of the other input i.e. this $\mathrm{XOR}$ gate logically converts to $\mathrm{NOT}$ gate.


Here in the diagram the output $\mathrm{Y}$ of the $\mathrm{XOR}$ gate is fed into its own $\mathrm{XOR}$ gate. So if this gate can logically be converted into $\mathrm{NOT}$ gate, it will produce $0,1,0,1,...$ assuming initial state of $\mathrm{Y}$ as $0$.

That's why $\mathrm{X}$ should be $1$.

 

So the correct answer is b).

 

Related questions

0 votes
0 votes
0 answers
2
3 votes
3 votes
1 answer
4
ashish pal asked Dec 28, 2017
8,901 views
A 32 : 1 MUX has to be designed using a 16 : 1 MUX. It was found that for this task we require ‘X ’ number of 16 : 1 MUX and “Y ” number of two input OR gates, th...