Practice_Question_Os_physical Addressing

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/memory-management/segmentation-hybrid/asset-practice-question-os-physical-addressing 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 presents a problem involving memory management in operating systems, specifically focusing on the use of relocation and limit registers to determine valid memory access. The instructor displays a table listing five processes (P0 to P4) with their corresponding Limit and Relocation register values. Below the table, a list of logical address requests from these processes is provided. The core task is to evaluate each request to determine if it is legal (within bounds) or illegal (out of bounds) and, if legal, to calculate the resulting physical address. The instructor systematically analyzes each process request, comparing the requested logical address against the process's limit register value. For valid requests, he demonstrates the calculation of the physical address by adding the logical address to the base address found in the relocation register.

Chapters

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

    The instructor begins by analyzing the first request from process P0, which is 450. He checks the limit register for P0, which is 500. Since 450 is less than 500, he marks it as legal. He then calculates the physical address by adding the logical address (450) to the relocation register value (1200), resulting in 1650. Next, he moves to P1 with a request of 300. The limit register for P1 is 275. Since 300 is greater than 275, he marks this attempt as illegal. He proceeds to P2 with a request of 210. The limit is 212, so 210 is valid. He calculates the physical address as 880 + 210 = 1090. Then, for P3, the request is 450, but the limit is 420, making it illegal. Finally, he addresses P4 with a request of 80. The limit is 118, so it is legal, and the physical address is calculated as 200 + 80.

  2. 2:00 – 2:16 02:00-02:16

    The instructor completes the calculation for process P4. He writes down the sum of the relocation register (200) and the logical address (80), resulting in a physical address of 280. He circles the final answer and briefly concludes the problem-solving session, having successfully identified the illegal attempts and calculated the physical addresses for the valid ones.

The lesson effectively demonstrates the mechanism of address binding and protection in memory management. By comparing logical addresses against limit registers, the system ensures processes do not access unauthorized memory regions. The addition of the relocation register value shifts the logical address space to the correct physical location, illustrating how dynamic relocation works in a multitasking environment.

Loading lesson…