Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Operating Systems and Networking - Exam 1 Practice | CS 330, Exams of Operating Systems

Material Type: Exam; Professor: Sengupta; Class: Operating Systems & Networking; Subject: Computer Information Science; University: SUNY Institute of Technology at Utica-Rome; Term: Fall 2006;

Typology: Exams

Pre 2010

Uploaded on 08/09/2009

koofers-user-v7f-1
koofers-user-v7f-1 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Test I
Operating Systems and Networking
CS-330
Fall 2006
Time: 2:00 hrs.
Answer any five questions from below
Policy: Open books and open notes
Date: September 27, 2006
1. State three major objectives that an Operating Systems module attempts to
accomplish in a modern multi-user, multi-tasking computing systems.
Rationalize your answer.
2. What is cycle stealing in DMA set up? What cycle are we referring to? When the
bus is captured by the DMA module for data transfer, it is possible that CPU
sometimes may need the bus to access the memory. How would it be handled by
the system?
3. One approach to handling multiple interrupts is to ignore them altogether by
disabling further interrupts while the current interrupt is being handled. How well
would it work? What would be its problems, if any?
4. Why fairness is a serious issue in process scheduling? Is fairness principle
abandoned in time-sharing round robin system where each participating job gets
the same time-slice? Is fairness still valid as an objective in FCFS
multiprogramming system? State your reasons.
5. What are the process states in a 5-state model? Suppose we add “Suspended state”
in it. How does a job exit from a suspended state? To speed up the entire process,
a suggestion is made that jobs “under certain conditions” may be allowed to
proceed directly to the running state from a suspended state when released.
Comment on this design.
6. Suppose a ready job (that’s a job waiting for CPU in the CPU queue) is indicated
by three-component vector associated with the job: (Job ID, CPU time needed,
and time it arrived at the CPU queue). Given, (A, 1, 0), (B, 3, 2), (C, 4, 2), (D, 5,
3) and (E, 3, 3), find the schedule time and average waiting time per job under
each discipline:
a. FCFS
b. RR with a time slice of
2
7. What is the objective(s) of a short-term scheduler? In what way does it differ from
that of a medium-term scheduler? What is more likely to be costlier if the
pf2

Partial preview of the text

Download Operating Systems and Networking - Exam 1 Practice | CS 330 and more Exams Operating Systems in PDF only on Docsity!

Test I Operating Systems and Networking CS- Fall 2006 Time: 2:00 hrs. Answer any five questions from below Policy: Open books and open notes Date: September 27, 2006

  1. State three major objectives that an Operating Systems module attempts to accomplish in a modern multi-user, multi-tasking computing systems. Rationalize your answer.
  2. What is cycle stealing in DMA set up? What cycle are we referring to? When the bus is captured by the DMA module for data transfer, it is possible that CPU sometimes may need the bus to access the memory. How would it be handled by the system?
  3. One approach to handling multiple interrupts is to ignore them altogether by disabling further interrupts while the current interrupt is being handled. How well would it work? What would be its problems, if any?
  4. Why fairness is a serious issue in process scheduling? Is fairness principle abandoned in time-sharing round robin system where each participating job gets the same time-slice? Is fairness still valid as an objective in FCFS multiprogramming system? State your reasons.
  5. What are the process states in a 5-state model? Suppose we add “Suspended state” in it. How does a job exit from a suspended state? To speed up the entire process, a suggestion is made that jobs “under certain conditions” may be allowed to proceed directly to the running state from a suspended state when released. Comment on this design.
  6. Suppose a ready job (that’s a job waiting for CPU in the CPU queue) is indicated by three-component vector associated with the job: (Job ID, CPU time needed, and time it arrived at the CPU queue). Given, (A, 1, 0), (B, 3, 2), (C, 4, 2), (D, 5,
    1. and (E, 3, 3), find the schedule time and average waiting time per job under each discipline: a. FCFS b. RR with a time slice of (^)  2
  7. What is the objective(s) of a short-term scheduler? In what way does it differ from that of a medium-term scheduler? What is more likely to be costlier if the

scheduler is not properly designed or lack adaptation capability to challenges of a changing environment. State your reasons.

  1. Consider a multi-blocked queues system design we have on page 119 of the book. It shows basically a ready queue system such as you see here (in this case, though, we offer only two blocking queues – budget problem as you know). Is it possible for a job to be in multiple blocking queues simultaneously? If so, how? How would you design multiple blocking queues to cater for such events?
  2. Some people tend to support the assertion that it’s all fine to talk about various different types of real memory allocation schemes such as Best fit, First Fit, Next Fit, etc. theoretically, but at the end it all boils down to memory fragmentation regardless off the scheme followed. It all leads to same problem of memory leaking. Is that basically the most appropriate view? State your reasons. Good luck! CPU release Time-out Blocking queues

Q 1

Q 2

On blocking CPU-Queue