Scribd
Upload
10 views

Question Bank - Module 1

Question bank

Uploaded by

darshanbs236
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Question Bank - Module 1

Question bank

Uploaded by

darshanbs236
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Operating Systems (BCS303)

Question Bank
Module 1
2 Marks:

1. What is an Operating system? [L1]


2. Define process? [L1]
3. Define schedulers? [L1]
4. Define thread. [L1]
5. Define Kernel? [L1]
6. What are the advantages and disadvantages of User level threads? [L1]
7. What are the advantages and disadvantages of Kernel level threads? [L1]
8. List the functions provided of an Operating System? [L1]
9. Define system calls. [L1]
10. What is convey effect. [L1]
11. Define Context switching. [L1]

8-10 Marks:

1. What is an Operating System and explain its functions. [L2, 8M]


2. List the system call for process management and explain each of them with suitable
example. [L2, 10M]
3. Explain the various process states in an operating system and illustrate them with a
clear and labelled diagram.
[L3, 8M]
4. What are the key differences between processes and threads in an operating system?
[L2, 8M]
5. Compare and contrast user-level threads and kernel-level threads, and explain how
they relate to multithreading models in modern operating systems.
[L4,10M]
6. Consider 3 processes P1, P2 and P3, which require 5, 7 and 4 time units and arrive
at time 0, 1 and 3. Draw the Gant chart and calculate process completion sequence,
average waiting time, average turnaround time and average response time for.
(i) Round robin scheduling with CPU quantum of 2 time units.
(ii) FCFS. [L4,10M]

7. Evaluate SJF CPU Scheduling algorithm for given Problem [L5,10M]

Process P1 P2 P3 P4
Process/Burst Time 8 4 9 5
Arrival Time 0 1 2 3
8. Evaluate Round CPU Scheduling algorithm for given Problem Time slice =3 ms.
[L5,10M]

Process P1 P2 P3 P4
Process/Burst Time 10 5 18 6
Arrival Time 5 3 0 4

9. An operating system uses shortest remaining time next scheduling algorithm for
pre-emptive scheduling of processes. Consider the following set of processes with
their arrival times and CPU burst times (in milliseconds). Draw the Gant chart and
calculate average waiting time, average turnaround time and average response time.
[L5,10M]

Process P1 P2 P3 P4
Process/Burst Time 12 4 6 5
Arrival Time 0 2 3 8

10. Evaluate Priority scheduling algorithm for non-pre-emptive scheduling of


processes. Consider the following set of processes with their arrival times and CPU
burst times (in milliseconds). Draw the Gant chart and calculate average waiting
time, average turnaround time and average response time. (Note: A Higher number
has the highest priority)
[L5,10M]

Process P1 P2 P3 P4 P5 P6
Process/Burst Time 4 2 3 1 2 6
Arrival Time 0 1 2 3 4 5
Priority 4 5 6 10 9 7

11. Evaluate Priority scheduling algorithm for pre-emptive scheduling of processes.


Consider the following set of processes with their arrival times and CPU burst times
(in milliseconds). Draw the Gant chart and calculate average waiting time, average
turnaround time and average response time. (Note: Lesser the number has the
highest priority) [L5,10M]

Process P1 P2 P3 P4 P5 P6 P7
Process/Burst 4 2 3 5 1 4 6
Time
Arrival Time 0 1 2 3 4 5 6
Priority 2 4 6 10 8 12 9

You might also like