CS Notes 2 School
CS Notes 2 School
Active
Halted
New
Waiting
ii) Non Preemptive Scheduling: In this method, a scheduled job always completes
before another scheduling is made. There are three ways
a. FIFO (First In First Out) b. Shortest Job Next (SJN) c. Dead Line Scheduling INDIAN
INST
a. FIFO (First In First Out) : This algorithm is based on queuing. The process (A process
is basically a program in execution) that enters the queue first is executed first by the
CPU, then the next and then the next and so on.
b. Shortest Job Next (SJN): This algorithm is based on the size of the job.
E.g:Take two jobs A and B. A=5 kilo bytes B=8 kilo bytes First the job SCIENCE
Awill OFE
be assigned processor time after which B gets its turn.
c. Dead Line Scheduling : In this, Earliest deadline first (EDF) or least time to go is a
dynamic scheduling algorithm used in real-time operating systems to place processes in
a priority queue. Whenever a scheduling event occurs (task finishes, new task released,
etc.) the queue willbe searched for the process closest to its deadline.
iii) Preemptive Scheduling : In this method, a scheduled job is taken even another
scheduling is going on. There are two ways a. Round Robin b. Response Ratio schedule.
Round Robin : Jobs are assigned processor time in a circular method.
For example take three jobs A, B, C. First the job A is assigned to CPU then job B
and after Bjob C and then again A,B and C and so on.
Response Ratio: In this method, the job with highest response ratio is preferred over
others. The Response Ratio is caleulated as follows
Response Ratio = Elapsed Time
Execution time received
Memory Management :(Storage Management)
An cperating system keeps track of the memoy and identifies the
portion of memory that is curently used and also identifies the
user who is using it
" The file system of the operating system keeps track of the
information, its location, use status et.
" It also decides on which user should get the resources first and
enforces protection requirements and also provides accessing
routines.
5. Solaris: It is a free Unix based operating system introduced by Sun Microsystems in 1992. It
is now also known as Oracle Solaris.
Mobile Operating Systems (Mobile OS) :It is the operating system that operates on digital
mobile devices like smart phones and tablets. It extends the features of a normal operating
system for personal computers so as to include touch screen, Bluetooth, WiFi, GPS mobile
navigation, camera, music player etc.
The most commonly used mobile operating systems are- Android and
Symbian
Android:
OS is also classified as
of more than one tasks or
1. Time sharing Operating System: It allows execution divided amongst different
processes concurrently. For this, the processor time is processor switches
tasks. This division of time is also called time sharing. The
stipulated time is over, the CPU shifts to
rapidly between various processes. After the
next task in waiting,
Ex: Windows 95 and all later versions of Windows.
reai
2. Real Time Operating System: It is a multitasking operating system designed torto be
tasks have
time applications like robotics. In this type of operating system, the
done within a fixed deadline. System performance is good if task is finished within
this deadline. If it is not done, the situation is called Deadline Overrun..
4. Interactive Operating System: This is the operating system that provides a Graphic
User Interface (GUI) through which the user can easily navigate and interact.
Compression Utility: This utility is used to compress large files. Compression is useful because
ithelps reduce resources usage and the file transmission on the network becomes easier.
sackup es
sht
soCleaner
before as be
occupying
to
create :This
deleting
more hugeutility
them.space
amountscans
on for
the of
memory file
disk.
that
If have
tspace.
he
files not
This been
are
utility
important,
accessed/used
prompts
the
user thesince
might user long.
to
takedelete Such
asuch files