The Do While Loop
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
- 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
- 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
- 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
- Paper-1 | English: Vocabulary, 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), Sentence Construction, Cloze Test (Cloze Passage)
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
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
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: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.