Amie Section B Computer Science Question Paper Operating System

AMIE Study Material & Admission Packages
AMIE(I) Study Circle, Roorkee
AMIE(I) STUDY CIRCLE, SECOND FLOOR, SULTAN TOWER, ROORKEE - 247667 (UTTARANCHAL)
www.amiestudycircle.com
EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020
S'09:5 FN:CP413/423/433 (1455)

OPERATING SYSTEM
Time: Three hours

Mllximum Marks: 100
Answer FIVE qesiions, taking ANY TWO from Group A,
ANY TWO from Group B and AIL from Group C .
AU parts ofa question (a, b, etc.) should be
answeredat one place.
Answer should be briefand to-the-point and be supplemented .with neat sketcheS. Unnecessary long answer
may result in Joss ofmarks.
Any missing or wronp data may be assumed suitably
giving proper justification.
Figures on the right-himd side margin indicate full marks.
Group A_
1.
(a ) What is CPU state 7 Explain how the notion of CPU

state is useful in implementing multiprogramming. 10
( b ) The kernel of an OS masks off all interrupts during
interrupt processing. Discuss its advantages and
disadvantages.
10
z.
(a ) Two persons using the same time sharing system at
the same time notic<; that the response time to their

programs differ widely. What are the possible
reasons-for this difference?
6
( b ) A job contains five data cards in a job step. However,
the job step program tries to read 10 cards. Clearly
explain actions of the command processor when the
program tries t<> rt~ad the sixth and subsequent cards. 6
(TumOver)
(c) An OS cannot meet the response requirement of a

real time application if it is executed as a single
process. Explain, with an example, how creation of
multiple processes can help to meet the response
requirements of the application in the same OS.
8
( b ) Discuss
memory fragmentation in the buddy

system and powers-pf-two allocators.
8
6. ( a ) The kernel
of an OS receives
requests for memory
. .
.
/
allocation at a high rate. It is fomidthat a large fraction

of requests are for memory areas of size 100 bytes, .
300 bytes and 400 bytes(called as standard sizes).
3. (a ) Describe how the number of scheduling actions

performed in an OS depends on occurrence of events
in the system. Develop a formula to calculate the
number of times an OS performs scheduling.
10
Other requests are for areas of various_o_ther siZes.

Design a memory allocation s-cheme in which no
fragmentation arises while allocating areas of
standard sizes and no int~rnal fragmentation aiis.es
(b) Describe conditions under which a kernel may
perform
dispatching
scheduling.
without
while allocating areas of oth~r siz~s.
performing
12
10
{b) Comment on the following statements:
4.
(a) Give examples of conflicts between user-centric
and system-centhc views of scheduling.
(i) Self-relocating programs are lt~ss efficient than
relocatable programs.
(b) Explain how starvation is avoided in the Unix and
Window systems.
(ii) Therewouldbeno_needforlinkersifaUprograms
are coded as self relocating programs.
(c) Comment on validity of the following statement:
7.
'The Unix scheduling policy favours iriteractive

processes over non-interactive processes.'
6
( a ) The degree of multiprogramming in a paged virtual

memory system is varied by changing the memory
allocation for. processes. Draw a graph of degree of
GroupB
5.
multiprogramming vs. CPU efficiency, Explain the

nature of the graph in the regipn of high degree of
(a ) Two versions of a program P, called Ps and Pd, are
multiprogramming.
developed using static and dynamic memory allocation, respectively. When an effort is made to execute
~. an OS gives the message 'insufficient memory,
cannot run the program'. However, the san1e OS
executes program Pd without any difficulties.
Explain why this happens.
12
S'09: 5 FN:CP413/423/433 (1455)
10
( b ) An OS uses a simple strategy to deal with deadlock

