Q7-1:

No Application software Operating System

1 A computer program which A system computer
is intended to perform some program that manages
task classified along. hardware and software
resources and provides
common services for
computer programs.
2 Application software is Operating system comes
downloaded from internet. installed on the device
purchased.
3 It is developed by using It is developed by using
virtual basic, c++, c, java. c++, c, assembly
languages.
4 It is usually in While it is usually is
Megabytes(MB). Gigabytes(GB).
5 It is built to perform some It works as interface
specific tasks. between user and
hardware and perform
some variety of tasks like
memory management,
scheduling, process
management etc.
6 It always depends upon But it does not depend
operating system. upon application
software.it provides the
path to execute or to run
the application software.
7 It runs when the user desires it boots up when the user
to run the application. wants and run until the
user switches off the
machine.
8 It’s examples are Photoshop, It’s examples are
VLC player etc. Microsoft Windows,
Linux, Unix, DOS.
Q7-2.
 File Management.
 Process Management.
 I/O Device Management.
 Main Memory management.
Q7-3
Monoprogramming is when the memory can only process one
program at a time were multiprogramming is when the memory
can process more than one program
Q7-4
In partitioning, memory is divided into variable-length sections,
each of which holds one complete program. In paging, memory
is divided into much smaller fixed-length sections as is the
program itself.
Q7-5
In regular paging the entire program must be in memory at the
same time inorder for the program to execute. With demand
paging, only some pages of aprogram can be in memory. This
means that, in demand paging, more programscan use the
computer's resources at any given time
Q7-6
The program is a job in all of these situations. When a job has
finished executing (either normally or abnormally), it becomes a
program and once again resides on the disk. The operating
system no longer governs the program. A process is a program
in execution. It is a program that has started but has not finished.
In other words, a process is a job that is being run in memory. It
has been selected among other waiting jobs and loaded into
memory. A process may be executing or it may be waiting for
CPU time. As long as the job is in memory, it is a process.
Q7-7
Whenever you save your program into a file (any kind of file,
say ‘add.c’), it automatically gets stored in the secondary
storage i.e. the harddiskMany modern OSes also have the
capability of scheduling actions (jobs) periodically or at specific
times. The list of these jobs is kept in the file system (mass
storage) and in RAM (whereit is periodically refreshed from the
file system when changes are noticed.).When a process is
selected by a Long Term Scheduler, the process enters into
Ready queue (Ready State from New State) and all the
processes in ready queue are present in main memory.
Q7-8
The job scheduler moves a job from the hold state to the ready
state or from the running state to the terminated state. In
otherwords, a job scheduler is responsible for creating a process
from a job and terminating a process.The process scheduler
moves a process from one state to another. It moves a process
from the running state to the waiting state when the process is
waiting for some event to happen. It moves the process from the
waiting state to the ready state when the event has occurred. It
moves a process from the running state to the ready state if the
process’ time allotment has expired. When the CPU is ready to
run the process, the process scheduler moves the process from
the ready state to the running state.
Q7-9
Because in operating systems, processes are loaded into
memory, and wait for their turn to be executed by the central
processing unit (CPU). CPU scheduling manages process states
and decides when a process will be executed next by using the
input queue.
Q7-10
Deadlock Starvation
1 All processes keep waiting High priority processes keep
for each other to complete executing and low priority
and none get executed processes are blocked
2 Resources are blocked by Resources are continuously
the processes utilized by high priority
processes
3 Necessary conditions Priorities are assigned to the
Mutual Exclusion, Hold and processes
Wait, No preemption,
Circular Wait
4 Also known as Circular wait Also know as lived lock
5 It can be prevented by It can be prevented by Aging
 avoiding the necessary
conditions for deadlock

P6-10
a. 01101110 00001011 00000101 01011000
b. 00001100 01001010 00010000 00010010
c. 11001001 00011000 00101100 00100000
P6-11
a. 94.176.117.21
b. 137.142.208.49
c. 87.132.55.15
P6-12
5A.11.55.18.AA.0F