Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements are TRUE?

I, II, and III only
II and III only
I, II, and IV only
I, II, III, and IV

LohaHridoy

4 views

2025-01-04 04:42

1 Answers

AhmedNazir

Option 3 : I, II, and IV only

A process state diagram for a pre-emptive scheduling is:

[ alt="F3 Raju.S 3103-2020 Savita D3" src="//storage.googleapis.com/tb-img/production/20/04/F3_Raju.S_3103-2020_Savita_D3.png" style="width: 568px; height: 242px;">

Statement I: TRUE

A process can move from running state to ready state on interrupt or when priority expires, that is, when it is pre-empted.

Statement II: TRUE

A ready process moves to running process when it is dispatched.

Statement III: FALSE

A blocked process that is in waiting state can never move directly to running state. It must go to ready queue first.

Statement IV: TRUE.

A blocked or waiting process can move to ready state.

Important Point:

The transition from running to ready state is possible only in pre-emptive scheduling. It cannot happen in non pre-emptive scheduling.

4 views Answered 2022-09-04 04:29

Related Questions

Consider the following properties attributed to state model of a system: 1. State model is unique. 2. Transfer function for the system is unique. 3. State model can be derived from transfer function of the system. Which of the above statements are correct?

1 Answers 4 Views

Which of the following statements is/are correct 1. A system is said to be Finite Impulse Response (FIR), if the output samples of the system depend only on the present input and a finite number of past or previous input samples. 2. If the output of a system y(n) depends only on the present input and past inputs, but not on past outputs, then it is called a non-recursive system. 3. If the output of a system y(n) depends only on the present input and past inputs, but not on past outputs, then it is called a recursive system.?

1 Answers 10 Views

Consider the following statements regarding Peer-to-Peer computing environment: 1. In this system, clients and servers are not distinguished from one another. 2. All nodes distributed throughout the system (within) are considered Peers and each may act as either a client or a server. 3. Peer-to-Peer system assuredly offers certain advantages over the traditional client-server system. 4. Peer-to-Peer system is just a replica of the file-server system. Which of the above statements are correct?

1 Answers 5 Views

Consider the following statements: 1. System calls provide the interface between a process and the operating system 2. PERL implementations include direct system call access 3. System calls occur in different ways depending on the computer in use Which of the above statements are correct?

1 Answers 4 Views

Three statements are given followed by four conclusions I, II, III and IV. You have to consider these statements to be true, even if they seem at variance from commonly known facts. Decide which of the given conclusions logically follow/s from the given statement. Statements: I. All parrots are crows. II. All crows are robins. III. All robins are swan. Conclusions: I. All parrots are swans. II. All swans are crows III. All robins are parrots. IV. All crows are swans. ?

1 Answers 4 Views

Consider a set U of 23 different compounds in a Chemistry lab. There is a subset S of U of 9 compounds, each of which reacts with exactly 3 compounds of U. Consider the following statements: I. Each compound in U\S reacts with an odd number of compounds. II. At least one compound in U\S reacts with an odd number of compounds. III. Each compound in U\S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE?

1 Answers 9 Views

In the question below are given three statements followed by three conclusions numbered I, II and III. You have to take the given statements to be true even if they seem to be at variance with commonly known facts. Read all the conclusions and then decide which of the given conclusions logically follows from the given statements disregarding commonly known facts. Statements: I. Few holders are share II. Only a few accounts are bank III. No bank is share Conclusions: I. All share can be holders II. Some bank is not share III. Some accounts are not bank is a possibility?

1 Answers 4 Views

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

1 Answers 4 Views

Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPE) in an IPv4 network. I. RIP uses distance vector routing II. RIP packets are sent using UDP III. OSPF packets are sent using TCP IV. OSPF operation is based on link-state routing Which of the statements above are CORRECT?

1 Answers 4 Views

In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. If TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

1 Answers 4 Views

এক্সাম দিয়ে মেধা যাচাই করুন

Job Preparation (1125)

Admission (754)

এসএসসি (10)

এইচএসসি (5)