- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# What is J-K Flip Flop?

J-K flip-flop can be treated as an alteration of the S-R flip-flop. J represents SET, and 'K' represents CLEAR. In the JK flip-flop, the ‘S’ input is known as the ‘J’ input, and the ‘R’ input is known as the ‘K’ input. The output of the JK flip-flop does not modify if both ‘J’ and ‘K’ are ‘0’. If both the inputs are ‘1’, then the output dial to its free.

The figure shows the circuit diagram of a JK flip-flop.

The truth table of the JK flip-flop is displayed in the table.

S | R | Q_{N-1} |
---|---|---|

0 | 0 | Q_{N} |

0 | 1 | 0 |

1 | 0 | 1 |

1 | 1 | $\overline{Q_{N}}$ |

The logic symbol for the JK flip-flop is demonstrated in the diagram.

- Related Articles
- What is D Flip Flop?
- What is T Flip Flop?
- What is Set-Reset (SR) Flip-flop?
- Flip-flop types and their Conversion in C++
- Construct a Turing machine for L = {aibjck | i*j = k; i, j, k ≥ 1}
- Maximize arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l in C++
- Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}
- What is control of Single Flip-Flops?
- What reasons could make your training a flop?
- Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in Python
- Minimize (max(A[i], B[j], C[k]) – min(A[i], B[j], C[k])) of three different sorted arrays in Python
- Minimize (max(A[i], B[j], C[k]) – min(A[i], B[j], C[k])) of three different sorted arrays in C++
- Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in C++
- Count frequency of k in a matrix of size n where matrix(i, j) = i+j in C++
- Construct a Turing machine for L = {aibjck | i< j< k; i ≥ 1}

Advertisements