Important Instructions To Examiners:: Q. No - Sub Q. N. Answer Marking Scheme 1. A Ans

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
(Autonomous)
(ISO/IEC - 27001 - 2013 Certified)
WINTER – 2019 EXAMINATION Subject Name:

Operating System Model Answer Subject Code: 22516
Important Instructions to examiners:
1) The answers should be examined by key words and not as word-to-word as given in the
model answer scheme.
2) The model answer and the answer written by candidate may vary but the examiner may try
to assess the understanding level of the candidate.
3) The language errors such as grammatical, spelling errors should not be given more
Importance (Not applicable for subject English and Communication Skills.
Q. Sub Answer Marking
No Q. Scheme
. N.
1. Attempt any Five of the following: 10 M

a Define real time operating system. List its any four applications of it. 2M
Ans Real time Operating System: 1 Mark :-

A real time system has well defined fixed time constraints. Processing Definition;
should be done within the defined constraints -Hard and Soft real time 1 Mark :-
system. for any 4
OR correct
The real-time operating system used for a real-time application means application
for those applications where data processing should be done in the fixed s
and small quantum of time.
Types of real time operating system

1. Hard real-time
2. Soft real-time
Applications:
1. Flight Control System
2. Simulations
3. Industrial control
4. Military applications
4) While assessing figures, examiner may give credit for principal components indicated in the
figure. The figures drawn by candidate and model answer may vary. The examiner may
give credit for any equivalent figure drawn.
5) Credits may be given step wise for numerical problems. In some cases, the assumed
constant values may vary and there may be some difference in the candidate’s answers and
model answer.
6) In case of some questions credit may be given by judgement on part of examiner of relevant
answer based on candidate’s understanding.
1 | 37
(Autonomous)
7) For programming language papers, credit may be given to any other program based on
equivalent concept.
2 | 37
(Autonomous)
b Explain any 4 services provided by OS. 2M

Ans 1.User Interface: All operating systems have a user interface that 1 marks for
allows users to communicate with the system. Three types of user explaining
interfaces are available: any 4
a. Command line interface (CLI) services
b. Batch interface
c. Graphical user interface (GUI)
2. Program execution: The operating system provides an

environment where the user can conveniently run programs. It
also performs other important tasks like allocation and
deallocation of memory, CPU scheduling etc. It also provides
service to end process execution either normally or abnormally
by indicating error.
3. I/O operations: When a program is running, it may

require input/output resources such as a file or devices such as
printer. So the operating system provides a service to do I/O.
4.File system manipulation: Programs may need to read and write data
from and to the files and directories. Operating system manages the
secondary storage. Operating system makes it easier for user programs
to accomplish their task such as opening a file, saving a file and deleting
a file from the storage disk.
5.Communication: In the system, one process may need to exchange

information with another process. Communication can be implemented
via shared memory or through message passing, in which packets of
information are moved between processes by the operating system.
6.Error detection: Operating systems detects CPU and memory

hardware such as a memory error or power failure, a connection failure
on a network or lack of paper in the printer etc.
7.Resource allocation: Operating system manages resource allocation

to the processes. These resources are CPU, main memory, file storage
and I/O devices.
8.Accounting: Operating system keeps track of usages of various

computer resources allocated to users.
9.Protection & security: When several separate processes execute
3 | 37
(Autonomous)
concurrently, one process should not interfere with the other processes
or operating system itself. Protection provides controlled access to
system resources. Security is provided by user authentication such as
password for accessing information.
c Draw process state diagram. 2M

Ans 2 Marks:-
for correct
well
labelled
diagram (1
mark:-
specifying
correct
states in
the
diagram)
process state diagram
d Explain any four scheduling criteria. 2M
4 | 37
(Autonomous)
Ans 1. CPU utilization: In multiprogramming the main objective is to keep Any four
CPU as busy as possible. CPU utilization can range from 0 to 100 scheduling
percent. criteria: 1/2
mark each
2.Throughput: It is the number of processes that are completed per unit
time. It is a measure of work done in the system. When CPU is busy in
executing processes, then work is being done in the system. Throughput
depends on the execution time required for any process. For long
processes, throughput can be one process per unit time whereas for short
processes it may be 10 processes per unit time.
3. Turnaround time: The time interval from the time of submission of

a process to the time of completion of that process is called as
turnaround time. It is the sum of time period spent waiting to get into
the memory, waiting in the ready queue, executing with the CPU, and
doing I/O operations.
4.Waiting time: It is the sum of time periods spent in the ready queue
by a process. When a process is selected from job pool, it is loaded into
the main memory (ready queue). A process waits in ready queue till
CPU is allocated to it. Once the CPU is allocated to the process, it starts
its execution and if required request for resources. When the resources
are not available that process goes into waiting state and when I/O
request completes, it goes back to ready queue. In ready queue again it
waits for CPU allocation.
5.Response time: The time period from the submission of a request

