edited by
5,830 views

3 Answers

Best answer
14 votes
14 votes

3 stage counter with RS FF is 3 bit counter, so after every 8 clock pulse, it will return to initial state.

Initial state is 1, state after 8 clock pulse will be 1, So, after 9th clock pulse , state will be 2. 

selected by
0 votes
0 votes

A three stage counter can count only to 8 (0-7)

Initially, count = 1.

After 9 clock pulses

$1\rightarrow 2\rightarrow 3\rightarrow 4\rightarrow 5\rightarrow 6\rightarrow 7\rightarrow 0\rightarrow 1\rightarrow 2$

Answer is 2

0 votes
0 votes
  1. Counter Type: A 3-stage counter using RS flip-flops is typically an asynchronous (ripple) counter.
  2. Initial State: The counter starts at 1, meaning its output is $001$ (assuming a binary output).
  3. Counting Pattern:
    • With each clock pulse, the flip-flops toggle sequentially, creating a counting pattern: $001 -> 010 -> 100 -> 001 -> 010 -> ...$
  4. 9 Pulses:
    • After $8$ pulses, the counter will have completed two full cycles and returned to its initial state of $001$.
    • The $9th$ pulse will toggle the first flip-flop, resulting in the output of $010$, which represents the value $2$.

Therefore, the value of the counter after 9 pulses will be 2.

Answer:

Related questions

5 votes
5 votes
2 answers
1
makhdoom ghaya asked May 13, 2016
2,904 views
The binary equivalent of the decimal number $42.75$ is$101010 . 110$$100110 . 101$$101010 . 101$$100110 . 110$
5 votes
5 votes
1 answer
2
makhdoom ghaya asked Apr 27, 2016
6,819 views
How many programmable fuses are required in a PLA which takes $16$ inputs and gives $8$ outputs? It has to use $8$ OR gates and $32$ AND gates.$1032$$776$$1284$$1536$
9 votes
9 votes
5 answers
3
makhdoom ghaya asked Apr 27, 2016
4,393 views
The most simplified form of the Boolean function$x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15)$(expressed in sum of minterms) is?A + A'BCDAB + CDA + BCDABC + D
7 votes
7 votes
3 answers
4
makhdoom ghaya asked Apr 26, 2016
4,342 views
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?{$NOT$, $OR$}{$NOR$}{...