Problem 6: Unix access controlIn Unix, every process has a real user id (ruid), an effective user id (euid), and a saved user id(suid). Processes with an euid of 0 have special root privileges.a. If a process with user id n forks to create another process, what user id does the newprocess have? (Hint: it's the same answer for euid, ruid, and suid.)b. If a process with euid n makes a setuid system call, what possible euids can theprocess run with after the call, in each of the following situations:a. Before: euid = n > 0, saved user id suid=m and real user id ruid = m. After:?b. Before: n=0 After:?c. In qmail, most modules run under separate user ids. Similarly, each Androidapplication runs in a separate process using a separate user id. From a securitystandpoint, what is the advantage of assigning separate uids instead of using thesame uid for all? Explain.d. Why should the separate uids be non-zero?

Answer a) It will have the same user id .

Answered: a. If a process with user id n forks to…

a. If a process with user id n forks to create another process, what user id does the new process have? (Hint: it's the same answer for euid, ruid, and suid.)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: I would appreciate it if you could provide an example of some code so that I can better understand…

A: A process is a component of software that is being executed by the computer as part of its operating…

Q: Type r in the top utility to change the priority of a running process. When asked which

A: Type r in the top utility to change the priority of a running process.process to change (renice),…

Q: draw a state machine diagram of following scinerio using gaurd / trigger : A patient login into…

A: draw a state machine diagram of following scinerio using gaurd / trigger : A patient login into…

Q: Canceling processes and breaking out of deadlocks may be accomplished using one of these two…

A: Deadlock: Deadlock occurs when two or more processes are unable to move forward because they are…

Q: Give a thorough description of the wait() process's role in relation to process termination using an…

A: Answer:- A call to wait() blocks the calling process until one of its child processes exits or a…

Q: When the schedule is said to cascade less?

A: Introduction: Cascades schedules are those in which transactions read values only after all…

Q: IS THE MECHANISM THAT ENSURES THAT ONLY ONE PROCESS IS DOING CERTAIN EXECUTION AT ONE TIME. Select…

A: The problem is based on the basics of process synchronisation in operating systems.

Q: These two methods may cancel processes and break deadlocks:

A: We must develop two strategies for stopping processes and resolving deadlocks on the information…

Q: There are two methods available for cancelling processes and overcoming deadlocks, respectively:

A: The two methods available for cancelling processes and overcoming deadlocks are: 1. Process…

Q: The following results would occur if certain processes were abandoned when a deadlock was reached:

A: Introduction: A low-cost process' termination should be delayed in the case of a stalemate. Under…

Q: Is it possible to have a deadlock involving only one single process? Explain your Consider a system…

A: Deadlock A deadlock is a situation in which two computer programs sharing the same resource are…

Q: Explain how wait() is used to end a process, preferably with an example of its use in code.

A: In programming, the wait() method is typically used in the context of multithreading to pause the…

Q: Give a thorough description of the wait() process's function in relation to process termination…

A: The wait() function is used in operating systems to allow a parent process to wait for a child…

Q: "Many processes"-what does it mean? Can it be stated more clearly?'

A: Here is your solution -

Q: Ricart and Agrawala's algorithm has the problem that if a process has crashed and does not reply to…

A: Suppose that a process denies permission and then crashes. Then requesting process thinks that it is…

Q: When there is a stalemate, those processes should be terminated, with the following results:

A: Introduction: In the event of a deadlock, the termination of a low-cost process should be postponed.

Q: In this assignment, you will develop a user interface for three different functions of an operating…

Q: Please provide the correct answer for this question that is incorrect, explain why my answer is…

A: To correct the answer to this question, you need to use semaphores to enforce the given precedence…

Q: In the event that such processes reach a stalemate, an end should be put to them.

A: REACH process: REACH (EC 1907/2006) seeks to enhance the protection of human health and the…

Q: Can a single process get stuck in a snag during execution? Logic should accompany your comments.

A: Integrated procedure: A one-step colouring service is a single-process colouring service. It's not…

Q: Please provide the correct answer for this question that is incorrect, explain why my answer is…

A: Step 1:Statement 1: A lock and the mutex are the two names for the same thing. This argumentation is…

Q: Ricart and Agrawala's algorithm has the problem that if a process has crashed and does not reply to…

A: Answer is

Q: Is it possible for a single process to reach a state of deadlock? Justify your responses.

A: Given: Is it conceivable for a single process to become stuck in a stalemate state? Justify your…

Q: Can a single process become stuck in a snag during execution? The reasoning behind your answers is…

A: A deadlock occurs when many processes seek to access a resource that is already in use by another…

Q: Are you aware that there are two alternative methods for terminating processes and breaking…

A: A process could be terminated if it tries to use a resource that it is not allowed to. For example -…

Q: Is it possible for a single process to get stuck in the middle of its execution? Please provide…

A: Deadlock is a scenario in which many processes attempting to use a resource that is currently in use…

Q: Given is the scenario for the three processes p0,p1 and P2. You need to find out whether deadlock…

A: Given table contains three processes that are P0, P1 and P2. Each process contains some allocation…

Q: Explain the function of the wait() process in relation to process termination in the full…

A: The wait() function is a very important function in case of multithreading.

Q: There are two methods available for canceling processes and overcoming deadlocks, which are as…

A: Definition: We must specify two techniques for aborting processes and breaking deadlocks based on…

Q: Is it feasible to terminate one process while it is still carrying out another? Explicate your…

A: in most modern operating systems, it is generally not feasible to terminate a process while it is…

Q: . In the multiprogramming system, a set of processes is deadlock if each process in the set is…

A: The answer is as follows:-

Q: Please provide an example of code to help me comprehend how the wait() method functions in the…

A: Certainly! Before diving into the example, let's understand the wait() method and its role in…

Q: Assuming that int status; has previousiy been run by the parent of a child process, consider the…

A: Given: To choose the correct option.

Q: In the event of a deadlock, those processes should be abandoned, leading to the following results:

Q: you are to implement deadlock prevention before the processes above reach the critical section,…

A: Lets see the solution.

Q: b. What are the different states a process can be in from creation to termination? For each state,…

A: Defined the different states a process can be in from creation to termination

Q: Ricart and Agrawala's algorithm has the problem that if a process has crashed and does not reply to…

Concept explainers

Concurrency Control

The simultaneous occurrence of two or more operations is called concurrence and the situation is called concurrency. In concurrency, the function of one operation can affect the function of the other and put data integrity at risk. Hence, management for the control of concurrency is required. The management or controlling system in the Database Management System (DBMS) that coordinates concurrent access is called the concurrency control system.

Question

Problem 6: Unix access control
In Unix, every process has a real user id (ruid), an effective user id (euid), and a saved user id
(suid). Processes with an euid of 0 have special root privileges.
a. If a process with user id n forks to create another process, what user id does the new
process have? (Hint: it's the same answer for euid, ruid, and suid.)
b. If a process with euid n makes a setuid system call, what possible euids can the
process run with after the call, in each of the following situations:
a. Before: euid = n > 0, saved user id suid=m and real user id ruid = m. After:?
b. Before: n=0 After:?
c. In qmail, most modules run under separate user ids. Similarly, each Android
application runs in a separate process using a separate user id. From a security
standpoint, what is the advantage of assigning separate uids instead of using the
same uid for all? Explain.
d. Why should the separate uids be non-zero?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

It is recommended that, in the event of a standstill, those processes be terminated, which will result in the following outcomes:
There are two methods available for terminating processes and, accordingly, overcoming deadlocks:
IS THE MECHANISM THAT ENSURES THAT ONLY ONE PROCESS IS DOING CERTAIN EXECUTION AT ONE TIME. Select one: a.MUTUAL EXCLUSION b.COMPETING PROCESSES c.RACE CONDITION d.CRITICAL SECTION
Can a single process get stuck in a snag during execution? Your answers should make sense and adhere to logic.
May I ask for part (iii), user -> nonregistered and user -> registered is in which NF? it wasn't clear. The follow up answer was for a different question.
These two methods may cancel processes and break deadlocks:
There are two ways for terminating processes and breaking deadlocks.
Explain the function of the wait() process in relation to process termination in the full explanation using an example from your own experience (your own words).
During the course of its execution, may a single process get stalled? Your replies should be supported by rationalel
How the processes should be followed? In Tom's case
There are two methods for stopping processes and breaking deadlocks:
The question of when and how to use buddy functions is addressed here. Some instances of how to put this into action