Blog

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.

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 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: [a] 2. ADDUCTS the arm at the SHOULDER joint. Muscle Name & Letter: [b] 3. FLEXS the WRIST joint. Muscle Name & Letter: [c]

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

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]

Refer to Figure 8.  This figure shows two major joints of the pectoral girdle & upper limbs.  The joint in the TOP image connects the arm to the axial body. Compare this joint to the joint most similar to it in the pelvic girdle & lower limbs by completing the following blanks.  Similar Pelvic Girdle Joint Name: [a] Compared to Pectoral Girdle Joint (top image in this figure) Name: [b] What is the structural classification of BOTH of these joints? What is the specific type of BOTH of these joints? [c]

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]

Mark True or False for each statement below. 1. The strict alternation approach in busy waiting allows multiple processes to enter the critical region at the same time. [1] 2. In the busy waiting implementation using flagging interest, both processes can become indefinitely blocked if both set their interest flags without entering the critical region. [2] 3. The Peterson Solution eliminates the possibility of deadlocks in the busy waiting approach by combining flagging interest and strict alternation. [3] 4. The test-and-set-lock (TSL) operation is used to implement atomic locking by allowing multiple processes to set a lock at the same time. [4] 5. Mutual exclusion can be achieved through message passing by using a locking server that grants locks to processes based on their requests. [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]