until the first response is produced is called as response time. It is the
time when system responds to the process request not the completion of
a process. In the system, a process can Produce some output fairly early
and can continue computing new results while previous results are being
output to the user.
e Define virtual memory 2M
Ans Virtual memory is a memory management capability of an operating 2 marks for
system (OS) that uses hardware and software to allow a computer to any
compensate for physical memory shortages by temporarily transferring relevant
data from random access memory (RAM) to disk storage. definition
OR
Virtual memory is the separation of user logical memory from physical
memory. This separation allows an extremely large virtual memory to
be provided for programmers when only a smaller physical memory is
available. Virtual memory makes the task of programming much easier,
5 | 37
(Autonomous)
because the programmer no longer needs to worry about the amount of

physical memory available, or about what code can be placed in
overlays, but can concentrate instead on the problem to be programmed.
f Write syntax for following commands: i)Sleep ii)Kill 2M
Ans i)sleep Syntax: 1 mark
sleep NUMBER[SUFFIX]… each for
sleep OPTION correct
syntax
ii) kill
Syntax: kill pid
g Describe any four file attributes 2M
Ans File attributes: Any four
• Name: The symbolic file name is the only information kept in attributes:
human readable form. ½ mark
• Identifier: File system gives a unique tag or number that each
identifies file within file system and which is used to refer files
internally.
• Type: This information is needed for those systems that support
different types.
• Location: This information is a pointer to a device and to the
location of the file on that device.
• Size: The current size of the file (in bytes, words or blocks) and
possibly the maximum allowed size are included in this attribute.
• Protection: Access control information determines that who can
do reading, writing, executing and so on.
• Time, Date and User Identification: This information may be
kept for creation, Last modification and last use. These data can
be useful for protection, security and usage monitoring.
2. Attempt any Three of the following: 12M

a Enlist types of operating system. Explain multiprogramming OS in 4M
detail.
6 | 37
(Autonomous)
Ans Types of operating system 1 Mark:-

1.Batch Systems Listing; 1
2.Multiprogramming Mark:-
3.Multitasking Diagram
4.Time-Sharing Systems 2 Marks:
5.Desktop Systems -
6.Distributed system Explanatio n
7.Clustered system
8.Real Time system:
Multiprogramming:
• In multiprogramming, more than one program lies in the
memory.
• The scheduler selects the jobs to be placed in ready queue from a
number of programs.
• The ready queue is placed in memory and the existence of more
than one program in main memory is
known as multiprogramming.
• Since there is only one processor, there multiple programs cannot
be executed at a time.
• Instead the operating system executes part of one program, then
the part of another and so on.
• Example of multiprogramming: user can open word, excel,
access and other applications in a system.
b List components of OS. Explain process management in detail. 4M

Ans List of System Components: 1 Mark:-
1. Process management Listing;
2. Main memory management 3 Marks:-
3. File management Explanation
4. I/O system management
5. Secondary storage management
7 | 37
(Autonomous)
Process Management: The operating system manages many kinds of

activities ranging from user programs to system programs like printer
spooler, name servers, file server etc.
Each of these activities is encapsulated in a process.
• A process includes the complete execution context (code, data,
PC, registers, OS resources in use etc.).
• The basic unit of software that the operating system deals with in
scheduling the work done by the processor is either a process or
a thread, depending on the operating system.
• It’s tempting to think of a process as an application, but that
gives an incomplete picture of how processes relate to the
operating system and hardware.
• The application you see (word processor or spreadsheet or game)
is, indeed, a process, but that application may cause several other
processes to begin, for tasks like communications with other
devices or other computers.
• There are also numerous processes that run without giving you
direct evidence that they ever exist. A process, then, is software
that performs some action and can be controlled by a user, by
other applications or by the operating system.
• It is processes, rather than applications, that the operating system
controls and schedules for execution by the CPU. In a
singletasking system, the schedule is straightforward.
• The operating system allows the application to begin running,
suspending the execution only long enough to deal with
interrupts and user input.
• The five major activities of an operating system in regard to
process management are
1. Creation and deletion of user and system processes.
2. Suspension and resumption of processes.
3. A mechanism for process synchronization.
4. A mechanism for process communication.
5. A mechanism for deadlock handling.
c With neat diagram explain inter process communication model. 4M
8 | 37
(Autonomous)
Ans Inter-process communication: Cooperating processes require an Inter- Define inter

process communication (IPC) mechanism that will allow them to process
exchange data and information. communica
There are two models of IPC tion -1
1. Shared memory mark;
diagram of
model - 1
mark;
explanation
 - 2 marks
• attach to the addres
• These processes are

system.

as routine memory access

9 | 37
(Autonomous)
In this, all processes who want to communicate with other

processes can access a region of the memory residing in an address
space of a process creating a shared memory segment.
All the processes using the shared memory segment should s space
of the shared memory. All the
processes can exchange information by reading and/or writing data
in shared memory segment.
The form of data and location are determined by these processes
who want to communicate with each other. not under the control
of the operating
The processes are also responsible for ensuring that they are not
2. Message
writing to the same location simultaneously.
PassingAfter establishing shared memory segment, all accesses to the
shared memory segment are treated and without assistance of


