SET 3

Reg. No. :

IFET COLLEGE OF ENGINEERING

(An Autonomous Institution)
INTERNAL ASSESSMENT EXAMINATION-I
DEPARTMENT OF CSE & IT
SUB CODE: 19UCSPC402 MAX MARKS: 60
SUB NAME: OPERATING SYSTEMS DURATION: 120Min
DATE: .03.2023/FN YEAR/ SEMESTER: II/IV
TIME MANAGEMENT CHART
Part Question No.’s Time allotted
A 1-10 09:50 – 10:20 am
11 10:20 – 10:50 am
B 12 10:50 – 11:20 am
13 11.20 – 11.50 am

PART-A (10 2=20)
Answer All Questions
(Each answer should have minimum 7 lines)
1. List out the various OS Components. R CO1
2. Why is IPC needed? Name the two fundamental models of IPC. U CO1
3. Given a program on fork() system call. How many processes will be spawned after executing the A CO1
above program?
int main()
{
fork();
fork() && fork() || fork();
fork();
printf("forked\n");
return 0;
}
4. Compare tightly coupled systems with loosely coupled systems. U CO1
5. List out the data fields associated with Process Control Block. R CO1
6. What are the various scheduling criteria for CPU scheduling? R CO2
7. What is the real time scheduling? How real-time scheduling differs from normal U CO2
scheduling?
8. Mention the differences in how much the following scheduling algorithms discriminatein favor A CO2
of short processes: FCFS, RR and Multilevel feedback queues
9. Define thread. Give its advantages R CO2
10. If one thread in a program calls fork(), does the new process duplicate all threads, or is the new A CO2
process single-threaded? Justify your answer.
PART-B (Total=40 Marks)
(2  16=32&1  8=8)
Answer All Questions
(Each answer should be written for minimum 5 pages with minimum 25 lines per page)
11. A Explain the states of process with neat sketch and discuss the process state transition U (16) CO1
with a neat diagram.
(OR)
11. B Discuss how communication is done in client server systems using remote procedure S (16) CO1
call and remote method invocation.
12. A i) Implement the Multi-threading process of operating systems using java. A (16) CO2
algorithms results in the minimum average waiting time (over all processes)?
ii) Consider the set of 5 processes whose arrival time and burst time are given below-

If the CPU scheduling policy is Round Robin with time quantum = 2 unit, calculate
the average waiting time and average turn around time.
(OR)
12. B i) Explain in detail about the different Multithreading models with neat diagram. R (8) CO2
ii) What are the criteria for evaluating the performance of scheduling algorithms?
Discuss the approaches for evaluating the scheduling algorithms. U (4) CO2
iii) Write short notes on multicore programming.
R (4) CO2
13. A The read access times and the hit ratios for different caches in a memory hierarchy A (8) CO1
are as given below:
Cache Read access time(ns) Hit ratio
I-cache 2 0.8
D-cache 2 0.9
I.2-cache 8 0.9
The read access time of main memory in 90 ns. The caches use the referred-word-
first read policy and the writeback policy. All the caches are direct mapped caches.
The dirty bit is always 0 for all the blocks in the caches. In execution of a program,
60% of memory reads are for instruction fetch and 40% are for memory operand
fetch. What is the average read access time?
(OR)
13. B Discuss in details about CPU scheduling for real-time operating systems and also R (8) CO2
explain the two types of latencies affect the performance of real-time systems.
Mapping of Course Outcomes (CO) to Programme Outcomes (PO)
Course/Course Mapping with Programme outcomes
Outcomes
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12

C214.1 3 3 1 - - - - - - - - -
C214.2 3 2 - - - - - - - - - -

3- Strong Correlation, 2 – Medium Correlation, 1- Weak Correlation

-----All the Best-----

Subject handler HOD