Cody

Problem 2676. Find the next state of a JK Flip-Flop

Solution 1162103

Submitted on 13 Apr 2017 by H M Dipu Kabir
  • Size: 12
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
Q_PS = 0; J=1; K=1; y_correct=1; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
2   Pass
Q_PS = 1; J=1; K=1; y_correct=0; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
3   Pass
Q_PS = 0; J=0; K=1; y_correct=0; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
4   Pass
Q_PS = 1; J=0; K=1; y_correct=0; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
5   Pass
Q_PS = 1; J=1; K=0; y_correct=1; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
6   Pass
Q_PS = 0; J=1; K=0; y_correct=1; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
7   Pass
Q_PS = 0; J=0; K=0; y_correct=0; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []
8   Pass
Q_PS = 1; J=0; K=0; y_correct=1; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = []

Suggested Problems

More from this Author70