In this model, communication takes place by exchanging messages
between cooperating processes.
 It allows processes to communicate and synchronize their action
without sharing the same address space.
connected by a
It is particularly useful in a distributed environment when
network.
communication process may reside on a different computer
 Communica
through the
tion requires sending and receiving messages
kernel.
 The processes that want to communicate with each other must
10 |
37
(Autonomous)
have a communication
link between them. Between each pair of processes exactly one
communication link.
d Describe I/O Burst and CPU Burst cycle with neat diagram. 4M
Ans CPU burst cycle: It is a time period when process is busy with CPU. Explanatio
I/O burst cycle: It is a time period when process is busy in working n: 2 marks,
with I/O resources. Diagram:2
marks
• A process execution consists of a cycle of CPU execution and I/O
wait.
• A process starts its execution when CPU is assigned to it, so
process execution begins with a CPU burst cycle.
• This is followed by an I/O burst cycle when a process is busy
doing I/O operations.
• A process switch frequently from CPU burst cycle to I/O burst
cycle and vice versa.
• The complete execution of a process starts with CPU burst cycle,
followed by I/O burst cycle, then followed by another CPU burst
cycle, then followed by another I/O burst cycle and so on.
• The final CPU burst cycle ends with a system request to
terminate execution.
11 |
37
(Autonomous)
3. Attempt any Three of the following: 12M

a Explain ‘PS’ command with any four options. 4M
12 |
37
(Autonomous)
Ans ps command: It is used to display the characteristics of a process. This four options-
command when execute without options, it lists the processes associated 1M each
with a user at a particular terminal.
Syntax: $ ps [options]
Example: $ ps output:
Each line in the output shows PID, the terminal with which the process is
associated, the cumulative processor time that has been consumed since
the process has been started and the process name.
Options:
-f : It is used to display full listing of attributes of a process. It includes
UID (user ID),PPID(Parent ID),C(amount of CPU time consumed by the
process) and STIME(chronological time that has elapsed since the
process started). Example: $ ps -f
-u: Shows the activities of any specified user at any time.

Example: $ ps -u abc
13 |
37
(Autonomous)
-a: It shows the processes of all users.

Example: $ ps -a
-e: It displays processes including user and system processes.

example: $ ps -e
b Explain deadlock? What are necessary conditions for deadlock? 4M

Ans In multiprogramming environment, several processes may compete for a finite Deadlock
number of resources. A process requests resources and if the resources are not description2M,
available then the process enters into the waiting state. Sometimes a waiting necessary
process is never again able to change its status because the resources requested
conditions 1/2
by it are held by other waiting processes. This situation is called as deadlock.
When a process request for resources held by another waiting process which in M each
turn is waiting for resources held by another waiting process and not a single
process can execute its task, then deadlock occurs in the system.
Example: Consider a system with three disk drives and three processes. When
each process request one disk drive, system allocates one disk drive to each
process. Now there is no more drive available in the system. If all three
processes request for one more disk drive, then all three processes will go into
the waiting state and system will go in deadlock state. Because any one
process from the three can execute only when one of them will release the disk
drive allocated to it.
Necessary Conditions:
1. Mutual exclusion: At least one resource must be held in
a nonsharable mode; that is, only one process at a time can use
14 | 37
(Autonomous)
the resource.
2. Hold and Wait: A process must be holding at least one
resource and waiting to acquire additional resources that are
currently being held by
other processes.
3. No pre-emption: Resources cannot be pre-empted i.e a

resource can be released only voluntarily by the process holding
it.
4. Circular wait: A set {P0,P1…Pn} of waiting processes

must exist such that P0 is waiting for a resource held by P 1,P1 is
waiting for a resource held by P2,…,Pn-1 is waiting for a resource
held by Pn and Pn is waiting for a resource held by P 0. Each
process is waiting for the resources held by other waiting
processes in circular form.
c Explain partitioning and its types. 4M
15 | 37
(Autonomous)
Ans An important operation of memory management is to bring programs Explanation

into main memory for execution by the processor. Partitioning is a of fixed
technique that divides a memory into multiple partitions. These partitioning -
partitions can be of different size or same size. 2M,
Types of partitioning Variable
• Fixed partitioning i.e. static partitioning partitioning-
• Variable partitioning i.e. dynamic partitioning 2M
Fixed Partitioning: Main memory is divided into multiple partitions of

fixed size at the time of system generation. A process may be loaded
into a partition of equal size or greater size. Partitions can be of equal
size or unequal size.
Equal size partitioning: Main memory is
divided into equal size partitions. Any process
with less or equal size can be loaded in any
available partition.
OR
Unequal size partitioning: Main memory is

divided into multiple partitions of unequal
size. Each process can be loaded into the
smallest partition within which the process
will fit.
Variable partitioning: When a process enters in main memory, it is

