Phillip Graise
Dr. Hong
CSC 518 01
January 31, 2015
Homework #1
1.
Process BATCH_OS
semaphore in=out=1, card=line=0, fcard=fline=1;
process reader;
begin
while(1)
[
]
read record from input device;
[
]
deposit record in input_buffer
[
]
end;
process main;
Spring 2014 Laultnu Mg U! Kim
CSC518 Final Exam (4/28 2014) Print your Name:
Solve the following the problems. Each of them has equal weight (15 points).
Q1 (10 points) For each of the following decimal virtual addresses. computer the Virtual page
number
Homework 3 G05
CSC518 Sp2014
36. Shortest job ﬁrst is the way to minimize average response time.
Solution: Must use RR and X=1
* Most of students have the solution below but this is for average
Turnaround time.
0<X<=3 X,3,5,6,9.
3<X<=5 3,X,5,6,9.
5<X<=6 3
l CBC-518 Operating Systems Midterm Test 2 April 2014
‘ Instructor: Dr. Hong Name: LQul‘fﬂct MgClCan‘
l. (12 points) Given memory partitions of 100K: 500K, 200K, 300K: and 600K (in order), how
would each of the First-ﬁt, Best—ﬁt, and W'orst—ﬁt algorithm
CSC518.01 Operating Systems
Spring 2014 Dr. Sungbum Hong
Homework 2 Solution Due on Feb. 19th 2014
1. The following code spawns n — 1 concurrent processes. Each process i repeatedly
updates the elements A[i] and B[i] of two shared arrays.
int A[n] , B[n];
Operating System Comprehensive Examination Topics
1. Process Management 2 Questions
a. H/W Solutions
i.
Swap
ii.
Test & set
b. S/W Solutions
i.
Semaphores
ii.
Monitor
a) Dining Philosophers
b) R/W Problem
c) Producer/Consumer Problem
2. Memory Management
CSC 518.01 Operating Systems
Jackson State University
Dept. of Computer Science
Instructor:Dr. Sungbum Hong
E-mail: [email protected]
Phone: (601) 979-5838
Homework 1
1.
Process BATCH OS
semaphore in=out=1, card=line=0, fcard=fline=1;
process reader;
Phillip Graise
Dr. Hong
CSC 518 01
March 22, 2015
Homework #3
Chapter 3
27. Suppose that the virtual page reference stream contains repetitions of long sequences of
page references followed occasionally by a random page reference. For example, the
sequenc
Phillip Graise
November 11, 2015
Student Code: F15-7
Jackson State University, Computer Science Department
CSC 518 Operating Systems
Problem Type B
Fall 2015
1. Consider the following snapshot of the system.
P0
P1
P2
P3
P4
Allocation
0012
1000
1354
0632
0
Phillip Graise
Dr. Hong
CSC 518 01
April 27, 2015
1. (15 points): Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3,
7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement
algorithms, assuming
Phillip Graise
Dr. Hong
CSC 518 01
April 20, 2015
Homework #5
Chapter 8
16. Consider the double-torus topology of Fig. 8-16(d) but expanded to size k k . What
is the diameter of the network? (Hint: Consider odd k and even k differently.)
Answer:
On a grid
Phillip Graise
Dr. Hong
CSC 518 01
February 6, 2015
Homework #2
43. Measurements of a certain system have shown that the average process runs for a time
T before blocking on I/O. A process switch requires a time S, which is effectively wasted
(overhead).
Phillip Graise
Dr. Hong
CSC 518 01
March 26, 2015
Homework #4
Chapter 4
13. One way to use contiguous allocation of the disk and not suffer from holes is to compact
the disk every time a file is removed. Since all files are contiguous, copying a file
requ
Phillip Graise
Dr. Hong
CSC 518 01
March 2, 2015
Exam #1
1. How many processes do you need to speed the computation maximally to compute the
following equation ( a+b )( c +d ) ( e /f ) . You need to show your idea how did you find
that many number of proc
Phillip Graise
Dr. Hong
CSC 518 01
April 2, 2015
Test #2
Spring 2015
* You must type all answers and you need to show your work to get full credit.
1. What is the context switch time, associated with swapping, if a disk drive with a
transfer rate of 2 MB/