The Do While Loop

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/c-programming/control-flow/loops-iteration/asset-the-do-while-loop after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment provides a detailed explanation of the `do-while` loop in C programming, focusing on its syntax and execution logic. The instructor, identified as Sanchit Jain Sir from Knowledge Gate Educator, contrasts this loop structure with the standard `while` loop, specifically highlighting the critical difference in when the conditional test occurs. The core concept is that the `do-while` loop is an exit-controlled loop, meaning the body is guaranteed to execute at least once regardless of the initial condition. This distinction is vital for understanding control flow in iterative programming.

Chapters

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

    The instructor begins by displaying the syntax of the `do-while` loop on a slide titled "The do-while Loop". The code snippet clearly shows the structure: `do { this; and this; } while ( this condition is true );`. He verbally breaks down the components, noting the `do` keyword initiates the block, followed by statements inside braces, and the loop terminates with a `while` condition followed by a semicolon. He emphasizes that the semicolon is mandatory after the closing parenthesis, a common syntax error for beginners. The slide also features a banner with his name.

  2. 2:00 – 2:44 02:00-02:44

    The lecture moves to a comparison slide featuring a flowchart and code examples to illustrate the functional difference. The flowchart shows boxes for START, INITIALISE, body of loop, increment, and a diamond for test. The instructor explains that a standard `while` loop is entry-controlled, testing the condition before the body runs. Conversely, the `do-while` loop is exit-controlled. He uses the specific example `while ( 4 < 1 )` which fails immediately, versus `do { printf ( "Hello there \n" ); } while ( 4 < 1 );` which executes the print statement once before checking the false condition. The slide also mentions that `break` and `continue` work similarly in `do-while` as they do in `while` loops, with `break` bypassing the conditional test. The red arrows indicate the flow of control, looping back to the body if the test is true.

The lesson effectively bridges the gap between syntax and logic. By showing the flowchart and contrasting code examples, the instructor clarifies why `do-while` is useful for scenarios requiring at least one execution, such as menu-driven programs or input validation loops where the user must be prompted at least once. The visual aids, including the red arrows in the flowchart, reinforce the path of execution, ensuring students understand the post-test nature of the loop. The text on the slide further elaborates on how `break` and `continue` function within this specific loop structure.

Loading lesson…