Multiprogramming OS

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/introduction-to-os/os-types-evolution/asset-multiprogramming-os after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…