Types of Real Time Operating System

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/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. 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.

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…