Program Loop

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-architecture/programming-the-basic-computer/program-control-io-handling/asset-program-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 program loops as sequences of instructions executed repeatedly with different data sets, emphasizing their role in efficient and concise coding. The instructor then analyzes an assembly language program that adds 100 numbers, using annotated slides to map high-level concepts such as initialization, loop counter, program loop body, indexing of a do statement, and exit condition to specific assembly lines. The example is presented in variants labeled Average and Array, with red annotations highlighting the loop body (lines 7–12), counter logic, and data area. A reference to the Basic Computer instruction set is shown, with ISZ circled as relevant to loop control. The final segment focuses on the Array version, marking initialization, data area, and a note that line 18 (HEX 150) corresponds to 100 data elements.

Chapters

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

    The slide titled 'Program Loops' defines loops as a sequence of instructions executed many times, each with a different set of data, and states that loops are essential for efficient and concise coding by automating repetitive tasks. The instructor gestures to emphasize the definition, then transitions toward an assembly example.

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

    The lecture moves to the slide 'Assembly Language Program to add 100 numbers,' with handwritten red labels such as '(Average)' and later '(Array).' A two-column assembly listing is annotated with callout boxes: 'corresponds assignment SUM = 0,' 'loop counter,' and 'program loop' on the left, and 'indexing of do statement' plus 'if counter is zero then exit from the loop' on the right. A red rectangle encloses the loop body at lines 7–12 (LOP through HLT).

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

    The instructor continues analyzing the Array variant, with red circles marking lines 7 (LOP) and 10 (BUN LOP). A table titled 'Instruction Set of the Basic Computer' appears, with columns Symbol, Hexa code, and Description; the ISZ row is circled in red. The assembly slide remains annotated with SUM=0, loop counter, program loop, indexing of do statement, and exit condition callouts.

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

    The final slide, 'Assembly Language Program to add 100 numbers (Array),' shows red handwritten circles and underlines over entries such as ORG 100, LOP, ADD PTR 1, and STA SUM. Labels mark the upper-right region as 'Initialisation' and the lower-left operand block as 'data area.' A red circle around 'HEX 150' on line 18 points to a handwritten note reading '100 data elements.'

The lecture builds from a general definition of loops to a concrete assembly implementation. Key concepts include loop counter, program loop body, initialization (SUM=0), indexing of a do statement, and exit condition when the counter reaches zero. The assembly example uses labels like LOP, BUN LOP, ADD PTR 1, and STA SUM to demonstrate how a loop iterates over data. The Array variant explicitly separates initialization code from the data area, with line 18 (HEX 150) indicating where 100 data elements are stored. The ISZ instruction from the Basic Computer instruction set is highlighted as relevant to loop control, likely for decrementing and testing the counter. The progression shows how high-level loop constructs map to low-level assembly instructions, with annotations serving as the primary teaching tool.

Loading lesson…