Koofers

Past Exam for CSI 4337 - Introduction to Operating Systems at Baylor (BU)

Exam Information

Material Type:Exam 2
Professor:Staff
Class:CSI 4337 - Introduction to Operating Systems
Subject:Computer Science
University:Baylor University
Term:Spring 2003
Keywords:
  • Instructions
  • Gantt Chart
Login / Sign Up to View Document
Preview Page 1

Sample Document Text

CSI 4337 Exam #2 Mar. 25, 2003 STUDY SHEET 1. Given two processes P1 and P2, and a shared variable S, show how two arithmetic statements can produce erroneous results if no protection for the critical section is used. 2. Given two processes, each of which have a critical section with respect to a variable Q, show how to protect these critical sections TestAndSet instructions and semaphores. 3. Give the average wait time for the following set of processes using the two scheduling algorithms FCFS, and SJF. Draw the Gantt chart for each algorithm. Process Burst Time P0 21 P1 12 P2 2 P3 9 P4 5 3. Using two semaphores S1 and S2, show how a deadlock can occur between two processes, even if the semaphores are used correctly. 4. List the five conditions necessary for deadlock. 5. Is the following system safe? Has Max Free A B C D A B C D A B C D P0 3 0 1 1 1 1 0 0 1 0 2 0 P1 0 1 0 0 0 1 1 2 P2 1 1 1 0 3 1 0 0 P3 1 1 0 1 0 0 1 0 ...
155, "/var/app/current/tmp/"