HomeworkLib
Question

23. What is the value of the Relocation Register for Process 2? operating system 256000 process 2 Relocation Register 300040
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Question 23

Relocation is a base register which hold the smallest physical address

Here the value of relocation register for process P2 is 256000.

O operating system 256000 256000 process 2 base 300040 processi 420940 process 880000 1024000

The value in the relocation register is added to every address generated by a user process at the time it is sent to memory.

The user program deals with logical addresses; it never sees the real physical addresses

relocation register 14000 logical address physical address CPUH memory 346 14346 MMU

Question 24

phpKuWAHJ.png

Here there is a cycle which indicates the presence of deadlock

0 0
Add a comment
Know the answer?
Add Answer to:
23. What is the value of the Relocation Register for Process 2? operating system 256000 process...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • T/F question about operating system, thank you 1. A deadlocked system must involve at least two...

    T/F question about operating system, thank you 1. A deadlocked system must involve at least two threads/processes that are deadlocked. 2. If all 4 following conditions hold in a system: mutual exclusion, hold and wait, circular waiting, and no pre-emption, then a deadlock must occur. 3. In avoidance strategy, the OS may refuse to allocate requested resources if there is a potential for a deadlock. 4. Given a reusable resource graph representing a state S, state S is a deadlock...

  • Operating Systems Questions 1. What is the difference between a blocked state and a deadlock state?...

    Operating Systems Questions 1. What is the difference between a blocked state and a deadlock state? 2. How do you define the state of the operating system? 3. Differentiate between daemons and zombies. 4. What is the maximum number of process in a standard Linux installation? Why is the number of processes limited to this number? Can it be changed?

  • operating system 6) Banker's algorithm is used in deadlock avoidance, and the following table presents the...

    operating system 6) Banker's algorithm is used in deadlock avoidance, and the following table presents the current situation: hAvailable e Need Allocation 2 31vqas 5 2 3 1 10 PO 1 20 P1 2 0 1 4 20 P2 1 0 2 no0 1 1 to P3 43 1 3 3 2 P4 1 12 Questions: (1) is the current situation safe? (2) if PO requests (2, 2, 0), will the system allocate the resources? (3) if PO requests (2,...

  • Please give an explanation for the answers as well. 1. A system has three processes (P1,...

    Please give an explanation for the answers as well. 1. A system has three processes (P1, P2, and P3) and three resources (R1, R2, and R3). There is one instance of RI, two instances of R2, and three instances of R3. PI holds RI and one instance of R3 and is requesting one instance from R2. P2 holds one instance of R3 and is requesting RI and one instance from R2. P3 holds two instances of R2 and one instance...

  • Problem 4 (30 points) a) Consider the RISC-V code below. Indicate what is the value in register x20 after the code belo...

    Problem 4 (30 points) a) Consider the RISC-V code below. Indicate what is the value in register x20 after the code below is executed, and explain why; х18 х0 16 ori addi x20 х18 0 beg x20, х18, НERE x20 х20, х20 add HERE Problem 4 (30 points) a) Consider the RISC-V code below. Indicate what is the value in register x20 after the code below is executed, and explain why; х18 х0 16 ori addi x20 х18 0 beg...

  • a. A system has two processes and three identical resources. Each process needs a maximum of...

    a. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer. b. A system has 4 processes, P1 through P4, and 5 types of resources, R1 through R5. Existing resource vector E = (3, 2, 1, 2, 2) Current allocation matrix C = R1 R2 R3 R4 R5 P1 1 1 0 0 0 P2 0 0 1 0 0 P2 1 0 0 20 P4 0...

  • Question 19 For which value of x does the function shown in the graph below appear...

    Question 19 For which value of x does the function shown in the graph below appear to be decreasing?    All values of x No values of x Question 20 For what values of x does the function shown in the graph below appear to be negative?    Question 21 Which graph represents the following table of values? x y 1 2 2 3 4 3.5             Question 22 Which rational expression has and as asymptotes on...

  • Operating System a. What is the meaning of the term busy waiting? What other kinds of...

    Operating System a. What is the meaning of the term busy waiting? What other kinds of waiting are there in an operating system? Can busy waiting be avoided altogether? Explain your answers. (5 pts) b. Explain why spinlocks are not appropriate for single-processor systems yet are often used in multiprocessor systems. (5 pts) c. Using the program shown below, explain what the output will be at lines X and Y. Assume that you have a pre-emptive priority system. (10 pts)...

  • 1. Discuss how users can be authenticated by the operating system to connect to the Oracle...

    1. Discuss how users can be authenticated by the operating system to connect to the Oracle database. how does SQL*Plus relate to this method? 2. What methods does Oracle support for authentication by the network? 3. What are the key components you would include in a password policy? Why? 4. Give an example how you define a good password policy. Can you design a general password policy? Or do you need to design it to consider a particular situation always?

  • <Operating System> 1. A process accesses pages in the following order (Assume all frames are initially...

    <Operating System> 1. A process accesses pages in the following order (Assume all frames are initially empty): 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 Determine the number of page faults that will occur for the following algorithms: (Show your work!) Least Recently Used replacement algorithm with 5 frames available to the process. What is the minimum number of page faults that can occur for this process, regardless...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT