All categories

3 years ago

The possible states of a process are:

Computers and Technology

2 answers:

Vladimir [108]3 years ago

6 0

Answer:

The correct answer is A) New (or created), Running, Waiting, Ready, and Terminated.

Explanation:

When a process is first created, it occupies the "created" or "new" state. In this state, the process awaits admission to the "ready" state
Running process moves into the running state when it is chosen for execution. The process's instructions are executed by one of the CPUs (or cores) of the system. There is at most one running process per CPU or core. A process can run in either of the two modes, namely kernel mode or user mode.
A "ready" or "waiting" process is on that has been uploaded into main memory and is awaiting execution on a processor.
A process may be terminated, either from the "running" state by completing its execution or by explicitly being killed. In either of these cases, the process moves to the "terminated" state. This means that the underlying program is no longer executing

Cheers!

Oliga [24]3 years ago

3 0

Answer:

a. new, running, waiting, ready, and terminated.

Explanation:

The process in a computer system can have different states and these are:

-New: When the process is created.

-Ready: When the process is waiting to be executed.

-Running: When the process is chosen to be executed.

-Waiting: When the process is expecting for something to happen.

-Terminated: When the process is not running anymore.

According to this, the answer is that the possible states of a process are: new, running, waiting, ready, and terminated.

You might be interested in

Although the first GPS satellite was put into orbit in the ___________, GPS did not provide global coverage until _______.

Ilia_Sergeevich [38]

February 22 1978 and 1992

5 0

3 years ago

Which method is useful for dimensionality reduction especially for small data-sets?

Anna [14]

Independent Component Analysis (ICA) is based on information-theory and is also one of the most widely used dimensionality reduction techniques.

8 0

2 years ago

Question 1

Ivanshal [37]

Answer:

Q1. B

Q2. D

Explanation:

3 0

2 years ago

Read 2 more answers

What is the check digit for the following original product number: 140501941 ? *

Natasha_Volkova [10]

Explanation:

I think it is 7, but I could be wrong..... sorry

8 0

2 years ago

Read 2 more answers

Consider the following Stack operations:

maxonik [38]

Answer:

Sequence of popped values: h,s,f.

State of stack (from top to bottom): m, d

Explanation:

Assuming that stack is initially empty. Suppose that p contains the popped values. The state of the stack is where the top and bottom are pointing to in the stack. The top of the stack is that end of the stack where the new value is entered and existing values is removed. The sequence works as following:

push(d) -> enters d to the Stack

Stack:

d ->top

push(h) -> enters h to the Stack

Stack:

h ->top

d ->bottom

pop() -> removes h from the Stack:

Stack:

d ->top

p: Suppose p contains popped values so first popped value entered to p is h

p = h

push(f) -> enters f to the Stack

Stack:

f ->top

d ->bottom

push(s) -> enters s to the Stack

Stack:

s ->top

d ->bottom

pop() -> removes s from the Stack:

Stack:

f ->top

d -> bottom

p = h, s

pop() -> removes f from the Stack:

Stack:

d ->top

p = h, s, f

push(m) -> enters m to the Stack:

Stack:

m ->top

d ->bottom

So looking at p the sequence of popped values is:

h, s, f

the final state of the stack:

m, d

end that is the top of the stack:

6 0

3 years ago