The While Loop

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/programming-fundamentals/control-flow/loops-iteration/asset-the-while-loop after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the concept of loops in programming, specifically focusing on the 'while' loop. The instructor begins by explaining the limitations of sequential and decision control structures, which execute actions only once. He introduces loops as a mechanism for repetition, essential for tasks like calculating salaries for multiple people. The video details the syntax, flowchart representation, and general form of the while loop. It includes a practical example of calculating simple interest for three sets of inputs. The lecture also warns against creating indefinite (infinite) loops and explains the behavior of increment and decrement operators, particularly post-increment within loop conditions.

Chapters

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

    The instructor reviews previous programs that used sequential or decision control instructions, noting they were of 'limited nature' because they performed actions exactly once. He introduces the concept of repetition, stating 'Almost always, if something is worth doing, it's worth doing more than once.' He uses real-life examples like eating dinner or going to a movie to illustrate the need for loops. The section concludes by defining the 'loop' as the mechanism that meets the need to perform an action over and over with variations.

  2. 2:00 – 5:00 02:00-05:00

    The lecture formally introduces 'Loops', explaining that computer versatility lies in repeating instructions. Three methods are listed: for, while, and do-while statements. The instructor focuses on the 'while' loop, ideal for fixed repetitions like calculating gross salaries for ten persons. He presents a C program calculating simple interest for 3 sets of p, n, and r. The code shows initialization (`count = 1`), the condition (`while (count <= 3)`), and the increment (`count = count + 1`). A flowchart is displayed alongside the code to visualize the logic.

  3. 5:00 – 10:00 05:00-10:00

    The instructor illustrates the operation of the while loop with a flowchart showing Initialize, Test, Body of loop, and Increment steps. He presents the general form: `initialize loop counter; while (test loop counter using a condition) { ... increment loop counter; }`. He warns that the loop must test a condition that eventually becomes false, otherwise it is an indefinite loop. He shows an example where `i` remains 1 forever, causing an infinite loop. He then discusses increment (`++`) and decrement (`--`) operators, explaining that `while (i++ < 10)` performs comparison first, then increment (post-increment), requiring `i` to be initialized to 0.

  4. 10:00 – 11:12 10:00-11:12

    The video concludes this segment with a title slide displaying the word 'Break' in large text. Below it, the text '4 - for Loop' is visible, indicating the transition to the next topic in the series. The instructor briefly mentions the break statement before moving on to the for loop structure.

The lecture progresses from identifying the limitations of single-pass programs to introducing the necessity of loops for repetitive tasks. It provides a comprehensive overview of the 'while' loop, covering its theoretical basis, practical implementation in C code, and visual representation via flowcharts. Key technical details include the structure of initialization, condition testing, and incrementing, along with critical warnings about infinite loops and the specific behavior of post-increment operators within loop conditions.

Loading lesson…