Types of Real Time Operating System

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/introduction-to-os/os-types-evolution/asset-types-of-real-time-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.

This educational video provides a comparative analysis of Hard and Soft Real-Time Operating Systems (RTOS). The instructor begins by defining Hard Real-Time OS, emphasizing its strict adherence to deadlines where failure to meet a deadline results in total system failure. The lecture then transitions to Soft Real-Time OS, explaining that while it has deadlines, missing them does not cause catastrophic failure but rather a degradation in performance. Visual aids, including graphs plotting "Value/Usefulness" against "time," are used to illustrate the distinct behaviors of these systems. Examples such as automotive safety systems and video games are provided to contextualize the theoretical concepts for students.

Chapters

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

    The segment introduces the "Hard real-time operating system" via a slide containing specific text and a graph. The on-screen text states that this OS is "predicted by a deadline" and reacts at "time t = 0." The instructor underlines key phrases like "hard real-time" and examples including "air bag control in cars," "anti-lock brake," and "engine control system." A graph is displayed with "Value/Usefulness" on the y-axis and "time" on the x-axis. A red line represents the system's value, remaining constant until a specific "deadline" point, after which it drops vertically to zero. The instructor uses a red pen to draw on the slide to emphasize that missing the deadline renders the system useless. A background image of a control room with operators reinforces the critical nature of these systems. The core takeaway is that in Hard RTOS, meeting the deadline is mandatory; otherwise, the consequence is failure.

  2. 2:00 – 3:52 02:00-03:52

    The lecture shifts to "Soft real-time operating system." The slide text explains that deadlines "may be missed" and action is taken at "time t=0+." It notes that this OS "does not contain constrained to extreme rules" and critical time is "delayed to some extent." The instructor underlines examples such as "digital camera," "mobile phones," and "online data." The accompanying graph shows a green line that stays constant until the deadline, then slopes downward gradually rather than dropping instantly. The instructor draws on the graph to show this gradual decline in value. An image from the game "PlayerUnknown's Battlegrounds" is shown as a visual example. The explanation highlights that while performance degrades after the deadline, the system remains functional, unlike the Hard RTOS where value becomes zero immediately.

The video effectively contrasts Hard and Soft Real-Time Operating Systems by focusing on deadline strictness and the consequences of missing them. Hard RTOS is characterized by a binary outcome where value is either full or zero, suitable for safety-critical applications. Soft RTOS allows for flexibility, where value degrades over time, making it suitable for multimedia and consumer electronics. This distinction is crucial for understanding system design requirements in embedded computing and selecting the appropriate OS for specific hardware constraints.

Loading lesson…