allocated exact size that is required by that process. So in this method,
partitions can vary in size depending on memory space required by a
process entering in main memory. Operating system maintains a table
indicating which parts of memory are available and which are occupied.
When new process arrives and it needs space, system searches for
16 | 37
(Autonomous)
available memory space in main memory. If it is available, then memory

is allocated to the process by creating a partition in memory.
For example: Consider following table with process and memory space.
Process Memory space
P1 20 M
P2 14 M
P3 18 M
d Describe sequential and direct access method. 4M

Ans Sequential access: Information from the file is processed in order i.e. description
one record after another. It is commonly used access mode. For of sequential
example, editors and compilers access files in sequence. access-2M,
A read operation read information from the file in a sequence i.e. read Direct
next reads the next portion of the file and automatically advances a file access-2M
pointer.
A write operation writes information into the file in a sequence i.e. write
next appends to the end of the file and advances to the end of the newly
written material. Such a file can be reset to the beginning.
In some operating systems, a program may be able to skip forward or
backward n records for some integer n.
As shown in above diagram, a file can be rewind (moved in backward
dir
ection) from the current position to start with beginning of the file or it
can be read or write in forward direction.
Direct access: It is also called as relative access. A file is made up of

fixed length logical records that allow programs to read and write
records rapidly in no particular order. Direct access method is based on
disk model of a file which allows random access to any file block. For
direct access a file is viewed as a numbered sequence of blocks or
records. So we can directly read block 14, then block 53 and so on. This
17 | 37
(Autonomous)
method is used for immediate access to large amount of information.

Database can be accessed with direct access method. For example, when
a query concerning a particular subject arrives, we compute which block

contains the answer and then read that block directly to provide the
desired information.
Read n operation is used to read the nth block from the file whereas
write n is used to write in that block. The block numbers provided by the
user to the operating system is a relative block number. A relative block
number is an index relative to the beginning of the file. The first relative
block of file is 0; the next is 1 and so on. Actual absolute disk address of
the block is different from the relative address. The use of relative block
numbers allow the operating system to decide where the file should be
placed and helps t prevent the user from accessing portions of the file
system that may not be part of his file.
4 Attempt any Three of the following: 12M

a Write Unix command for following: 4M
i)create a folder OSY ii) create a file FIRST in OSY
folder iii) List/display all files and directories. iv) Write
command to clear the screen
Ans i) create a folder OSY: Each correct
$mkdir OSY command1M
ii)create a file FIRST in OSY folder:

$cd OSY
$cat>FIRST or $ touch FIRST
iii) List/display all files and directories:

$ls
iv) to clear screen:

$clear
b What is purpose of system call? State two system calls with their 4M
functions.
18 | 37
(Autonomous)
Ans System call provides an interface between a running program and purpose of
operating system. It allows user to access services provided by system call-
operating system. This system calls are procedures written using C, C+ 2M, Two
+ and assembly language instructions. Each operating system has its system calls-
own name for each system call. Each system call is associated with a 1M each
number that identifies itself.
System calls:
Process Control: Program in execution is a process. A process to be
executed must be loaded in main memory. while executing it may need
to wait, terminate or create & terminate child processes.
• end, abort
• load, execute
• create process, terminate process
19 | 37
(Autonomous)
• get process attributes, set process attributes

• wait for time
• wait event, signal event
• allocate and free memory
File Management: System allows us to create and delete files. For

create and delete operation system call requires the name of the file and
other attributes of the file. File attributes include file type, file size,
protection codes, accounting information and so on. Systems access
these attributes for performing operations on file and directories. Once
the file is created, we can open it and use it. System also allows
performing reading, writing or repositioning operations on file.
• create file, delete file
• open, close
• read, write, reposition
• get file attributes, set device attributes
• logically attach or detach devices
3. Device Management: When a process is in running

state, it requires several resources to execute. These resources
include main memory, disk drives, files and so on. If the
resource is available, it is assigned to the process. Once the
resource is allocated to the process, process can read, write and
reposition the device.
• request device, release device
• read, write, reposition
• get device attributes, set device attributes
• logically attach or detach devices
4. Information Maintenance: Transferring information

between the user program and the operating system requires
system call. System information includes displaying current
date and time, the number of current user, the version number
of the operating system, the amount of free memory or disk
space and so on. Operating system keeps information about all
its processes that can be accessed with system calls such as get
process attributes and set process attributes.
• get time or date, set time or date
• get system data, set system data
• get process, file, or devices attributes
• set process, file, or devices attributes
20 | 37
(Autonomous)
5. Communication: Processes in the system,

communicate with each other. Communication is done by using
two models: message passing and shared memory. For
transferring messages, sender process connects itself to
receiving process by specifying receiving process
name or identity. Once the communication is over system close the

