Cody

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

Solution 601254

Submitted on 24 Mar 2015 by Gergely Patay
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### 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 = 1

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

ans = 0

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

ans = 0

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

ans = 0

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

ans = 1

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

ans = 1

7   Pass
%% Q_PS = 0; J=0; K=0; y_correct=0; assert(isequal(JK_FF(Q_PS,J,K),y_correct))

ans = 0

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

ans = 1