situations. When it finds that a ser Of processes is
..
4
deadlocked, it aborts all of them arid restarts them
imfi1ediately. What are the conditions under which
10
the deadlock will not recur?
(Continued)
S'09: 5 FN: CP413/423/433 (1455)
( 3
(Turn Over)
EMAIL: [email protected] Ph: (01332) 266328, 9412903929
EMAIL: [email protected] Ph: (01332) 266328, 9412903929
S'10: 5 FN: CP 413/423/433 (1455)

OPERATING SYSTEMS
Time : Three hours

Maximum marks : 100
Answer FIVE questions, taking ANY TWO from Group A,
ANY TWO from Group B and AIL from Group C.
All parts of a question (a, b, etc.) should be
answered at one place.
Answer should be briefand to-the-point and be supplemented with neat sketches. Unnecessary long answers
Any missing or wrong data may be assumed suitably
Figures on the right-hand side margin indicate full marks.
Group A
1.
(a ) What is CPU state ? Explain how the notion of CPU

state is useful in implementing multiprogramming. 10
(b) The kernel of OS masks off all interrupts during
interrupt processing. Discuss its advantages and disadvantages.
10
2.
(a ) Two persons using the same time-sharing system at

the same time notice that the response times to their
programs differ widely ? What are the possible rea10
sons for this difference?
(b) A real time application requires a response time of
2 sec. Discuss the feasibility of using a time-sharing
system for the real time application, if the average
response time in the time-sharing system is (i) 20
sec, (ii) 2 sec, (iii) 0.2 sec.
10
AMIE(I) STUDY CIRCLE, IInd FLOOR, SULTAN TOWER, ROORKEE - 247667 (UTTARANCHAL)
EMAIL: [email protected] Ph: (01332) 266328, 9412903929 Web: www.amiestudycircle.com
3. (a) Explain how starvation is avoided in Unix and

Windows systems '?
(b) Describe why authentication is important for file pro-
tection.
(b) What do you mean by scheduling in batch proce-
of the user who owns a file, ( i) deciding whether a

user belongs to the same user group as the owner
(c) Give examples of conflicts between user-centric and
system-centric views of scheduling.
4.
of a file.
and non-blocking protocols using monitors. What are

the difficulties in the implementation?
(b) A memory allocator works as follows :Small memory
which is initialised to 0; however, they do not use

mutual exclusion while accessing its value. Each
process oolllaills , a loop that executes the single
statement sum : = sum + 1 50 times. H no other
operations are performed on sum, indicate the lower
bound and upper bound on the value of sum when
10
both processes terminate.
(c) Discuss how the stable storage technique can be used
GroupB
8. (a) Comment on implications of the following features

for efficient use and user convenience : ( i) Sequence
6
of programs, (ii) virtual devices.
Compare and contrast the following policies of resource

allocation:
(a) All resource requests together
(b) Allocation using resource ranking
( c ) Allocation using Banker's algorithm
(b) Justify the following statement: 'Due to presence of
the cache memory, a program requires more CPU

time to execute in a multiprogramming or time-sharing system than it would require if it were to be
executed all by itself, i.e., without having any other
programs in the system'.
8
on the basis of (i) resource idling, and ( ii) overhead of

the resource allocation algorithm.
6.
(c) Draw a time chart for a system containing two CPU-
bound programs and two 1/0 bound programs when

(i) CPU-bound programs have a higher priority, and
(ii)I/0-bound programs have a higher priority.
(a) List the security attacks that cannot be prevented by
encryption.
H)
(b) Two concurrent processes share a data item sum,
areas are allocated using a buddy system. Large

memory areas are allocated using a free list and a
first fit allocator! Comment on the efficiency and
8
memory utilization achieved by this allocator.
s.
l~
7. (a ) Explore the possibility of implementing the blocking
(a) Discuss memory fragmentation in the buddy system

6
and powers-of-two allocators.
to prevent loss of file system integrity.
'6
(c) De~cribe the provisions in Unix for ( i) finding the id

6
ssing?
10
11
W'10: 5 FN: CP 413/423/433(1455)

OPERATING SYSTEMS
Time : Three hours
Maximum Marks: 100

Answer
questions, taking ANY TWO from Group A,

from Group B and AIL from Group C.
FIVE
ANY TWO
AU parts ofa question (a, b, etc.) should be

Answer should be briefand to-the-point and be supple~
mented with neat sketches. Unnecessary long answers
Group A
1. ( ~ ) Differentiate between job, process, and task with
a suitable example.
( b ) What are different goals of an operating system ?

What are different views of operating system ?
12
2.
(a ) How a time-sharing system differs from (i) batch

processing system, ( ii) multiprogramming system,
and (iii) real time system?
12
( b ) Explain one command interpreting with reference
~~~~-
3.
(a ) What are the purposes served by any information

