Scribd
Upload
21 views2 pages

Os Cia 1 QP

Uploaded by

mohan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views2 pages

Os Cia 1 QP

Uploaded by

mohan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

COURSE CODE: ECS51007 COURSE NAME :- OPERATING SYSTEMS

CONTINUOUS INTERNAL ASSESSMENT - I


DEPT COMPUTER SCIENCE AND ENGINEERING SEM IV
SECTION CSE- A, B, C, D, E, F DATE 21/2/2024
MAX
DURATION 8.50 am to 10.20 am
MARKS 50
ANSWER ALL QUESTIONS
QUESTION PART-A (6 X 2 MARKS = 12 MARKS) Mark
CO BTL
NO. s
1 Write notes on kernels. CO1 1 2
2 Define a process. CO1 1 2
3 Give two examples of system programs. CO1 1 2
4 Specify any four services provided by an operating system. CO1 2 2
5 Differentiate pre-emptive and non-pre-emptive scheduling. CO2 2 2
Draw Gantt chart for the following using FCFS algorithm. CO2

6 3 2

QUESTION PART B (3 X 6 MARKS = 18 MARKS) Mark


CO BTL
NO. Answer ALL choosing either (a) or (b) of each question s
7a. Illustrate the computer system structure with a neat diagram. CO1 1 6
(OR)
7b. Explain the components of a process control block. CO1 1 6
Describe the creation and termination operations on processes with
8a. CO1 2 6
suitable examples.
(OR)
8b. Write short notes on different schedulers. CO2 2 6
Differentiate between between user-level threads and kernel-level
9a. CO2 2 6
threads? Under what circumstances is one type better than the other?
(OR)
How will you evaluate the scheduling process? Specify the various
9b. CO2 2 6
scheduling criteria to evaluate CPU scheduling process.
QUESTION PART C - (2 X10 MARKS = 20 MARKS) Mark
CO BTL
NO. Answer ALL choosing either (a) or (b) of each question s
10a. Discuss in detail about various types of system calls. CO1 2 10
(OR)
10b. Explain the process of interprocess communication in detail. CO1 2 10
11a. Consider the following set of processes, with the length of the CPU burst CO2 3 10
given in milliseconds:

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5,
all at time 0.
a. Draw four Gantt charts that illustrate the execution of these
processes using the following scheduling algorithms: FCFS, SJF,
non-pre-emptive priority (a larger priority number implies a higher
priority), and RR (quantum = 2).
b. What is the turnaround time of each process for each of the
scheduling algorithms
(OR)

a. Calculate the average turnaround time for these processes with the
11b. FCFS scheduling algorithm? CO2 3 10
b. Calculate the average turnaround time for these processes with the
pre-emptive SJF scheduling algorithm?
c. What is the waiting time of each process for each of these scheduling
algorithms?
d. Show the scheduling order of the processes using a Gantt chart.
Bloom's Verbs to be used according to the BTL

You might also like