Scribd
Upload
3 views

Assignment-1

The document outlines an assignment for a BCA course on Operating Systems, detailing various questions related to OS concepts, scheduling algorithms, and deadlock conditions. It includes tasks such as explaining OS services, process scheduling, and analyzing process execution through Gantt charts. Additionally, it covers the Banker's algorithm for resource allocation and safety checks in a system.

Uploaded by

Rahul Dhakar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Assignment-1

The document outlines an assignment for a BCA course on Operating Systems, detailing various questions related to OS concepts, scheduling algorithms, and deadlock conditions. It includes tasks such as explaining OS services, process scheduling, and analyzing process execution through Gantt charts. Additionally, it covers the Banker's algorithm for resource allocation and safety checks in a system.

Uploaded by

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

Operating System (BCA-202)

Assignment-1
S.no Questions CO Blooms
Address Level
1 What is operating System? Why it is required for the CO1 BL1
system. Explain the services of Operating System.
2 Explain the time sharing and Distributed System CO1 BL1
also mention the application area of this system
3 Why process scheduling required. Explains long CO2 BL2
term and short term scheduler.
4 What do you mean by Process Control Block and CO1 BL1
why it required for operating system
5 Write detail note on CO1 BL1
(a) Starvation & Aging
(b) Architecture of Operating System
(c) Process State
(d) System Calls
(e) Multilevel Queuing System
6 Describe difference between symmetric and CO2 BL2
asymmetric multiprocessing. What are the
advantages and disadvantages of multiprocessing
systems?
7 Suppose that processesP1, P2,..., P5 arrive for CO2 BL4
execution. Each process will run for the amount
of time listed, and will be assigned a priority
ranging from0 (highest) to10 (lowest). No more
processes will arrive until the last process
completes.

Process Id Arrival Burst Priority


time time
P1 0 8 10
P2 0.4 4 2
P3 0.5 1 10
P4 0.8 2 1
P5 1 2 5
Draw four Gantt charts that illustrate the
execution of these processes using the following
scheduling algorithms: FCFS pre-emptive SJF
Non-Pre-emptive SJF pre-emptive priority (SJF if
priority is equal)

1) What is the turnaround time of each process


for each of these four scheduling algorithms?
2) What is the waiting time of each process for
each of these four scheduling algorithms?
3) Which of the algorithms results in the
maximum overall turnaround time (over all
processes)?
8 Consider the following set of process with the length CO2 BL4
of CPU burst time in millisecond:

Process Burst Time Arrival Time


P1 8 0
P2 11 1
P3 14 6
P4 7 12

Consider round robin scheduling method with time


quantum 5 unit. Draw the Gnatt chart and
calculate the Average turnaround time Average
waiting time

9 Define Deadlock in processes. What are the CO1 BL1


necessary condition for dead lock? How dead lock
can be prevented?
10 Consider the following snapshot of the System CO2 BL4

Allocation Max Available


A B C D A B C D A B C D
Po 0 0 1 2 0 0 1 2 1 5 2
P1 1 0 0 0 1 7 5 0 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answare the following question using the Bankers
Algorithms
(i) What is the contents of Matrix need?
(ii) If the System in safe sate?
(iii) If a request from P1 arrives for (0,4,2,0)
can the request be granted immediately?

You might also like