Scribd
Upload
19 views3 pages

Unit 2 Assignement

unit 2 assignement bca sem 3

Uploaded by

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

Unit 2 Assignement

unit 2 assignement bca sem 3

Uploaded by

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

L.J.

College of Computer Applications


Academic Year 2024-25

Subject: Operating System Concepts (DSC-C-BCA-231T)


Assignment 2: Unit II

Chapter 4 : Processor Management


1. What is a multiprogramming system?
2. Define the terms: Program, Process.
3. Give an example to explain the difference between a Job and a Process.
4. Explain the role of a job scheduler and process scheduler.
5. What do you understand by high level, low level and middle level scheduler?
6. Differentiate between CPU bound and I/O bound jobs.
7. What are the five states process can be in(Process Status)? Show how process
changes states?
8. Which are the various states of transitions and what is the role of the job scheduler
and process scheduler during these transitions?
9. What is a Process Control Block(PCB)? What information about a job needs to be in a
PCB?
10. Define the terms: Throughput, Turnaround time, Burst time (CPU time), Response
time
11. What is the relation between turnaround time, CPU cycle time and waiting time?
12. Explain the following transitions:
a. HOLDREADY
b. HOLDREADYRUNNING
c. HOLDREADYRUNNINGWAIT
d. HOLDREADYRUNNINGREADY
e. RUNNING -- READY
f. RUNNING -WAIT
g. RUNNING READYRUNNING
h. RUNNING WAITREADY
i. READYRUNNING WAITREADY
j. READYRUNNING FINISHED
k. RUNNING WAITREADYRUNNING
l. WAITREADY
m. WAITREADYRUNNING
n. WAITREADYRUNNINGREADY

13. Discuss the various criteria for a good process scheduling policy.
14. Discuss the concept of SJN and SRT scheduling policies.
15. Explain the concept of priority scheduling.
16. Explain the Round Robin scheduling policy.

17. What is a ‘natural wait’?


18. Differentiate between preemptive and non-preemptive scheduling policies. Give
examples of each.
19. Explain the terms: time slice, time quantum and context switching.
20. Do all the questions given to you in class based on FCFS, SJN, SRT, Round Robin
algorithm.

Do as directed:
1. Give another name for processor.
2. When there are many users with many jobs on the system the environment is
known as ______________________.
3. A _____________ is an inactive unit of work.
4. A ____________ is job under execution.
5. The processor manager is divided into two parts. They are __________________
& _______________________.
6. ________________ jobs have small CPU cycles and long I/O cycles.
7. ________________ jobs have small I/O cycles and long CPU cycles.
8. A job under execution gives rise to several ____________.
9. Give the five states through which a job moves___________________________.
10. The job is in a ____________state when it enters the system.
11. A job always goes form a Ready state to a _______________ state.
12. From the Hold state the job goes to a __________ state.
13. When a job is being processed it goes to a _________________ state.
14. A job in the ready state is waiting for the ____________.
15. When a job needs a resource or an I/O operation it goes to the ____________ state.
16. When the CPU is taken away forcibly from a job running on the CPU it goes from a
________ state to a ________ state.
17. The transition from the HOLD to READY is taken care by the ___________ scheduler.
18. Every process in the system is represented by a data structure called the
_______________________.
19. The transition from the RUNNING to WAIT is taken care by the _________ scheduler.
20. The number of jobs getting executed in a given amount of time is called the
_____________.
21. _________________ is the time taken by a job to finish its execution.
22. The time a job waits for the CPU is termed as the _______________ time
23. The scheduling policy where the CPU can be taken away from a process in-betweeen
the execution is called as
____________________________.
24. SJN is an example of a __________________scheduling algorithm.
25. Priority scheduling is an example of a ___________________scheduling algorithm.
26. The process of increasing the priority of the process so as to get them executed is
called _________________.
27. When a job never gets the CPU it goes into a situation of __________________.
28. The time required by the OS to switch from one job to another is called
_______________________ time.
29. Round Robin is an example of a _______________ scheduling policy
30. The CPU time allocated to a job in Round Robin scheduling is called
_____________________.

You might also like