MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Program vs Processes

Consider the ...

Question

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?

A

I, II and IV only

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

I, II and III only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

II and III only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

I, II, III and IV

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A I, II and IV only
Statement I, II and IV are correct.

Suggest Corrections

thumbs-up

0

Similar questions

Q. In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state:

Now consider the following statements:
I. If a process makes a transition D, it would result in another process making transition A immediately
II. A process

P_{2}

in blocked state can make transition E while another process

P_{1}

is running state
III. The OS uses preemptive scheduling
IV. The OS uses non-preemptive scheduling

Which of the above statements are TRUE?

Q. The maximum number of processes that can be in Ready state for a computer system with n CPUs is

Q. Which of the following events does not affect a process in the running state?

Q. Consider the following statements with respect to user-level threads and kernel-supported threads
(i) Context switch is faster with kernal-supported threads
(ii) For user-level threads, a system call can block the entire process
(iii) Kernel-supported threads can be scheduled independently
(iv) User-level threads are transparent to the kernel

Which of the above statements are true?

Q. 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?

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Program vs Processes

OTHER

Watch in App

explore_more_icon

Explore more

Program vs Processes

Join BYJU'S Learning Program

CrossIcon