A ripple counter having n-flip-flops will count upto 2n stages.
For example: If n = 2 ⇒ 2² = 4 can count up to 4 stages means

Correct Option: A

A ripple counter having n-flip-flops will count upto 2n stages.
For example: If n = 2 ⇒ 2² = 4 can count up to 4 stages means

nT, Because in the case of shift register all the flipflops are connected in cascaded fashion.

Correct Option: B

nT, Because in the case of shift register all the flipflops are connected in cascaded fashion.

2³ = 8 means 3 flip-flop required.

mg src = "http://images.interviewmania.com/wp-content/uploads/2019/05/Capture-20a2.png">
∴ Frequency divided by 8. Hence alternative (C) is the correct answer.

Correct Option: C

2³ = 8 means 3 flip-flop required.

mg src = "http://images.interviewmania.com/wp-content/uploads/2019/05/Capture-20a2.png">
∴ Frequency divided by 8. Hence alternative (C) is the correct answer.

Condition to avoid race around problem:

where, Δt = Pulse width
T = Period of pulse
2t_p = Propagation delay of two NAND gates or flip-flop.
It may be noted that t_p is the propagation delay of one gate. However any flip-flop made up of 4 NAND gates or NOR gates, and any input passes through 2 gates, that's why here we must take 2t_p propagation delay.

Correct Option: B

Condition to avoid race around problem:

where, Δt = Pulse width
T = Period of pulse
2t_p = Propagation delay of two NAND gates or flip-flop.
It may be noted that t_p is the propagation delay of one gate. However any flip-flop made up of 4 NAND gates or NOR gates, and any input passes through 2 gates, that's why here we must take 2t_p propagation delay.

Sum of product form

i.e., sum of product. Hence alternative (B) is the correct answer.

Correct Option: B

Sum of product form

i.e., sum of product. Hence alternative (B) is the correct answer.