connection between communicating processes.
• create, delete communication connection
• send, receive messages
• transfer status information
• attach or detach remote devices.
c State and describe types of scheduler. 4M
Ans There are three types of scheduler: list-1M,
• Long term scheduler description
• Short term scheduler of each-1
• Medium term scheduler
1. Long term scheduler: It selects programs from job

pool and loads them into the main memory. It controls the
degree of multiprogramming. The degree of multiprogramming
is the number of processes loaded (existing) into the main
memory. System contains I/O bound processes and CPU bound
processes. An I/O bound process spends more time for doing
I/O operations whereas CPU bound process spends more time
in doing computations with the CPU. So It is the responsibility
of long term scheduler to balance the system by loading some
I/O bound and some CPU bound processed into the main
memory. Long term scheduler executes only when a process
leaves the system, so it executes less frequently. When long
term scheduler selects a process from job pool, the state of
process changes from new to ready state.
2. Short term scheduler: It is also known as CPU

scheduler. This scheduler selects processes that are ready for
execution from the ready queue and allocates the CPU to
the selected process. Frequency of execution of short term
scheduler is more than other schedulers. When short term
scheduler selects a process, the state of process changes from
ready to running state.
3.Medium term scheduler: When a process is in running state, due to

some interrupt it is blocked. System swaps out blocked process and
21 | 37
(Autonomous)
store it into a blocked and swapped out process queue. When space is
available in the main memory, the operating system looks at the list of
swapped out but ready processes. The medium term scheduler selects
one process from that list and loads it into the ready queue. The job of
medium term scheduler is to select a process from swapped out
process queue and to load it into the main memory. This scheduler
works in close communication with long term scheduler for loading
process into the main memory.
d Explain Round Robin algorithm with suitable example. 4M
Ans It is preemptive scheduling algorithm. A small unit of time known as a explanation

time quantum or time slice is used for pre-emption of a currently of round
running process. Ready queue is implemented as a circular queue. CPU robin -2M,
is assigned to the entire processes one by one, on first come first serve example-2M
basis, for a specific time period. Every process executes for specified
time period and CPU is given to the next process when time quantum
expires.
A new process is added at the tail of the ready queue when it enters
the system. CPU scheduler selects first process from head of the ready
queue and executes it for a specified time quantum. Once the time
quantum expires, dispatcher is invoked to pre-empt current running
process and CPU is given to the next process placed at the head of the
ready queue. The running process may have a CPU burst time less or
greater than time quantum. If burst time of running process is less than
the time quantum then, the process itself releases the CPU. The
scheduler then selects next process from ready queue and executes it. If
burst time of running process is longer than time quantum then, context
switch occurs and the process is place at the tail of ready queue for
remaining burst time execution.
Example:
Process Burst Time
P1 24
P2 3
P3 3
Time quantum: 4 ms
The resulting RR schedule is as follows:
P1 P2 P3 P1 P1 P1 P1 P1
0 4 7 10 14 18 22 26 30
22 | 37
(Autonomous)
CPU is allocated to process P 1 for 4 ms. Since it requires another 20

milliseconds, it is preempted after the first time quantum and the CPU
is given to the next process in the queue, process P 2. Process P2 does
not need 4 milliseconds, so it quits before its time quantum expires.
The CPU is then given to the next process, process P 3. Once each
process has received 1 time quantum, the CPU returns to process P1 for
an additional time quantum.
e Explain PCB with diagram. 4M
Ans Each process is represented as a process control block (PCB) in the explanation-
operating system. It contains information associated with specific 2M, diagram-
process. 2M
Process State: It indicates current state of a process. Process state can
be new, ready, running, waiting and terminated.
Process number: Each process is associated with a unique number
which is known process identification number.

Program Counter: It indicates the address of the next instruction to be
executed for the process.
CPU Registers: The registers vary in number and type depending on
the computer architecture. Register includes accumulators, index
registers, stack pointers and general purpose registers plus any
condition code information.
Memory Management Information: It includes information such as
value of base and limit registers, page tables, segment tables,
depending on the memory system used by OS.
Accounting Information: This information includes the amount of
CPU used, time limits, account holders, job or process number and so
on. It also includes information about listed I/O devices allocated to the
process such as list of open files.
Each PCB gives information about a particular process for which it is
designed.
5 Attempt any Two of the following: 12M
23 | 37
(Autonomous)
a Enlist the operating system tools. Explain any two in detail. 6M

Ans Following are the operating tools: For List=2
• User Management Marks and
• Security policy Explanatio
• Device Management n any two
• Performance Monitor for 4
• Task Scheduler Marks
A) User management:
• User management includes everything from creating a user to
deleting a user on your system. User management can be done
in three ways on a Linux system.
• Command line tools include commands like useradd, userdel,
usermod, passwd, etc. These are mostly used by the server
administrators.
Useradd: With useradd commands you can add a user.
24 | 37
(Autonomous)
Syntax: useradd -m -d /home/<userName> c

