Structure of operating system

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/introduction-to-os/os-structure-interface/asset-structure-of-operating-system 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.

The video lecture covers the "Structure of Operating System," contrasting the "Simple Structure" with the "Layered Approach." The instructor explains that while partitioning tasks into modules is common, many systems like MS-DOS evolved from simple beginnings without strict structures. He then details the layered approach, where the OS is broken into pieces with hardware at the bottom and the user interface at the top, utilizing information hiding for modularity.

Chapters

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

    The instructor starts by reading from the slide titled "Structure of Operating System." He discusses the first bullet point about partitioning tasks into modules. He then focuses heavily on the "Simple Structure" section. He explains that many operating systems do not have well-defined structures and often started as small, simple, and limited systems before growing beyond their original scope. He explicitly mentions "MS-DOS is an example of such a system." To illustrate this, he draws a red diagram on the screen consisting of a large rectangle with smaller rectangles inside, representing a simple, unstructured collection of components. He underlines the phrase "Simple Structure" and the text "MS-DOS" to emphasize these key concepts.

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

    The lecture transitions to the "Layered Approach." The instructor explains that with proper hardware support, operating systems can be broken into pieces while retaining control. He discusses how implementers have more freedom in changing inner workings and creating modular systems. He describes a top-down approach where overall functionality is determined and separated into components. He emphasizes the importance of "information hiding," which leaves programmers free to implement low-level routines. Visually, he draws concentric circles on the slide to represent the layers. He labels the innermost circle "layer 0, hardware" and the outermost circle "layer N, user interface." He draws arrows between the layers to show the flow of control, illustrating how higher layers interact with lower layers.

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

    The video ends shortly after the instructor finishes drawing the layered diagram. The slide remains visible, showing the concentric circles labeled "A layered operating system." The instructor is visible in the bottom left corner, gesturing as he concludes his explanation of the layered structure. The text on the slide reinforces that the bottom layer is hardware and the highest layer is the user interface.

The lesson effectively contrasts two structural models: the simple, often unstructured growth of early systems like MS-DOS versus the organized, modular nature of layered systems. The instructor uses visual aids, such as drawing boxes for simple structures and concentric circles for layered systems, to make abstract concepts concrete. The progression moves from the limitations of simple structures to the benefits of the layered approach, such as information hiding and modularity. This provides a foundational understanding of how operating systems are architecturally designed to manage hardware and software resources efficiently.

Loading lesson…