Structure of operating system

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…