"<userName>" <userName>
Example: useradd -m -d /home/xyz -c "xyz" xyz
File /etc/default/useradd contains some user default options.
The command useradd -D can be used to display this file. Syntax:
useradd -D
Userdel: To delete a user account userdel command is used. Syntax:

userdel -r <userName>
Usermod: The command usermod is used to modify the properties of

an existing user.
Syntax: usermod -c <'newName'> <oldName>
Example: usermod -c 'vppoly' john
Using passwd command

Passwd: A user can set the password with the command passwd. Old
password has to be typed twice before entering the new one.
Syntax: passwd <userName>
Example: passwd vppoly
B) Device Management:
Device management is the process of managing the implementation,
operation and maintenance of a physical and/or virtual device.
All Linux device files are located in the /dev directory, which is an
integral part of the root (/) filesystem because these device files must
be available to the operating system during the boot process.
Example: ls –l /dev
Above example gives the list of device file from kernel.
Udev supplies a dynamic device directory containing only the nodes
for devices which are connected to the system. It creates or removes
the device node files in the /dev directory.
C) Performance Monitor:
It is very tough job for every system or network administrator to
monitor and debug Linux System Performance problems every day.
The commands discussed below are some of the most fundamental
commands when it comes to system analysis and debugging Linux
server issues such as:
1) vmstat: Virtual memory statistics
The vmstat command reports information about processes, memory,
paging, block IO, traps, and cpu activity.
$ vmstat 3
25 | 37
(Autonomous)
2)top: Process activity monitoring command
top command display Linux processes. It provides a dynamic real-time

view of a running system i.e. actual process activity. By default, it
displays the most CPU-intensive tasks running on the server and
updates the list every five seconds.
$ top
3) free: Show Linux server memory usage free command

shows the total amount of free and used physical and swap
memory in the system, as well as the buffers used by the
kernel. # free
4) iostat: Montor Linux average CPU load and disk

activity iostat command report Central Processing Unit (CPU)
statistics and input/output statistics for devices, partitions and
network filesystems (NFS).
# iostat
5) netstat Linux network and statistics monitoring tool

netstat command displays network connections, routing tables,
interface statistics, masquerade connections, and
multicast memberships. # netstat –tulpn
b Explain multithreading model in detail. 6M
Ans Many systems provide support for both user and kernel threads, Each
resulting in different multithreading models. model=2M
Following are three multithreading model:
Many-to-One Model
• The many-to-one model maps many user-level threads to one
kernel thread.
• Thread management is done by the thread library in user space,
so it is efficient; but the entire process will block if a thread
makes a blocking system call.
• Also, because only one thread can access the kernel at a time,
multiple threads are unable to nm in parallel on
multiprocessors.
• Example: Green threads- a thread library available for Solaris
26 | 37
(Autonomous)
27 | 37
(Autonomous)
Advantages:
• More concurrency because of multiple threads can run in
parallel on multiple CPUs.
• Less complication in the processing.
Disadvantages:
• Thread creation involves light-weight process creation.
• Kernel thread is an overhead.
• Limiting the number of total threads.
One-to-One Model
• The one-to-one model maps each user thread to a kernel thread.
• It provides more concurrency than the many-to-one model by
allowing another thread to run when a thread makes a blocking
system call; it also allows multiple threads to run in parallel on
multiprocessors.
• The only drawback to this model is that creating a user thread
requires creating the corresponding kernel thread.
• Because the overhead of creating kernel threads can burden the
performance of an application, most implementations of this
model restrict the number of threads supported by the system.
• Linux, along with the family of Windows operating systems,
implement the one-to-one model.
Advantages:
• Mainly used in language system, portable libraries.
• One kernel thread controls multiple user thread.
Disadvantages:
• Parallelism is not supported by this model.
• One block can blocks all user threads.
Many-to-Many Model
• The many-to-many model multiplexes many user-level threads
to a smaller or equal number of kernel threads.
• The number of kernel threads may be specific to either a
particular application or a particular machine (an application
28 | 37
(Autonomous)
may be allocated more kernel threads on a multiprocessor than

on a uniprocessor).
• The one-to-one model allows for greater concurrency, but the

developer has to be careful not to create too many threads
within an application (and in some instances may be limited in
the number of threads she can create).
• The many-to-many model suffers from neither of these
shortcomings: developers can create as many user threads as
necessary, and the corresponding kernel threads can run in
parallel on a multiprocessor.
• Also, when a thread performs a blocking system call, the kernel
can schedule another thread for execution.
Advantages:
• Many threads can be created as per user’s requirement. 
Multiple kernel or equal to user threads can be created.
Disadvantages:
• True concurrency cannot be achieved.
• Multiple threads of kernel is an overhead for operating system
c Explain LRU page replacement algorithm for following reference 6M
string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate
the page fault.
29 | 37
(Autonomous)
Ans LRU: LRU

