Structure of operating system

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/introduction-to-os/os-structure-interface/asset-structure-of-operating-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…