(1) How many integers between 10 and 99 (including 10 and 99) are divisible by both 4 and 6? (Please enter your answer as an integer.) (2) How many integers between 10 and 99 (including 10 and 99) are divisible by either 4 or 6? (Please enter your answer as an integer.) (3) What is the probability of randomly selecting an integer between 10 and 99 (including 10 and 99) that is divisible by either 4 or 6? (Please enter your answer in the form m/n, where m and n are integers.)  

(1) How many ways can the letters of the word STARLINK be arranged in a row. (Please enter your answer as an integer.)  (2) How many ways can the letters of word STARLINK be arranged in a row if the letters LINK must remain together as a unit at the end of the arrangement? (Please enter your answer as an integer.) 

A certain passcode is required to be a sequence of any 3 digits chosen from the ten digits followed by 2 letter chosen from the set {a, b, c, d}. (1) How many passcodes are possible if repetition of digits and letters is allowed?  (2) How many passcodes contain no repeated digits and no repeated letters? (3) How many passcodes are possible if repetition of digits is allowed but no repeated letters? (4) What is the probability that a passcode chosen at random has at least one repeated digit or one repeated letter,  assuming that all passcodes are equally likely? (Please fill the blank with a numerical value in the form of m/n, where m and n are positive integers.)  In (1), (2) and (3), please enter your answers as integers.

 Assume a system with four resource types, C = < 7, 9, 6, 6 > (this is the total number of resources in the system, andnot what is currently available), and the maximum claim table shown below: Process R0 R1 R2 R3 P0 6 9 0 1 P1 3 4 4 3 P2 2 7 4 2 P3 6 3 4 5 P4 1 2 2 1 The resource allocator is considering allocating resources according to the following table: Process R0 R1 R2 R3 P0 0 2 0 0 P1 2 2 2 2 P2 2 3 0 1 P3 2 0 2 2 P4 1 2 1 1   Run the avoidance algorithm on this system to determine if this state is safe.  If it is safe, give the sequence in which processes can be run. If it is unsafe, enumerate the processes that could in the future get involved in a deadlock.Show your steps from the algorithm (amount of resources free after each step). You will need to calculate the available resources and the maximum needs in the future for each process.

Is there a problem with the statement “As a deadlock is a set of blocked processes, we can just have the system sometimes look to see if a set of processes have been blocked for awhile and then terminate them.”? Explain your answer.

What types of processes does the round robin scheduler give an “unfair” amount of time to? Explain your answer.

Assume a multi-level feedback queue with 3 queues, numbered 0 through 2. The system has a variable time quantum per queue, with the highest priority queue having a time quantum of 3ms and with this time quantum doubling as we go down in priority. Consider an incoming job with a total burst time requirement of 40ms. Suppose that this job ends up getting blocked after running for 10 ms and then after running for an additional 30ms (it would have run for 40 total at this point) after it became unblocked. How many times will this job be interrupted (assuming nothing else would cause it to be interrupted) and what queue will it finish executing in? How much time did it spend in each queue?

On the picture below, which arrow indicates the proper site for administration of an IM vaccine?     

When administering an IM vaccine, what should you do if you hit the patient’s bone?

You measure a patient’s pulse obliteration pressure (POP) to be 140 mmHg. Which of the following pictures below accurately depicts how high the cuff should be inflated in order to measure the patient’s blood pressure?