Match each of the following process segments with their content:

Identify whether the following statements apply to the producer-consumer problem, the readers-writers problem, neither, or both. 1. This strategy involves a finite data buffer.   2. A proposed solution involves semaphores.   3. A proposed solution involves alpha locks.   4. Otherwise known as the persistent database problem.  

Select whether each of the following statements is True or False. “Masking” is a strategy used to manage multiple interrupts. Imprecise Interrupts are less complex to implement/handle than Precise Interrupts. Interrupts are invoked at pre-defined moments in time. The developer must decide when interrupts will happen. Once the interrupt is handled successfully, the process that caused the interrupt is executed immediately.  

Select whether each of the statements is true for message passing, shared memory, both, or neither. Requires processes to set up a network connection with one another. Test-And-Set-Lock (TSL) may be used to resolve possible synchronization issues that occur with this technique.  Can be used to facilitate Inter-Process Communication between processes executing in physically distributed systems. Network Sockets can be used with this Inter-Process Communication strategy.

This fake “question” is to protect students from accidental “tab-enter” errors. It is not worth any points, but you can write a polite message here. 🙂

For each question, choose True or False: 1. A deadlock condition can only happen if all processes of the considered set of processes are in blocked states.  2. Shadow Copies, aka Copy-On-Write, allow multiple processes to write concurrently to a finite buffer.   3. Monitors are a language construct that uses conditional variables.   4. A binary semaphore is similar to a mutex but it cannot be unlocked by any thread.  

A farm consists of 220 acres of land.  The farmer plans to plant corn (x) and oats (y).  Profit per acre in corn is $40 and in oats is $25.  The number of labor hours is 300; where each acre of corn requires 2 hours, and oats require 1 hour per acre.  Determine the number of acres of corn and of oats that should be planted to maximize profit. Graph the feasible solution and find the corner points.  1.  How many corner points exist for the feasible solution?  2.  One corner point does NOT lie on the x or y axis, what is the y-value of this corner point?  3.  What is the maximum profit?    Do NOT put a comma nor $ sign in your answer for the thousands mark (i.e., use 2000 and NOT $2,000.00).  You may round your answer to the nearest dollar. (When you finish, make sure to show your work to the camera for few seconds, submit your work after you finish the exam. The submitted copy must match what you showed to the camera.  Answers without the chart will not be counted)

Refer to Figure 7.  For each of the following bones, identify whether they are LEFT or RIGHT:  BONE A: BONE C: BONE E: BONE G:

Refer to Figure 13.  Name a muscle that performs the following actions AND include the Number that labels it on the figure.  1. FLEXES the FINGERS. Muscle Name & Number: 2. EXTENDS the WRIST. Muscle Name & Number:

Refer to Figure 10.  Name a muscle that performs the following actions AND include the Letter that labels it on the figure.  1. FLEXES the ELBOW joint. Muscle Name & Letter: 2. ADDUCTS the arm at the SHOULDER joint. Muscle Name & Letter: 3. FLEXS the WRIST joint. Muscle Name & Letter: