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]

Refer to Figure 9. For each of the following bone pairs, name the TWO BONES (be as specific as possible!) and the SPECIFIC TYPE of JOINT between them. Name of Bones 1 & 2: [a], specific type of joint: [b] Name of Bones 5 & 6: [c], specific type of joint: [d] Name of Bones 9 & 11: [e], specific type of joint: [f]

Mark True or False for each statement below. 1. In modern operating systems, data exchange between the user and an I/O device always bypasses the kernel. [1] 2. Programmed I/O with polling requires the CPU to continuously check if a device is ready for data transfer. [2] 3. Interrupts allow a device to notify the CPU when it is ready, which is more efficient than polling. [3] 4. In Direct Memory Access (DMA), the CPU directly manages data transfers between memory and the I/O device. [4] 5. In a programmed I/O interrupt-driven approach, the CPU is blocked until the device has completed its task. [5]

Mark True or False for each statement below. 1. The Dining Philosophers problem is used to demonstrate the pattern of circular deadlock in concurrent programming. [1] 2. In the Producer-Consumer problem, data is persistent and can be read multiple times and rewritten when necessary. [2] 3. In the Producer-Consumer problem, multiple producers and consumers should be able to access the buffer concurrently. [3] 4. The Readers-Writers problem deals with concurrent access to a bounded buffer where data is consumed as soon as it is read. [4] 5. In the Producer-Consumer problem, semaphores can be used to prevent corrupt shared variables and avoid race conditions. [5]

Mark True or False for each statement below. Kernel-space threads can have threads with different states (e.g., ready, blocked). [1] Threads in a multithreaded process share code, data, and file descriptors, but have their own register information and stack. [2] User-space threads are managed by the operating system’s scheduler. [3] User-space threads can block the entire process if one thread requests a blocking operation. [4] Each process in a kernel-space multithreaded system has a separate thread table for managing threads. [5]

Mark True or False for each statement below. 1. In contiguous file allocation, files are stored in sequential order on the drive, which can lead to fragmentation issues. [1]2. Linked list allocation is efficient for random access because each block contains a pointer to the next. [2]3. File Allocation Table (FAT) is an example of chained table allocation, where the linked list of blocks is stored in memory to reduce disk access. [3]4. Indexed allocation uses an index block containing pointers to each file block, which allows more flexibility in file size than a single pointer. [4]5. Multi-level indexed allocation combines direct and indirect blocks, allowing for larger maximum file sizes compared to a single-level index. [5]

Mark True or False for each statement below. 1. Batch scheduling systems aim to maximize CPU utilization and minimize mean turn-around time. [1] 2. Shortest Job First (SJF) scheduling requires prior knowledge of the duration of each job to be optimal. [2] 3. Mean Turn-Around Time (MTT) is calculated by dividing the total turn-around time of all processes by the number of processes. [3] 4. The Crystal Ball algorithm is a practical, real-time scheduling algorithm used to optimize turn-around time. [4] 5. Priority-based scheduling assigns the highest priority to processes with the largest CPU time. [5]