management system? Discuss them in detail.
10
12
13
W'12: 5 FN: CP413/423/433 (1455)
OPERATING SYSTEM
Time : Three hours
Maximum Marks : 100
ANY TWO from Group Band ALL from Group C..
All parts of a question (a, b, etc. ) should be
Answer should be briefand to-the-point and be supplemented with neat sketclies. Unnecessary long answer may
result in loss ofmarks.
Figures on the right-hand side margin indicate full marks
Group A
1. (a) Draw the state diagram of a process from its

creation to termination, including all transitions, and
~vnl":ll1n ,:J~'TD-r'1..T etf'llf-&ao. or::~onrl Dto'UAr'1..T
'-''1'-I..J
U.U.U. '-'Yf'-'1..)
'""nr...P.LU.LI..L
.:ll""'t.'""
example.
trw.l.nco;+-1nn.
UUJ..U:U.&.J.VU.
u.:~+J..
n....,
YYH.U. a.J.J.
10
(b) Why is segmented paging important as compared

to a paging system ? What are different pieces ofthe
virtual address in a segmented paging?
10
2. (a) Consider the situation in which the disk read/write
head is currently located at track 45 (of tracks
0-255) and moving in the positive direction. Assume
that the following track requests have been made
in this order: 40, 67, 11,240, 87. What is the order
in which optimized C-SCAN would service these
requests and what is the total seek distance ? 12
AMIE(I) STUDY CIRCLE, SECOND FLOOR, SULTAN TOWER, ROORKEE - 247667 (UTTARAKHAND)
14
EMAIL: [email protected] Ph: (01332) 266328 Web: www.amiestudycircle.com
(b)
What is a process scheduling ? Explain different

sub-functions ofprocess scheduling.
8
(b)
3. (a) What is a deadlock ? Explain the necessary

conditions for deadlock to occur.
(b)
4.
(a)
(b)
Differentiate between synchronous and asynchro10

nous input/output with the help ofan example.
8. (a) List the major activities of an operating system with
10
respect to memory management, secondary storage

10
management and process management.
What is an 110 buffer ? What is the advantage of

buffering? Is buffering always effective? Justify your
10
answer with the help of an example.
(b)
Categorize the CPU scheduling algorithms. Explain

non-pre-emptive algorithms.
10
What is the data structure used by an operating

system to keep track of process information ?
Explain.
10
Group C
Explain the differences between the following :
9. Choose the correct answer for the following :
3+3+4
10
(i) Logical and physical address space
(z) The process related to process control, file management, device management, information about system
and communication that is requested by any higher
level language can be performed by--.
(ii) Internal and external fragmentation
(iil) Paging and segmentation.
Group B
(a)
editors.
5. (a) Differentiate between protection and security.
(b)
compilers.
Explain the techniques used for protection of user
files.
(b)
(c) system call.
10
(d) caching.
What is meant by inter-process communication ?

Explain two fundamental models of inter-process
10
communication.
(iz) Multiprogramming systems--.
6. (a) What are interacting processes ? Explain a method

of implementing interacting processes.
(b)
(a)
10
What are the differences between user level threads

and kernel-supported threads?
10
(b) execute each job faster.
(c) execute more jobs in the same time.
7. (a) Give a solution for readers-writers problem using

conditional critical regions.
are easier to develop than single programming

systems.
10
(d) are used only on large mainframe computers.
15
(iii) Which one is not the state of the process ?
(c) efficiency.
(a) Blocked
(d) capacity.
(b) Running
(vii) - - i s the situation in which a process is waiting

on another process, which is also waiting on another
process, which is waiting on the first process. None
of the processes involved in this circular wait are
making progress.
(c) Ready
(d) Privileged
(iv) The problem of thrashing is effected scientifically
by--.
(a) Deadlock
(a) program structure.
(b) Starvation
(b) program size.
(c) Dormant
(c) primary storage size.
(d) None of the three above.
(d) None of the three above.
(viii)Which one of the following file name extension

suggests that the file is backup copy of another file ?
(v) The state of a process after it encounters an J/0

