Multiprogramming OS

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/LTI-MINDTREE-PREPARATION/operating-system/introduction-to-os/os-types-evolution/asset-multiprogramming-os after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  2. Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
  3. Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
  4. Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
  5. Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
  7. SQL (Computer Science): SQL
  8. OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
  9. Computer Networks (Computer Science): 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 Security
  10. Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. OOPs (Computer Science): Object Oriented Programming (OOPS)
  12. Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. SVAR Conversational - Spoken English: Communication Assessment
  14. HR Interview: MR & HR Interview Preparation
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces multiprogramming operating systems, explaining how keeping multiple jobs in main memory prevents CPU idling. The instructor uses a recurring diagram showing secondary disk storage, main memory holding the operating system and Jobs A, B, and C, and a CPU box. Key points include that a single program cannot keep the CPU or I/O devices busy at all times, so jobs are initially kept in a disk job pool and loaded into memory. When one job waits for I/O, the OS switches to another executable job, ensuring high CPU utilization. The lecture concludes by noting the advantage of efficient CPU use and the disadvantage of complicated scheduling.

Chapters

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

    The instructor presents a slide titled 'Multiprogramming Operating System' with a diagram showing secondary disk storage, main memory containing the operating system and Jobs A, B, and C (with Job C waiting for CPU), and a separate CPU box. Arrows labeled 'Writing output data' and 'Execution in progress' connect these components. The instructor gestures toward the diagram while red handwritten annotations appear at the bottom of the frame.

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

    The lecture explains that a single program cannot keep the CPU or I/O devices busy at all times, so multiprogramming keeps several jobs in main memory simultaneously. Jobs are initially stored on disk in a job pool before being allocated to memory. The instructor points to specific components like 'Job C (Waiting for CPU)' and draws a red circle around 'Job A' to illustrate the waiting state. A handwritten Hindi note appears stating that the processor will not wait for anyone.

  3. 5:00 – 6:29 05:00-06:29

    The final slide states that in a multi-programmed system, the operating system simply switches to and executes another job so the CPU is never idle. The same diagram of disk storage, main memory with multiple jobs, and CPU is shown again. A later slide lists the advantage as high and efficient CPU utilization, and the disadvantage as being difficult to program due to complicated schedule handling.

The lecture builds a clear conceptual model of multiprogramming: because individual programs alternate between CPU execution and I/O waiting, a single program leaves the processor idle. By loading several jobs into main memory from a disk job pool, the OS can switch to another ready job whenever one blocks on I/O. The recurring diagram reinforces this by showing the OS, multiple jobs (one explicitly waiting), and the CPU as distinct but connected components. The instructor emphasizes that the processor never waits, using both English slide text and a Hindi annotation to drive home this point. The lesson closes by balancing the benefit—high CPU utilization—against the cost of more complex scheduling and programming.

Loading lesson…