Self-Staring And Free-Running Counter

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/digital-logic/sequential-circuits/ripple-async-counters/asset-self-staring-and-free-running-counter after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture defines and distinguishes between Self-Starting Counter and Free Running Counter in digital logic. The instructor begins by presenting definitions on a slide, noting that a self-starting counter provides the counting sequence irrespective of the initial state, while a free-running counter maintains all possible states in its sequence. He then analyzes specific state transition sequences listed on the slide, such as 0 -> 3 -> 2 -> 1 -> 0 and 0 -> 1 -> 3 -> 2 -> 1. Using a whiteboard, he illustrates the concept of self-starting behavior by drawing state diagrams. He shows a scenario where an isolated state (0) transitions into a main counting loop (1 -> 2 -> 3), marking this as self-starting. Conversely, he marks a scenario with an isolated state that does not enter the loop as not self-starting. The lecture concludes with a Venn diagram illustrating that all free-running counters are self-starting, but not all self-starting counters are free-running.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the core definitions visible on the slide: Self-Starting Counter and Free running counter. He lists several state transition sequences to analyze, including 0 -> 3 -> 2 -> 1 -> 0 and 0 -> 1 -> 3 -> 2 -> 1. He moves to the whiteboard to visually explain the concept of self-starting. He draws a circle representing state 0 and an arrow pointing to a loop consisting of states 1, 2, and 3. He explains that if the counter starts at 0, it eventually enters the main counting sequence (1->2->3), making it self-starting. He writes SS to denote this property. He contrasts this by drawing a separate loop or isolated state that never enters the main sequence, marking it with SS X to indicate it is not self-starting. This section focuses on determining if a counter can recover from any unused state. He also points to the slide text defining a free running counter as one that maintains all possible states.

  2. 2:00 – 3:39 02:00-03:39

    The lecture progresses to the relationship between the two types of counters. The instructor draws a Venn diagram on the whiteboard with a smaller inner circle labeled FR (Free Running) and a larger outer circle labeled SS (Self-Starting). He explains that if a counter is free-running, it inherently uses all possible states, which means it must also be self-starting. He points to the conclusion text on the slide which states: if a counter is free running, it is also self-starting, but vice-versa not required to be true. This means a counter can be self-starting without being free-running if it has unused states that lead into the main sequence but does not utilize every possible state in the system. The video ends by reinforcing this hierarchical relationship.

The lesson establishes that while all free-running counters are self-starting, the reverse is not true. A free-running counter utilizes every possible state in its sequence, whereas a self-starting counter simply ensures that any initial state eventually leads to the valid counting sequence. The instructor uses state diagrams and a Venn diagram to clarify that the set of free-running counters is a subset of self-starting counters.

Loading lesson…