instruction i s - - .
(a) 1XT
(a) ready.
(b) COM
(b) blocked/waiting.
(c) BAS
(c) idle.
(d) BAK
(d) running.
(ix) Which was the technique introduced because a
single job could not keep both the CPU and the J/0
devices busy?
(vi) The number of processes completed per unit time
is known as -
--.
(a) output.
(a) Time-sharing
(b) throughput.
(b) Spooling
16
17
S'13: 5 FN: CP 413/423/433 (1455)
OPERATING SYSTEM
Time : Three hours

ltfaximum Marks : 100
ANY TWO from Group Band ALL from Group C.
All parts of a question (a, b, etc. ) should be
Answer should be briefand to-the-point and be supplemented with neat sketches. Unnecessary long answer may
result in loss of marks.
Group A
7
1. (a) Distinguish between paging and segmentation.

(b) What is file concept? What are various operations
that can be perforriled on a file ?
(c) What is command interpreter? Explain its working

5
and functions.
2. (a) What is deadlock avoidance ? What is safe state ?

Write an algorithm for deadlock avoidance.
1+3+4
(b) What are the advantages of paging ? What is the

difference between paging and frames ? What is the
need for page replacement ? Explain the concept
ofthrashing taking an illustrative example. 4 + 2 + 2 + 4
18
(b)
3. (a) Distinguish between multiprogramming and time-
(b)
sharing.
Explain the working of disk-based I/0 system.
Mention advantages and drawbacks of performing

file protection checks at (i) file open time, and (ii)
10
every read or write operation.
7. Explain the following concepts :
(c) Discuss advantages of segmentation.
(d) Expl&in conditions for occurrence of a deadlock.
(a)
Piping
(b)
Device independent I/0
4x5
4. (a) An operating system uses a simple strategy to deal

with deadlock situations. When it finds that a set of
processes is deadlocked, it alerts all of them and
restart them immediatelv. What are the conditions
10
under which the deadlock will not occur?
(b)
'A memory mapped file provides advantages of

both sequential and direct files.' Comment on vali10
dityofthis statement.
(c) Protection
(d) Process synchronization
8. (a) Discuss various threats to security in any computing

environment
(b)
c..._.........
.,.n.
uup
10
What are the advantages of distributed systems

10
over the centralised system ?
.a~
Groupe
5. (a) An airline reservation system is to be implemented
9. Answer the following in brief:
using monitors. The system must process booking

and cancellation requests and perform appropriate
action.
(z)
(z) Identify the shared data and operation processes required.

(iz)Implement the reservation system usingmonitors.
(b) Write a note on synchronization of processors that

execute code of an SMP kernel in parallel. Also,
discuss suitability of various kinds oflocks to satisfY
10
these synchronization requirements.
6 . (a) Discuss whether encryption can ensure secrecy,

privacy and integrity of data.
10
19
10 X 2
How i~ a file with two names different from having

two copies of a file ?
(iz) On a system with 2 24 bytes of memory and fixed

partitions of size 6.5, 536 bytes, how many bits
the limit register must have?
(iil) What do you understand by swapping memory?

(iv) How many processes may share a messaging
object?
(v) Show the relationship between safe, unsafe and
deadlock states with the help of a diagram.
W'13: 5 FN: CP 413/423/433 (1455)

OPERATING SYSTEMS
1ime : Three hours

Maximum Marks : 100
ANY TWO from Group B and ALL from Group C.
All parts ofa question ( a, b, etc. ) should be
ar~Pt...vered at one place.
Answer should be briefand to-the-point and be supplemented

with neat sketches. Unnecessary long answer may result in
loss of marks.
Group A
1. (a) What is the purpose of command interpreter? Why
is it usually sep~rate from the kernel ? Would it be
possible for user to develop a new command interpreter using the system call interference provided by
OS?
2+2+2
(b) Explain deadlock detection and deadlock recovery.
How are they implemented?
(c) Explain allocation methods in directory implementa-
tions. Also, define seek time and rotational latency in

disk structures.
5+ l + 1
2. (a) Define essential properties offollowing types ofoperating system : (1) Batch, (il) interactive, (iil) time sharing,
20
(iv) real time, (v) network.
'Sx I
(b) Find the TAT (turnaround time) and average waiting

time using the priority scheduling in non-pre-erilptive
mode using Gantt chart:
Process No.
Priority
Arrival Tune
P1
4
0
P2
Burst Tune
5
1
P3 P4
7 2
2
3
1
2
P5
P6
6
5
(b) Define memory management and explain its different

