Understanding Counting of a Flip Flop Part-1
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture explains how to determine the counting sequence of a digital counter circuit composed of a JK flip-flop and a T flip-flop. The instructor begins by writing the characteristic equations for both flip-flop types. He then analyzes the circuit diagram to derive the input equations for each flip-flop based on their connections. By substituting these inputs into the characteristic equations, he establishes the next state logic. Finally, he constructs a state table and traces the sequence of states starting from 00, revealing a non-standard counting sequence of 0, 2, 1, 3.
Chapters
0:00 – 2:00 00:00-02:00
The lecture starts with the problem statement: 'Find out the counting sequence for the counter below.' The instructor writes the characteristic equation for a JK Flip Flop ($Q_{n+1} = Jar{Q}_n + ar{K}Q_n$) and a T Flip Flop ($Q_{n+1} = T \oplus Q_n$). He identifies the circuit components, labeling the JK flip-flop as the LSB ($Q_0$) and the T flip-flop as the MSB ($Q_1$). He sets up a state table with columns for Present State ($Q_{1P}, Q_{0P}$) and Next State ($Q_{1N}, Q_{0N}$).
2:00 – 5:00 02:00-05:00
The instructor analyzes the circuit connections to find the input equations. For the T flip-flop ($Q_1$), the input $T_1$ is connected to +5V (Logic 1), leading to the equation $Q_{1N} = 1 \oplus Q_{1P} = \overline{Q_{1P}}$. For the JK flip-flop ($Q_0$), he observes that both $J_0$ and $K_0$ are connected to the output $Q_1$. This results in the equation $Q_{0N} = Q_{1P} \oplus Q_{0P}$. He writes these derived equations on the board and begins filling the state table.
5:00 – 6:09 05:00-06:09
The instructor completes the state analysis to find the counting sequence. Starting from the initial state 00 ($Q_1=0, Q_0=0$), he calculates the next states: 00 transitions to 10, which transitions to 01, then to 11, and finally back to 00. He draws a sequence diagram showing the path 0 -> 2 -> 1 -> 3 -> 0, confirming the non-standard binary counting order of the circuit.
The lesson systematically breaks down the analysis of a mixed flip-flop counter. By first establishing the fundamental characteristic equations for JK and T flip-flops, the instructor creates a framework for analysis. He then maps the physical circuit connections to logical input equations, specifically noting that $T_1=1$ and $J_0=K_0=Q_1$. This leads to the next state functions $Q_{1N} = ar{Q}_{1P}$ and $Q_{0N} = Q_{1P} \oplus Q_{0P}$. The final step involves iterating through the state table to trace the sequence, demonstrating that the circuit counts in the order 0, 2, 1, 3 rather than the standard binary sequence.

