Choose the item which best describes the nonpreemptive scheduling approach. 1. A user process in the running state can only change state to the termination state.
2. Once a user process gets the CPU, it never relinquishes it for any reason.
3. Once a user process gets the CPU, it keeps running until either it terminates, or it issues a blocking I/O request, or it has to wait for a child process to terminate.
4. When a user process enters the ready queue, it is switched into the running state regardless of whether or not another user process is currently running on the CPU.

Ineed on my history if anyone can check out the last few questions i posted and i will be posting !

3. (6 pts) internally in the computer, with few exceptions, all numerical computation is done using binary numbers. output, however, often uses ascii, which is formed by appending 011 to the left of a bcd code. thus, an algorithm that directly converts a binary integer to a bcd integer is very useful. here is one such algorithm 1) draw lines to the left of the binary number to bound the expected bcd decades. (each decade is a group of 4 bits.) move the binary number one bit to the left. add 0011 to each bcd decade containing a binary value> 0100 repeat steps 2-3 until the last bit in the binary number has been moved into the least significant decade position. (note that when the last bit has been shifted into bcd decade, step 3 is not repeated.) read the bcd result. 2) 3) 4) 5) a) execute the algorithm for the binary number 1101101 b) execute the algorithm for the binary number 01110101110 4. (4 pts) represent the decimal number 3568 in bcd; excess-3 code; ascil; and hex.

Hassan is writing his master’s thesis, which is a thirty-page document. he received some feedback from his professor in the form of comments, but does not see where the comments are. what is the fastest way for hassan to find the feedback?