2+5
policies.
6+1+1
(c) Compare the main memory organization schemes of

contiguous-memory allocation, pure segmentation
and pure paging with respect to the following issues : 7
(c) What do you mean by address binding and its type ?

1+4
(d) Consider a system having n process and 6 tape
drivers, each process requires two tape drivers to
complete their execution. What is maximum values of
n wliich ensures the deadlock free operation ?
3
GroupB
5. (a) Define conditions to be followed to achieve synchro-
(z) External &agmentation
nization and also solution to achieve synchronization

with their types.
10
(ii) Internal fragmentation
(b) What are various kinds of performance overheads
(iiz) Ability to share code across process.
associated with servicing an interrupt?
3. (a) Perform optimal page replacement on following

refe~nce string:
-7, 0,.1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0,1
Find number of page faults and define optimal page
5
replacement.
(b) What is thrashing? Explain its causes and write
(c) Defme critical section problem wit:p. an example and

also discuss solution to it.
(c) A main memory unit-with capacity of 4Mb is built
21
6. (a) Explain multiuser working of an operating system

with an example. Also, explain its design issues.
(b) Define properties mutual exclusion and progress. Con-
any two solutions to increase CPU utilization in case

of thrashing.
I +2+2
using IM* 1bit RAM chips. Each RAM chip is
having I K rows of cells with 1K cells in each row.
Find the time required to perfrom one refresh operation on all the cells in memory cell.
(d) Write issues related to distributed file system.
4. (a) Define Banker algorithm? Where ish used? Also,

2 +2 +I
define Safe sequence.
3 . 6
Also, define burst time and response time.
sider the methods used by the process P1 and P2 for

accessing its critical section whenever needed as
given below. The initial values of shared Boolean
variables s 1 and s2 are randomly assigned.
Methods used by P 1
Methods used by P2
While (sl = s2)
While (sl = s2)
Critical section
Critical section
s 1 = s2 ;
s2 = not (s 1) ;
I0
22
You may download prospectus to buy excellent study

material for AMIE exams.
You will also get full access to our online support
with our course which includes
latest AMIE question papers, model test papers,
eBooks, audio and video lectures, course updates and
interactive objective questions.
AMIE(I) Study Circle

Website: www.amiestudycircle.com
WhatsApp: 9412903929
Email: [email protected]

Amie Section B Computer Science Question Paper Operating System

Uploaded by

Copyright:

Available Formats

Amie Section B Computer Science Question Paper Operating System

Uploaded by

Document Information

Original Description:

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

Amie Section B Computer Science Question Paper Operating System

Uploaded by

Copyright:

Available Formats

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

S'09:5 FN:CP413/423/433 (1455)

Time: Three hours

(a ) What is CPU state 7 Explain how the notion of CPU

(a ) Two persons using the same time sharing system at

the same time notic<; that the response time to their

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

(c) An OS cannot meet the response requirement of a

memory fragmentation in the buddy

allocation at a high rate. It is fomidthat a large fraction

3. (a ) Describe how the number of scheduling actions

Other requests are for areas of various_o_ther siZes.

(b) Describe conditions under which a kernel may

while allocating areas of oth~r siz~s.

(a) Give examples of conflicts between user-centric

and system-centhc views of scheduling.

(i) Self-relocating programs are lt~ss efficient than

(b) Explain how starvation is avoided in the Unix and

are coded as self relocating programs.

(c) Comment on validity of the following statement:

'The Unix scheduling policy favours iriteractive

( a ) The degree of multiprogramming in a paged virtual

multiprogramming vs. CPU efficiency, Explain the

(a ) Two versions of a program P, called Ps and Pd, are

( b ) An OS uses a simple strategy to deal with deadlock

S'09: 5 FN: CP413/423/433 (1455)

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929, 9897394020

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

EMAIL: [email protected] Ph: (01332) 266328, 9412903929

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

S'10: 5 FN: CP 413/423/433 (1455)

Time : Three hours

(a ) What is CPU state ? Explain how the notion of CPU

(a ) Two persons using the same time-sharing system at

EMAIL: [email protected] Ph: (01332) 266328, 9412903929 Web: www.amiestudycircle.com

AMIE Study Material & Admission Packages

AMIE(I) Study Circle, Roorkee

3. (a) Explain how starvation is avoided in Unix and