• The Least Recently Used (LRU) page replacement policy explanation
replaces the page that has not been used for the longest =2M
period of time. Calculation
• LRU replacement associates with each page the time of that =4 M
page's last use.
• When a page must be replaced, LRU chooses the page that has
not been used for the longest period of time.
• The LRU policy is often used as a page-replacement algorithm
and is considered to be good.
• An LRU page-replacement algorithm may require substantial
hardware assistance.
30 | 37
(Autonomous)
Counters:
• In the simplest case, we associate with each page-table entry a
time-of-use field and add to the CPU a logical clock or counter.
• The clock is incremented for every memory reference.
• Whenever a reference to a page is made, the contents of the
clock register are copied to the time-of-use field in the pagetable
entry for that page.
• In this way, we always have the "time" of the last reference to
each page. We replace the page with the smallest time value.
Stack:
• Another approach to implementing LRU replacement is to keep
a stack of page numbers.
• Whenever a page is referenced, it is removed from the stack and
put on the top.
• In this way, the most recently used page is always at the top of
the stack and the least recently used page is always at the
bottom.
Reference String: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
(Frame size have not mentioned in question so assume frame size as 3
or 4)
LRU: Assume frame size=3
70120304230321201701
77 7 2 2 44 4 0 1 1* 1 *
00 0 * 0 * 0 0 3 3 * 3 0 0*
11 3 32 2 2 *2 * 2 7
Page Fault=12
Assume frame size=4
70120304230321201701
77 7 7 3 3 * * 3 7
00 0 * 0 * 0 * 0 * 0*
11 1 4 1 *1 *
2 2 2* *2 * 2
Page fault=08
6 Attempt any Two of the following: 12M

a The jobs are scheduled for execution as follows: 6M
SJF=3 m
FCFS=3 m
(1m-gantt
31 | 37
(Autonomous)
chart, 2m
calculation
Process Arrival Time Burst Time of AWT)

P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8
i)
ii) SJF
Also FCFS
find average waiting time using Gantt chart.
Ans SJF: Note:
Non-Preemptive SJF
Gantt Chart:
P1 P2 P4 P5 P3
0 7 11 17 25 35
Process Arrival Burst Waiting

Time Time Time
P1 0 7 0
P2 1 4 7-1=6
P3 2 10 25-2=23
P4 3 6 11-3=8
P5 4 8 17-4=13
Average waiting Time=(0+6+23+08+13)/5 = 50/5=10
OR
Preemptive SJF
Gantt Chart:
P1 P2 P1 P4 P5 P3
0 1 5 11 17 25 35
Process Arrival Burst Waiting Time

Time Time
P1 0 7 0+(5-1)=4
32 | 37
(Autonomous)
P2 1 4 1-1=0
P3 2 10 25-2=23
P4 3 6 11-3=8
P5 4 8 17-4=13
Average Waiting Time=4+0+23+8+13/5=9.6
ii) FCFS
Gantt chart:
P1 P2 P3 P4 P5
0 7 11 21 27 35
Process Arrival Burst Waiting Time

Time Time
P1 0 7 0-0=0
P2 1 4 7-1=6
P3 2 10 11-2=9
P4 3 6 21-3=18
P5 4 8 27-4=23
Average waiting Time=0+6+9+18+23/5 =56/5=11.2
b List free space management techniques? Describe any one in detail. 6M
33 | 37
(Autonomous)
Ans A file system is responsible to allocate the free blocks to the file Listing=1M
therefore it has to keep track of all the free blocks present in the disk. Explanation
There are mainly four approaches by using which, the free blocks in =3M
the disk are managed. And
• Bit Vector Diagram=2
• Linked List M
• Grouping
• Counting Bit Vector:
• The free-space list is implemented as a bit map or bit vector.
• Each block is represented by 1 bit. If the block is free, the bit is
1; if the block is allocated, the bit is 0.
• For example, consider a disk where blocks
• 2, 3, 4, 5, 8, 9, 10, 11, 12, 13 are free and the rest of the blocks
are allocated.
• The free-space bit map would be : 0011110011111100
15
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
0
0 0 1 1 1 1 0 0 1 1 1 1 1 1 0
0=Free block
1= Allocated block
The main advantage of this approach is its relative simplicity and its
efficiency in finding the first free block or n consecutive free blocks on
the disk.
Linked List
• In this approach, the free disk blocks are linked together i.e. a
free block contains a pointer to the next free block.
• The block number of the very first disk block is stored at a
separate location on disk and is also cached in memory.
• In this approach, link all the disk blocks together, keeping a
pointer to the first free block.
• This block contains a pointer to the next free disk block, and so
on.
34 | 37
(Autonomous)
c Enlist different file allocation methods? Explain contiguous

