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. [1]  2. A proposed solution involves semaphores. [2]  3. A proposed solution involves alpha locks. [3]  4. Otherwise known as the persistent database problem. [4] 

Select which scheduler corresponds to each statement: 1. The goal is to maximize throughput [1] 2. One of its constraints involves being lightweight [6] 3. Also called the memory scheduler[3] 4. Decided what remains in memory and what gets placed back into storage[4] 5. Generally not used in interactive operating systems  [2] 6. Decide which process gets to be executed next in the CPU[5]

Select whether each of the statements is true for preemptive scheduling algorithms, non-preemptive scheduling algorithms, both, or neither. This class of scheduling algorithms minimizes the number of process/context switches that occur. [1] More suited for interactive operating systems serving and interacting with many users. [2] Always invokes a scheduler when a process is killed or removed/preempted from the CPU. [3] Historically, appeared later in interactive operating systems for personal computers. [4]

Which of the following are properties of user-space threads, kernel-space threads, both or neither? In a multicore system, this type of threading can’t execute multiple threads from the same process at the same time. [1] This type of thread is created with a non-OS-native API. [2]  This type of thread has its own program counter and state. [3]  This type of thread can be scheduled by an OS-independent algorithm. [4]  When using this type of thread, threads belonging to the same process share the same stack. [5] 

Given the following batch jobs Calculate the mean turnaround time (MTT) using the Shortest Job First non-preemptive scheduling algorithm. Answer with a number. For example “3.45” or “3”. Priority 0 is the lowest priority.

Consider the following pseudocode for threads that communicate using a linux pipe (message passing). What is the order that the functions (e.g. horse(), cat(), etc) run in? Note that, with Pipes, the receiving operation blocks the thread until the message is received.   pipe pipe1 = new Pipe(); pipe pipe2 = new Pipe();   void thread1() {      receive_from_pipe(pipe1);      zebra();      write_to_pipe(pipe2, “msg1”);      receive_from_pipe(pipe1);      horse();      waterfall();      write_to_pipe(pipe1, “msg3”);      receive_from_pipe(pipe1); }   void thread2() {      dog();      write_to_pipe(pipe1, “msg2”);      receive_from_pipe(pipe2);      cat();      write_to_pipe(pipe1, “msg4”); }

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?  [n] 2.  One corner point does NOT lie on the x or y axis, what is the y-value of this corner point?  [y] 3.  What is the maximum profit?  [P]  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 9.  There is a special joint in the hand that allows the human thumb to ‘oppose’ – opposable thumbs allow us to grab and hold better than some other mammals.  Name the specific type of joint that makes our thumbs opposable: [a] Identify the structural classification of this joint: [b] Name the two bones that form this joint (be as specific as possible!): [c]

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: [a] 2. EXTENDS the WRIST. Muscle Name & Number: [b]

Refer to Figure 9. For each of the following bone pairs, name the TWO BONES and the SPECIFIC TYPE of JOINT between them. Name of Bones 2 & 3: [a], specific type of joint: [b] Name of Bones 9 & 11: [c], specific type of joint: [d] Name of Bones 10 & 12: [e], specific type of joint: [f]