allocation method in detail.
Ans From the user’s point of view, a file is an abstract data type. It can be created, 1m- listing,
opened, written, read, closed and deleted without any real concern for its 2m for
implementation. The implementation of a file is a problem for the operating diagram, 3m
system. for
The main problem is how to allocate space to these files so that disk space is explanation
effectively utilized and files can be quickly accessed.
Three major methods of allocating disk space are in wide use:
• Contiguous
• Linked
• Indexed
Contiguous Allocation
• The contiguous allocation method requires each file to occupy a
set of contiguous addresses on the disk. Disk addresses define a
linear ordering on the disk. Contiguous allocation of a file is
defined by the disk address of the first block and its length. If the
file is ‘n’ blocks long and starts at location ‘b’, then it occupies
blocks b, b+1, b+2, - - - - - b+n-1. The directory entry for each
file indicates the address of the starting block and the length of
the area allocated for this file.
• Contiguous allocation supports both sequential and direct
35 | 37
(Autonomous)
access.
• For direct access to block ‘i’ of a file, which starts at block ‘b’,
we can immediately access block b+i. The difficulty with
contiguous allocation is finding space for a new file.
• For direct access to block ‘i’ of a file, which starts at block ‘b’,
we can immediately access block b+i.
• The difficulty with contiguous allocation is finding space for a
new file.
• If file to be created are ‘n’ blocks long, we must search free
space list for ‘n’ free contiguous blocks.
Advantages of Contiguous File Allocation Method:

1. Supports both sequential and direct access methods.
2. Contiguous allocation is the best form of allocation for
sequential files. Multiple blocks can be brought in at a time to
improve I/O performance for sequential processing.
3. It is also easy to retrieve a single block from a file. For example,
if a file starts at block ‘n’ and the ith block of the file is wanted,
its location on secondary storage is simply n + i.
4. Reading all blocks belonging to each file is very fast.
5. Provides good performance.
Disadvantages of Contiguous File Allocation Method:

1. Suffers from external fragmentation.
2. Very difficult to find contiguous blocks of space for new files.
3. Also with pre-allocation, it is necessary to declare the size of the
file at the time of creation which many a times is difficult to
estimate.
4. Compaction may be required and it can be very expensive.
36 | 37
(Autonomous)
37 | 37

Important Instructions To Examiners:: Q. No - Sub Q. N. Answer Marking Scheme 1. A Ans

Uploaded by

Copyright:

Available Formats

Important Instructions To Examiners:: Q. No - Sub Q. N. Answer Marking Scheme 1. A Ans

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Important Instructions To Examiners:: Q. No - Sub Q. N. Answer Marking Scheme 1. A Ans

Uploaded by

Copyright:

Available Formats

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION

WINTER – 2019 EXAMINATION Subject Name:

1. Attempt any Five of the following: 10 M

Ans Real time Operating System: 1 Mark :-

Types of real time operating system

b Explain any 4 services provided by OS. 2M

2. Program execution: The operating system provides an

3. I/O operations: When a program is running, it may

5.Communication: In the system, one process may need to exchange

6.Error detection: Operating systems detects CPU and memory

7.Resource allocation: Operating system manages resource allocation

8.Accounting: Operating system keeps track of usages of various

9.Protection & security: When several separate processes execute

c Draw process state diagram. 2M

process state diagram

d Explain any four scheduling criteria. 2M

3. Turnaround time: The time interval from the time of submission of

5.Response time: The time period from the submission of a request

because the programmer no longer needs to worry about the amount of

2. Attempt any Three of the following: 12M

Ans Types of operating system 1 Mark:-

b List components of OS. Explain process management in detail. 4M

Process Management: The operating system manages many kinds of

Ans Inter-process communication: Cooperating processes require an Inter- Define inter

• attach to the addres

• These processes are

In this, all processes who want to communicate with other

 The processes that want to communicate with each other must

3. Attempt any Three of the following: 12M

-u: Shows the activities of any specified user at any time.

-a: It shows the processes of all users.

-e: It displays processes including user and system processes.

b Explain deadlock? What are necessary conditions for deadlock? 4M

3. No pre-emption: Resources cannot be pre-empted i.e a

4. Circular wait: A set {P0,P1…Pn} of waiting processes

Ans An important operation of memory management is to bring programs Explanation

Fixed Partitioning: Main memory is divided into multiple partitions of

Unequal size partitioning: Main memory is

Variable partitioning: When a process enters in main memory, it is

available memory space in main memory. If it is available, then memory

d Describe sequential and direct access method. 4M

Direct access: It is also called as relative access. A file is made up of

method is used for immediate access to large amount of information.

a query concerning a particular subject arrives, we compute which block

4 Attempt any Three of the following: 12M

ii)create a file FIRST in OSY folder:

iii) List/display all files and directories:

iv) to clear screen:

• get process attributes, set process attributes

File Management: System allows us to create and delete files. For

3. Device Management: When a process is in running

4. Information Maintenance: Transferring information

5. Communication: Processes in the system,

name or identity. Once the communication is over system close the

1. Long term scheduler: It selects programs from job

2. Short term scheduler: It is also known as CPU

3.Medium term scheduler: When a process is in running state, due to

d Explain Round Robin algorithm with suitable example. 4M

Ans It is preemptive scheduling algorithm. A small unit of time known as a explanation