j i.r::t,!r.!,,r.ir L)lr,,,:i.

s jTY
.l.r S ai f LiIt Ol Et..icNEERIt.C
Ennriri*ticn Cclfr.ol Di.iisiol
lL}TS Cirrifrx

, D ltuJet t: Jp_eft.|tEj).]!, .C;. .,:,.

J:-ri:c:ti::.i::e rl,-]i:t:ed io give iiteir ais*crs in Creii ox,n rvoris as iar as L1ra.t!aa-oie.
', ..-r?-. 1r.
i::i)gtte: ii::ite nt:glii irJi:cah l: Lil Mtis.
.;.t r, - .(r. /1,
"nt. 4,'.r, r,,o,.,.- -
t::,]:]:
t:r.tem in dn op"raring systsm? wr;ie do\m tie majoi. differences
If:::
car\een iot/owlr g tyres ol-operai.ng
^caLl
s1.s-en.
a, brlch s) s'e!n [::6J
b) Irteracrive system
c) Reai tjme system
d) Tine sha.-Lag system
:. State 5- Siate process model. From the
follo info.mationi
Process B urst Tirle Diioiiiy
Pl 10 ,l
I
2

P1 I 4
Pj 2 2
Assume ihe processes a[ived il the oider p;, p2, p3, p't and pj al1 ttme 0, pr.iority 1 as
;rishesi a.1d 4 as lc\,est.
a) Diaw the gaott chari
t') CalcDl3te averag: rvaiting iin]e and al,erage iunaror.:nd
iirDe for the foiicriing
scheduling algoritl.rn.
' i, r"l-.n 1. u.r:c;::.. l7
Ro:r...1
iii-\ |:io::t.,' ;,-reegpl;'.'1
rii,, --,.1- iivq < rJ:
(n ) FCi-S

\l11t,is ciiical s:cior problen? \rlhy nusi the execudng the

critical secion be
:i I :.j]i-:]:ly-ll:l
:E
Describe how ruce cordition occurs 1n prjucer,
u,e sctnaphCrJ 'o sohc it, """r,_",
p. ..
p,:_61
]",.;:0.: l:ij:1,d::. :Jp;'irg.:' or.
ti'1,':::-i::nl:],'ior"o1:;'r
:ccr Jo"lc.l ,ddr"r. 5p.ces ofe, .l.l pzs?,0:
In I 11 o j2frarrcsti cn
t: Jic.'..,.1rr.. 01 -ie:n;,r:."'"dJJ.. ll 'l
,6) Ho'! pagirlg riill be do.e?
"n,.,,y. J J.l:c.....

'lh3t is iie role ol ile

sy,stem? I{0v., can files be Implementedl,
Ljst aqy tfuee oi them
-ifi a.Cl.aliages arC dised,,,ariages ofeach. LZ+€l
of a.

i4+41
[2x41
 .rr
Tji.I l1 r I L: i.r_r l_ r.i 1,
i ti \_ r r._

,.\;i ait U IE Or :\CDr:Eiti\i;

:\.rll1iIlt:i0n Con Lroi l)ir i,tir_rn h'oqrlJnrn ! iC
SJ

lll:S P'" L'

l_ Pr:r tri;r:.t: il

,\:' t; iL c I
.,_r'ri::.t:::J :.je ijalIjr:al :rr
{j., :
- : a :tl,tt. 1 [ I q! i : : i r,: t.

i:.-ll

It'N CPU Tine n$

B
6
C

I
i.r D:il!e feee c.itdlilc;rod ciiricai seciic;t.
Why process needs to i_.e sJ,rchrcnizrci?
Gl',,e ela:.rp1e.

:_ E;r-"1arl TSL algcr::li:]l t4l

.!,j pe:ei3ca s ajgofiii..m.
l: i:'t: oeixer:d pe"qjn3 anil tiiesijnp.
Cr
i5l
nr:mber oipage Gulrs .ccordiig ic
:.:ina; ana lni- a'r!o-.r;; ,;;#;b:i]:lj::,'h" :
rAssDme page ranresl
2, 4, 1, 2, j. -i, 6. ,, ,, ,, _, ,,:,'j:::;::,;q;e!ce' [+=5]

ii c.:ss c-ciiig-,rcus ard linl{eC jist irnpiernerltation olfile.

lvhai js filc syJiein laloul?
:r::-arr * rti ilqure.
l::li. ie.rilock and jisl the diaCjcck irendjilg sl.aiegies.
- I "l ie ,r-- Consider the folior.r irLe
: .: -;.un-: i .--
,^i,n
;.ri _ I _r,-^
I I-r-
t: j"7r"';,'--r' ^_

,: ::.:r..ls of I/O scftil'l]re. !:(itlljll sl crufed I/O sL,i-t.,rarc iaye:j.

[.- tl
ial
 iRIBHUYAN UNiVERSITY
!.{STiT-dTE OF ENG'\TEERJ}iG
BCTr
. Exa#ilretisx Cantroi Divisioi: I11/ ll
' ?078 Baishakh

S,Aittt' - Qeel{ing:q1slgrrlc-r 6s6)

/- Candidates ari requireii tc gi13 thoir aidwers in their cvr words as i'sr--as practicable -
/ Alternpt AII questions
/ rni" ier,;; i. tl,e ,urgin'ridic'n? frlliJEElis
,/ Asitie suitcble dctu iJ nectssary
statelieltt of tt?'*t
1- Defme operating System. Erplain lnteractive aod Real time os vrith
1t*r]
characteristios example*
layeled struct'ire of
require le-mappin€-of 1e1o'rces? ls
2. Explain why exo-k-ernel doesrot [2+3]
operating system is beeer tlrar monclithic
expfal
structurei
Kemel ttu"'
the advantages and disacivanlages of
3. What do you inean by, th-reads? Write ,r*r,
thread and User ievel tbreati
with given amval time and length of &e CPU
brrsi
4. Let us consider following plocesses t6l
giveo i:r rniltiseconris'
troc€ss Arlival Time Burst Time
.;: PI 0 4
P2
P3 2 2
3 1
P4
P5 4 6
P6 6 3

a)Draw|.heGantlchansholvinglheexeculionforFCFS,SRTNaldRR(Quantum=2)
Time?..
;i ;;il"i*ffi;,"'uttt in Inti*ittto* r'verage Tumarotrnd
Explain the "Dinninq-P,flljo:::ller eroblen"
5. $hat is Mutual Exclusion' probler'r in I?C?
problem hupp"n' in ftestnt the solution wirh pseudocodeBi2+61
*'hen suoh "o^puo'"'yJt"i':
exaljrPrc.

What is'vittual metnory'? Diffete'ntiaie

between paging.and t:eT::tlf: teclniques'
6. iie io. pugini uuittt illusuation cf samlle pug"l2+3+51
TLB e4tl exact n'orKr'g
Erplalr! "i
aco"-ssing scenario'
list
file sysiem can be implemen:ed bv linked
7- Exolain file systen layout ir detaiL' llow [3+3]
using index? Write its adlantages and
disadvailtages
the order of request as 82' 170' 43'
160' 24' 16' 190
8. Suppose the disk requests comes rn
ani cunent position ofn"oanvnte ntJals
so lfa wek takes 6msec/cylinder- How much
seekardseekiimeisn""a"aro''l'":ii]iiri'idl'N'"'ac-r-ooKdiskarmsched'itn*'rro.,
algorittun
--.--^-' c--rai6
Explain .apca.
caosar cipher
"i'her
surt
with suitable exarrple
9.
' what do mean by sylnmetric crJptosystem? Lz+3]'2j
fl""'pa""ti." i"r':ain is ir:rplernetried in security? to-
p'oiicies and access colitroi on secruit-v implementation'
10. comf*u betw€en system ,n*oi
does ACL wo.k? lllustrate. 5ln
t
36 TRIBHUVAN UNIVERSITY
INSTITUTE OF ENGINEERING BE Full Mar}s i 80
BCT
Examination Control Division
2075 Bhadra M/II

$!-nte"J::-osstqqlglY*-qngTg-!)
practicable.
,/ Candidates are required to give their answers in their own words as far as
{ Attempt 4ll questions-
/ The figures in the margin indicate Full Marlrs.
{ Assume suitable data if necessary.

1. Differentiate between VO bound process and CPU bound process? What

is process
scheduling? Why do we need thread? [2+3+3]
set of processes,
2. Define process in OS and explain possible states. Consider the following
The processes are assumed to have
with th; length of the CpU burst time in rnillisecond.
anived in the order pl, pZ, P3, P4, P5 all at time 0. [Lowest Number being Highest
Priorityl t8I
Process Burst Time Priority
PI 10 3
P2 I I
P3 2 5
P4 I 4
P5 5 2

Draw Gantt chart illustrating priority and RR (quantum = 1) scheduling-

Also find
average waitingtime and averag-" tutn-around time for each of the algorithms-

Consider a disk queue with requests for I/o to blocks on cylinders 23,
89, 132, 42, 187 '
3. much seek is
Assume disk head initially at iOO and a seek takes 6m/sec/cylinder. How
needed for FCFS, SSF und SCAN disk arm scheduling algorithns. t8l
Explain ilode approach of fite system implementation with its advantages
n
.i.
and

disadvantages. t8l
are the differences betueen fixed partitioning and variable
partitioning system of
5. What
memory for multiProgramrning? 'l [3+5]

Given reference to the following pages by a program:

0,910, 1, 8, 1 r8,7,8,7, 1,2,8,2,7,8,2,2 r8,3
How many page faults will occur if the program has 4 frames for Optimal Page

Replacement al gorithm?

6. Explain private and public key used in asymmetric cryptography' What

is'the use of
ACL? [5+3]

7. iWhat is critical section problem? Why must the executing the critical section be mutually
exclusive? Describe how semaphore can be used to solve the critical section
problem. [2+2+4]
responsibilities
8. What is the significance of system adrninistration? Describe the role and
of system adirinistrator to keep the system updated and efficient. Explain with an
example. 13+51
l
9. Consider a system with 5 concurrent processes (PO,PI ,P2,P3,P4) and 4 resources types
(R0,R1,R2,R3). The number of instances of each resources tlpe in the system are 6,4,4,2
respectively" Allocation table and Maxirnum claim table are as follows: 14+41

Allocation
RO RI R2 R3
Maximum claim
PO 3 7' I I
RO RI R2 R3 P1 I 2 0 2
PO 2 0 I I P2 t 1 2 0
PI I I 0 0 P3 3 2 I 0
.P2 I I 0 0 P4 2 I 0 I
P3 I 0 I 0
P4 0 I 0 I

a) Calculate Need matrix as per Banker's algorithm.

b) Is the state safe? If so, show the safe execution of the processes
10. Write short notes: [2x41
i) Thrashing
ii) Shell programming
***
t,E TRIBHUVAN UNIVERSITY
43
INSTITUTE OF ENGINEERING
Examination Control Division
2074 Bhadra

Subjecl: - Operating System Gr656)

,/ Candidates are required to give their answers in their own words as far as practicable.
{ Attempt All questions.
,/ The figures in the margin indicate FullMarks.
,/ Assume suitable data if necessary.

1. a) Explain multiprogramming, multiprocessing and distributed operating system. t6]

b) Explain the virtual machine structure. What are the benefits over other operating
system structure? l2+2J
2. a) Difference between process and thread. Explain how thread based execution
minimizes context switching problem of process based execution. [2+2]
b) Suppose 5 processes are submitted at time 0.
Process A B C D E
Burst Time 35 l0 l5 5 20
a
Priority J 2 4 5 I
Show the execution timeline of the processes using Gantt Chart for FCFS, SJF and
Round Robin (q:5). Also calculate mean tumaround time in each case. t61

3. a) What is race condition? Explain how SleepQ and Wakeup0 solution is better than
busy waiting solution for critical section problem. l2$l
b) What is TSL? Why it is used? Explain the major operations of semaphore with a
simple implementation as a class. t5]
4. What is thrashing? Consider the following page-reference storing-
7 , 0, 1,2,0,3, 0, 4,2, 3, 0,3,2, 1,2, 0, |,7, 0, l. How many page faults woud occur for
the following page replacement algorithms, assuming 3 frame.s:-
a) FIFO b) Optimal c) LRU d) LFU [2+8. _
5. Discuss various file allocation and access methods. Compare their advantages and
disadvantages. 14+61

6. A disk drive has 50 cylinders, numbered 0 to 49. The drive is currently serving a request
at cylinder 15, and the queue of pending requests, in FIFO order is 4,40, 11,35,7, 14.
What is the total distance that the disk arm moves for the following algorithms:-
a) FCFS r b) SSTF c) SCAN d) LOOK e) C-SCAN UOl
7. What is Deadlock and indefinite Postponement? Explain the necessary conditions for
deadlock and Explain how deadlock can be prevented? A system has 2 process and 3
r€sorrrpes. Each process need maximum of two resources, IS deadlock possible? Explain.[+1+3+3+2-

8. How authentication is an essential mechanism for maintaining security? Explain. t4l

9. Write short notes on: 12"31
a) Caesar Cipher
b) Administrationtasks
*t*
 l$('
TRIBHUVAN LINIVERSITY
,,* Full Marks
INSTITUTE OF ENGINEERING
Pass Marks
Examination Control Division
2073 Magh

Subiecf: - Operating_ Sy_stem (9Tf !s)

as practicable.
{ Candidates are required to give their answers in their own words as far
{ Attempt All questions.
,/ The ligures. in the margin indicate Full Marks'
{ Assume suitable data if necessarY.

1. a) Why Operating system is termed as virtual machine? Briefly mention the function
of
Operating system. t5l

b) What is System Call? ExPlain in brief about the given architecture of operating
system. [2+3]

i) Monolithic Architecture
ii) Virtual Machine
process
Z. a) Define process. Describe the various states of process. How significant is the
l+2+2)
hierarchy? t

b) Make a schedule as per Rate Monotonic (RM) algorithm for the following set of real
time tasks: tsl
Task, T Period, P Execution time, E Phase,O
Tr 4 I 0
Tz 5 2 0
Tg 20 5 0

3. Define race condition. What are the requirements of mutual exclusion? Solve producer
consumer problem using sernaphore and mess ge passing. 12+2+61

4. Under what cirsumstances do page fault occur? Consider the following

page referen_ce
3, 4, 2, l, 5, 6, 2, 3,-7,-6, 3, 2, l, 2,3, 6 how many page faults would occur for
string: !, 2,'replacement,
the inU FIFO replacement and optimal. replacement algorithms by
assuming three frames? RemembJr all frames are initially empty, so your first unique
;"*;1 all cost one fault each. [4+6]

5. Suppose a disk drive with 200 cylinders numbered from 0 to 199. The drive is currently
**irrg arequest at 53. The queue of pending request is 98, 183, 37,122,L4, 124,65,67.
Staning from the current head position, Calculate total head movement (in cylinder) that
the disk ann moves to satis$ all the pending request for FCFS, SSF and SCAN disk
scheduling algorithm. t6l
6. what is Rile Attribute? write the difference between Single level directory sYstem and
Hierarchial directory system. Explain how operating system manages free blocks of
Secondary storage. [1+3+6]

7. List fow essential conditions for deadlock. Explain each of them briefly. What would be
v system) to prevent the deadlock? How deadlock is recovered?
necessary (in operating
Explain. ' [10]

8. Write short notes on: [3'5xa]

i) Protection Domain
ii) Cryptography
iii) System administration
t
43 TRIBHUVAN UNIVERSITY
INSTI]UTE OF ENGINEERING
Examination Control Division
2013 Bhadra

as practicable'
,/ candidates af,e required-to give their answers in their own words as far
{ Attempt All questions.
,/ figures in the margin indicate Full
The hI-arks-.
,/ A,ssume suitable data if necessary'

Explain' \\thy should the

l. a) what ar.e the primary purposes of an operating system? [3+21
operating system prevent users fiom acr essing the botlt
sector?

b) Explain in brief any four types of OS'

tsl

2 Assume the system having two processorsof same configuration, schedule the following
set of processes according to preemptive priority and round
robin algorithm (Time
&;d-:1tft calculate average waiting time and average turnaround time. [5+5]

Process Arrive Time CPU Time (ms priority

A 0 t2 I
B 2 8 2
C 5 7 4
n n
D J 9 J

E 4 6 2

F 8 5 I

G 7 7 3

H 3 4 4
I + 2 J

to execute critical
Explain critical section problem. why is it important for a thread a
J. a)
t5l
section as quickly as Possible?
b) Define Sernaphore and explain the major operations in semaphore including
pseudocod-.
' t5l
gical address is rnapped to
4. a) Differentiate compaction and Coalescing
physical address by Paging Technique? E e example' [2+3i

b) With alr examPle, show that FIFO page replacement algorithm suffers from Belady's
anomaly" \\4rat is thrashing? [3+2]

5. Briefly mention the structured VO software with suitable diagram. ComPare the
q.ith SSTF t6l
throughput (overall performance) of scAN
6. a) In rvhat ways is file system management similar to virtual memory management?
What are the advantages and disadvantages of a contiguous file allocation
scheme?

Whish file organization technique is most appropriate for tape storage? Why? [3+3]

b) List the file system performance indicators with brief explanation- t4l
h 7 . What is the difference between deadlock and indefinite postponement? Consider a system
with 5 concurrent processes (P0,P1,P2,P3,P4) and 4 resource types (R0,RI,R2,R3). The
number of instances of each resource type in the system are 6,4,4,2 respectively.
Allocation table and Maximun claim table are as follows: [3+71

RO RI R2 R3 RO RI R2 R3
PO L 0 I I PO 3 2 I I
PI I I 0 0 PI I 2 0 2
P2 t 1 0 0 P2 I I 2 0
P3 1 0 I '0 P3 3 2 I 0
P4 0 1 0 I P4t 2 I 0 I
Allocation Maximum claim

Is the state safe? If so, show the safe execution of the processes.
8. Write short notes on: [3.5xa]
D Duties and responsibilities of system administration
ii) Tlpes of secr:rity Attack
iii) Principle of VO Software
iv) TINIX file systern
 43 TRIBHUVAN UNIVERSITY Exam. Regular
TNSTITUTE OF ENGINEERING Level BE Full Marks 80

Examination Control Division Programme BCT PassMarks 32

2072 Ashwin Year lPart m/II Time 3 hrs.

Subiect: System (CT6s6)

,/ Candidates are required to give their answers in their own words as far as practicable.
r' Attempt All questions.
'/ Thefigures in the margin indicate Full Marks.
/ Assume suitable data if necessary.

l. a) Explain the Virtual Machine Structure. What are the benefits over other operating
system structure? 12+21
b) What is operating system? Briefly explain the function of operating system u+41
2. a) Differentiate between process and thread. Explain the advantages of multithreading. l2+2)
b) Schedule the following setof processes according to HRRN and Round Robin
algorithm (Time quantum:4) and calculate average waiting time and average
turnaround time. tsl
Process Anival Time CPU Time (ms)
A 0 l2
B 2 8
C 5 7
D 10 9

3. What is TSL instruction? Why it is used? Sglve producer-consumer problem using _

monitors. Il+2+71-
4. Define page fault and demand paging. Consider a paged memory system with eight pages
of 8KB page size each and 16 page frames in memory. Using the given page table,
compute the physical address for the address 18325. [3+6]
7 10
I 6 4
5 0
4 7
a
J l3
2 11
I l4
0 5

5. What is file system layout? Explain how operating system manages free blocks of
secondary storage. 13+71

6. What is disc scheduling? Explain details about the device independent I/O software with
example. [3+6]
7. What is deadloc[<] Explain the essential condition for deadlock. How you detect
deadlock? Explairf with example. 12+4+41
8. Explain the types of attacks. Explai4, how can you implement security and protection on
all components of a system. [3+6]
g. What is system administration? How is a special user different from a general user?
Explain. t2+31
* *,F

I
 I -j.-q

rd:ta
43 TRIBHT'VAN TJNIVERSITY Exam. llegullr'/ liacli
INSTITU'TE OF ENGTNEERING Level BE Full Marks 80
Examination Control Division Programme BCT Pass Marks 32
2071 Bhadra Year / Part III / II Time 3 hrs.

Subiect: System (CT656)

r' Candidates are requirod to give their answers in their own words as far as practicable.
r' Affempt All questions.
{ Thefrgqres in the margin indicate Full Murkt.
{ Assume suitable data if necessary.

1. What is the role of supervise call in an operating system? Write down the major
differences between following tlpes of operating system. [2+8J
a) Batch System
b) InteractiveSystem
c) Real Time System
d) Time Sharing System
2. Define Context Switching. Discuss S-state model of process. Schedule the following set
of prccess according to multilevel feedback queue scheduling algorithm and compute
AWTandATAT. t2+3+51
Process P1 P2 P3 P4
ArrivalTime 0 t2 25 32
CPU Burst (rns) 25 l8 4 l0
Assume that there are three ready queues Ql, Q2 and Q3. The CPU time slice for Ql and
Q2 is 5 ms and l0 ms rrspectively and processes arescheduled on FCFS basis in Q3.
3. Define race condition with example. Explain Peterson's Algorithm. [3+7]
4. Differentiate compaction and coalescing techniques. How logical address is mapped to
real physical address by paging technique? Explain with suitable example. What is the
role of TLB? 14+4+21
5. Describe different file allocation methods. Explain free disk space management with
example? [6+4]
6. Consider a system with 5 processes Ps through Pl and three resources types A, B, C.
Resources types A has 7 instances, B has 2 and C has 6 instances. Suppose at t0 tirne wc
have following state: [0]
Allocation Request Available
Proc,ess .,C
A B A B c A B c
PO 0 I 0 0 0 0
PI 2 0 0 2 0 2 000
P2 3 0 3 0 0 0
P3 L I I I 0 0
P4 0 0 2 0 0 2

a) Is the given system in deadlock state?

b) Suppose P2 makes an additional request (0, 0, l) what will be the effect of this request
to the system?
7. A disk with 1000 cylinders, numbered 0 to 999, compute the number of tracks the disk
arrn must move to satisff all the requests in the disk queue. Assume the last request
serviced was at track 345 and the head is moving towards track 0 (zerc). The queue in
FIFO order contains request fbr the following fracks: U0]
123, 87 4, lige, ql s, 105, 37 6
,,;41

Perform the iomputation for the following scheduling algorithms:

a) FIFO
b) ssrF
c) SCAN
8. Write short notes on: [5+5]
a) Types of network security attack
b) Duties and responsibilities of system administrator
+**
)/
t

4I TRIBHUVANUNryERSITY Exam. Old Back (?.065 & EarlierBatch)

INSTITUTE OF ENGINEERING Level BE Full Marla 80
Examination Control Division Programme BCT Pass Marla 32
2070 Magh Year / Part m/II Time 3 hrs.

Subject: - Operating System (EG6S2CT)

r' Candidates are required to give their answers in their own words as far as practicable.
t ,/ Attempt All questions.
r' Thefigures tn the margin indicate Full Marks.
y' Assume suitable data if necessary.

1. What do you understand by firmware? Can you relate with operating system? Are there
any linkages among hardware, software, firmware and operating system? [0]
2. What makes the message passing IPC as one among the best methods of IPC
implementation? Explain with pseudo0code details. tlOl
3. Prepare a comparative note on the fixed and variable partition multiprogramming
management.
techniques for neal memory tl0l
4. a) What is paging? How does it work? t3I
b) Explain the diffe,rences in the degree to which (i) First Come First Serve (ii) Round
Robin and (iii) Multi level gueues, scheduling algorithms discriminate in favor of
shortprocesses. tT
5. Consider a system consisting of m (€source of the mure t5rye, being shared by n
processes. Resources can be requestd and released by processc only one at a time. Show
that the system is deadlock free if the following two conditionshold: Il0l
a) The mar<imurr need of each pnocess is betneen I and m tesiounces.
b) The sum of all maximumneeds is less than m * n.
6. a) What is a device controller? What is a device driver? How do they relieve
programmer? Explainwith an example of any I/O device. t7l
b) Explain the implementation of process. t3l
7. What is bootstrapping? Explain the working principle of atlpical assembler. What are the
program?
different records present wittrin object tl0l
8. Compare the followings: l2.5x4l
a) Semaphore Vs Monitor
b) Latency time Vs seek time
c) Coalescing Vs Compaction
d) Real Memory Vs Virtual memory
***
 43 TRIBHUVAN I.JNTVERSITY Exam. Nerr lJack (206(r & f.atcr llltch)
INSTITUTE OF ENGINEERING Level BE Full Marks 80
Examination Control Division Programme BCT PassMarks 32
2070 Magh Year / Part mitI Time 3 hrs.

Subject: System Gr6s6)

r' Candidates are required to give their answers in their own words as far as practicable.
r' Afiempt All questions.
r' Thefigures in the margin indicate Full Marks.
y' Assume suitable data if necessary.

l. Explain operating system as an extended machine? Distinguish between Kernel and

Micro-Kemel. Explain the purpose of system call. [2+3+3]
2. For the process listed in following table, what is the average turnaround time using: tl0l
(a) FCFS (b) RR (quantum=4) (c) SJF (d) SRT (e) HRRN

Process Arrival Time (ms) Processing Time (ms)

A 0 3
B 2 6
C 4 4
D 6 5
E 8 2

3. Define critical section and mutual exclusion with respect to multiple-process system.
Solve producer and consumer problem using semaphore [3+5]
4. What is page fault? Consider the following page reference string: 1,2, 3, 4,2, l, 5, 6,2,
1,2,3,7,6,3,2,1,2,3, 6. How many page faults would occur for the FIFO, Optimal,
LFU and LRU replacemefit algorithms having five frarn'eS? Remember all frarnes arO
initially empty, so your first unique page will cost one fault each. [2+8]
5. What are the different methods for allocating disk space for file? Explain free space
management techniques. 12+61
6. Suppose that a disk drive has 100 cylinders, numbered 0 to 99. The drive is currently
serving a request at cylinder 43, and previous request was at cylinder 25. The queue of
pending request, in FIFO order is: tl0]
86, 7 0, 13, 7 4, 48, 9, 22, 50, 30
Starting from the current head position, what is the total distance (in cylinders) that the
disk arm moves to satisfr all pending requests for each of the following disk scheduling
algorithms?
a) First-come, First served
b) Shortest Seek Time First
c) Look
d) C-Scan
e) Scan
7. What is deadlock? How it occurs? Explain various deadlock avoidance methods with
examples. t2+2+61
8. What are the roles of system administrators for an organization? How can you increase
operating system performance if you are selected as a system administrator? 14+41
9. Write short notes on: (any two) 14+41
a) Information security model
b) Security attack
{.**
 46 TRIBHUVAI.I LTNIVERSITY Exam. .l{cgullr (2(}(r(r ct [-ale r llalclt)
INSTITUTE OF ENGINEERING LeVel BE Full Marks 80

Examination Control Division Programme BCT Pass Marlc 32

2069 Bhadra Year /Part m/n Time 3 hrs.

Subject: - Operating System (cr6s6)

{ Candidates are required to give their answers in their own words as far as practicable.
{ AttemptAll questions
r' The figses in the margin indicate Full Marhs.
{ Assume suitable data ifnecessary.

l. How operating system creates abstraction? Explain with reference to OS as an oxtended

machine. Define system call and explain its working mechanisrn with suitable exampte. [5+5]
2.. WhetisProcess.Connol.Block? ExplainschedBlingflgorithms"in.interactive system.
{2+-{} .
I 3. What are Orrditionsto get rrrunral exclusion? Define semaphofti anffsotie;ffiffoducer-
t,
consumerproblem using semaphore t2{{]
4. What is page fault? Assume that a virnral memory of size 64K is mapped to physical memory
of 32K with page frame 4K. Initially, pages are mapped as: 0,1,2,3,4,5,9,11 correspond to
2,1,6,0,4,3,5,7 respectively. Calculate outgoing physical address for incoming virtual address
204S2with necessary rtrapping diagrams. [2+8]
5. Howfile system can be implemented wing linked list? Explain impact of block size selection
on dcarate.and disk space utilization wittr necessary diagram and illustration. [4+6J
6. Explain working mechanism ofdevice driver? Supposc a disk drive with 200 cylinderq
numbered from 0 to t99. The drive is cunently serving a request at cylinder 53. The queue of
pending requests is: 98, 183, 37, 122,14,124,65,67. Starting from the curent head position,
calculate total distances (in cylinders) that the disk arm moves to satisf, all a pending requests
for FCFS, SSF and SCAN disk scheduling algorithms. t4+6I
7. Write four conditions for deadlock. A system has four processes Pl, P2, P3, P4 and three
resourees Rl, R2, R3 with existing $esource B= (15 9 5). After following allocation, resource
available becomes A = (3 2 0). Use BankeCs algorithm to test whether the given state is safe
or not If it is safe state, show the sequence of execution of processes. [2+8]
Allocation Maxirnum Need
RI:""R2 R3-' RI R2 R3 RI R2 R3
PI 301 322 o 2l
Y2 541 682 l4l
P3 220 3 24 1.0 4
P4 2r 3 423 210
8. Explain protection domain and access control list (ACL). Suppose you are ernployed as a
system ud*inirtrutor of CIT, Pulchowk campus. Detail your roles and also suggest the blowing
ideas to maintain seoure and reliable system. [5+5]
***

I
 43 TRIBHUVAN I.JNIVERSITY Exam. llcgul:rr'
INSTITUTE OF ENGINEERING Level BE Full Marks 80

Examination Control Division Programme BCT Pass Marks 32

2070 Bhadra Year / Part m/il Time 3 hrs.

S (cr6s6)
/ Candidates are required to give their answers in their own words as far as practicable.
{ Attempt 4llquestions.
r' The/igures in the margin tndicate Full Mar*s.
r' Assume suitable data if necessary.

l. List the essential properties for the Batch-oriented and Interactive operating system. For
each of the following application which system (Batch or Interactive) is more suitable?
State the reason. [4+6]
a) Word Processing
b) Generating monthly bank statements
c) Computing pi to million decimal places
d) A flight simulator
e) Generating mark statement by University
D Data acquisition from temperature sensor
2. Consider the following set of process with the length of the CPU burst time given in
millisecond. 14+41
Process PI P2 P3 P4 P5
Burst time l0 I 2 I 2
; Prioritv 3 I 3 4 2
Assume the processes arrived in the order Pl, P2,P3, P4 and P5 all at time 0, priority I as
highest and 4 as lowest.
a) Draw the Gantt chan for FCFS, SJF, Priority and Round Robin lQuantum:2)
b) Which algorithm results in the maximum average waiting time?
3. What is race condition and critical section problem? Explain all possible approaches to
handle the situation'\rhile one process is busy updating shared memory, no other process
will enter its critical section and cause trouble". [2+8]
4. Calculate Hit and Faults using various page replacement algorithm policies. (FIFO, LRU,
Optimal) for the following page sequence (The page frame size is 3) 12+61
2 3 5 4 2 5 7 3 8'7
5. Explain file system layout in detail. What are the major differences between file system
interfaces and file system implementation? [6+4J
6. What are the disadvantages of progranrmed llo? Explained about DMA. What are the
functions of device independent I/O software? t2+2+41
7. What is deadlock? State the necessary conditions for deadlock to occur. Give reason, why
all conditions are necessary. [10]
8. Explain the domain-object and ACL. How these mechanisms are implemented for
security? 14+41
9. Write short notes:
a) Roles of System Administration t4l
b) Shell Scripts t4I
 46 TRIBHUVAN IJNIVERSITY Exam. -llegullr' (21)(r6 ct l-rttu' llrrtch)
\ BE FuIl Marks 80
INSTITUTE OF ENGINEERING Level
Examination Control Division Programme BCT Pass lVlarks 32

2069 Bhadra Year / Part m/u Time 3 hrs.

Subiect: - Operating System Gf656)

{ Candidates are required to give their answers in their own words as far as practicable.
{ Attempt All questions.
r' Thefigwes in the margin indicate Full Marks.
{ Assume suitable data if necessary.

l. How operating system creates ab$raction? Explain with reference to OS as an cxtended

machine. Define systcm call and explain its working mechanism with suitable example. [5+5]
2.. Whatis Pnoee.ss.ConfiplBlock? Explainschsdr,r.ling"a[prithms.in irueractive system. {2+{}
3. liltrat are crinditiorts to get muttral exclusion? Define semaphore anilisohe,ffiBfitoducer-
oonsumerproblem using semaphore t2{{l
4. What is page fault? Assume that a virtual memory of size 64K is mapped to physicd memory
of 32K with page frame 4K. Initially, pages are mapped as: 0,1,2,3,4,5,9,11 conespond to
2,1,6,0,4,3,5,7 respectively. Calculate outgoing physical address for incoming virtual address
2M82 with necessary mapping diagrams. [2+8J
5. How {ile system can be implernented using linked list? Explain impact ofblock size selection
on data rate and disk space utilization with necessary diagram and illustration. t4+61
6. Explain working mechanism of device driver? Suppose a disk drive with 200 cylinders,
numbered from 0 to 199. The drive is currently serving a request at cylinder 53. Thc queue of
pending rcqtrests is: 98, 183, 37, 122,14,124,65,67. Starting from the cure,rt head position,
calculatc total distances (in cylinders) that the disk arm moves to satisS all a pending requests
for FCFS, SSF and SCAN disk scheduling algorithms. [4+6I
7. Write four conditions for deadlock. A system has four processes Pl,P2, P3, P4 and three
resources Rl, R2, R3 with existing lesource 6= (15 9 5). After following allocation, rcsource
available becomes A = (3 2 0). Use BankeCs algorithm to test whether the given state is safe
or not. If it is safe state, show the sequmce of execution ofprccesses. [2+8]
Allocation Maximum Need
RITR2 R3 RI R2 R3 RI R2 R.3
PI 3 0l 3 22 0 2l
Y2 541 6 8 2 t 4l
P3 220 324 104
P4 213 423 210
8. Explain protection domain and access oontrol list (ACL). Suppose you art anployed as a
system adminisrator of CIT, Pulchowk campus. Detail your roles and also suggest ttre blowing
system.
ideas to maintain secure and reliable [5+5J
*rt*
 I t-

.r

4l LJNIVERSITY '\'.
TRIBHWAN Exam. Reqular / Back
INSTITUTE OF ENGINEERING Level BE Full Marks 80
Examination Control Division Programme BCT Pass Marks 32
2068 Bhadra Year / Part m/u Time 3 hrs.

Subiect: - System
r' Candidates are required to give their answers in their own words as far as practicable.
r' Afiempt All questions.
r' Thefigures tn the margin indicate Full Marks.
,/ Assume suitable data if necessary.

l. What are the functions of an operating sy-stem? Explain about microkemel. [3+5]
2. What is a monitor? Solve dining philosopher man's problem using semaphore. t8l
3. Describe the difference between preemptive and non- preemptive scheduling algorithm.
Explain about scheduling in real time. 14+41

4. A system that uses the Banker's Algorithm deadlock avoidance has five processes (1,2,
3,4 and 5) and four tlpes of resources (A, B, C and D). There are multiple resources of
each t1pe. Is the following state safe or not? If it is, show how the processes can
complete. If not, show how they can deadlock. t8]
Current loan Max need Current claim
Process
ABCD ABCD ABCD
I I 1020 3242 2222
2 03t2 35t2 3200
3 2451 2775 0324
4 3006 5508 2502
5 4213 621 4 2001
Resources Available Total Resources
ABCD ABCD
3401 1313913
5. What is a critical reason and race condition? What are the limitation oi optimal page
*
6. What is segmentation? Suppose a machine has 48 bit virtual addresses and32 bit physical
address. [3+5]
a) If pages are 4KB, How many entries are in the page table?
b) Suppose the same slatem has a TLB (Translation Look a side buffer) with 32 entries.
Further.more suppose that a program contains instructions that fit into one page and it
sequentially reads long integer elements from an array that spans thousands of pages.
How effective will the TLB for this case?
7. What is a file system layout? Explain about I- Node and file system backup. [3+5]
8. What is a interleaving? Consider a Winchester - style hard disc with 100 cylinders, four
double - sided platters and 25 sectors per track. The following is the (time - ordered)
sequence ofrequests for disc sectors: {3518, 1846, 8924,6672,1590, 4126,107,9750,
158,6621,446,11) The disc arm is currently at cylinder 10, moving towards 100. For
each of SSTF, SCAII and C'SCAN, give the order in which the above requests would be
12+6)
g. What is a trap door? Explain in firewalls and access control lists. 12+61

10. What are the goals of UNIX? Explain about NFS protocol and draw the structure of NFS. 12+61
*** -. .
 4I TRIBHWANT'NIVERSITY Exam. Resular / Back
INSTITUTE OF ENGINEERING Level BE Full Marks 80
Examination Control Division Programme BCT PassMarks 32
2067 Mangsir Year / Part m/II Time 3 hrs.

Subiect: - System
'/ Candidates ire required to give their answers in their own words as far as practicable.
,/ Attempt All questions.
'/ Thefi,gures in the margin indicate Full Marks.
,/ Assume surtable data if necessary.

1; How an operating system acts as a virtual machine? What are the different structures of
an operating system? Explain in detail about context switching. 12+2+4)
2. What is the diffi:rence between process and thread? Solve Dining philosophers problem
using semaphores. [3+5]
3. What is dispatcher? Schedule the following process applyrng highest response ratio hext
scheduling algorithm. Assume P1 is the first process [1+7]
Process No Pr Pz Pr Pt
Arrival time (sec) 1 2 4 15
Service time (sec) 10 30 20 20
If P+ need 2 second of service time does the sequence of schedule change?
4. Explain the algorithm for detecting dead lock for one resource of each type. Consider that
the system consists of m resources of same type being shared by n process each of which
need at most two resource. Explain whether the system is deadlock tree or not? t8]
5, What are the requirements of long term information storage? What is I- node? Draw the
block diagram of virtual file system. t2+3+3)
6. What is paging? Consider a swapping system in which memory consists of the following
hole size in memory order 10KB, 4KB,20KB, 18KB,7KB, 9KB,l2I(3 and 15K8.
Which hole is taken for successive segment request of 12+6)
a) 12KB
b) 10KB
c) 9KB for first fit, next fit and best fit placement strategies.
7. What is the disadvantage of programmed VO? Explain about DMA. What are the
functions of device independent VO sofhVare? 12+4+21

8. What are the goals of Unix system? Draw the structure of Linux kernel. 12+61

9. structure.
What is firewall? Explain about device driver [3+5]
10. Explain in detail about any one distribution of Linux system t8l
**:1.

-Fr- tr -:

{: *'t -

-..&::f"; _
,
,,:: 1.. !nffiSidr!'i.i*g-'-- "' {1.: ,.-,_
 .' i' ; ',i
":: t ' .,;:'

, r, r .

4l'.
,

TRIBHWeNUrtrrynSrry
INSTITUTE OF LGVGI, , BE. I Fdt Mrrkr'
Division Progremme BCT Pess Mrrks 32
2066'l Yeer/Pert Itr/tr Erl 3 hrs.

Subied: - Operating System

r' Candidaes are required to gve their answers in their own words as far as practicable.
r' Anempt All questiotts.
r' /llquestions carry equal marlcs.
/ Assume suitable data if necessory.

l. What features does an operating system cxpose on top of the hardware to enhance user
experience? Explain.
2. Disabling intemrpts may help avoid race conditions. Explain its drawbacks as well.
3. Give an algorithm for deadlock detection for a sybtem with multiple resources of the same
kind.
4. What is the major drawback of implementing file system with linked list allocation using
a table in memory? Give an implementation scheme that removes this drawback.

5. Multiprogramming systems have a considerable overhead because of process switching.

rDoes multiprogramming indeed optimize CPU utilization? Illustrate with a genuine
example.
6. Differentiate between paging and segmentation.
7. Explain in detail about the device independent VO softrvare. !

8. What are protection domains? Compare protection domains with access control lists.
***

kL
 .I':i";it3i.' ii ;:' .i ,r'-;;if;.! -;;:;i .'-"|.'.--:#il--:'-'
,I:. ..: '' .- rl -r-!tsqr:ryr: '' '
:i.r :;'
fi.'r"'"*.
lI
' -'.)...:
:.ii.: :i+.1'L;!i';-Fs..-r..i' :

.r. i.+-
,:71 . i.i : .
r' - .,.

$f 'l 4I TRIBHWA}.I I.'NIVERSITY Erqm.'; ' :' Regllar/B!-ek:.- j ;';..;i :rlT

it D..ISTITUTE OF ENIGINEERING Level. BE FultMarki t.
F xamination C-ori'trol Divisi o n Progrqmme BCT Psss Marl6' 32 I.
;
{
"il
j_
it : -' legr /P8rt frlr1' Tlme 3 hrs.
l-
i.
./ Candidates ar6 required to give their.arswers in their bwn wgrds as far as practicable.
Attempt Att questions. : :

e.u qiesi[izs carry equal marks. '

T"i*, siliabte iatb' .ifnecesstary. . '

l. What fea'tures does an operating system expose oniop.of the hardware to enhance user
experience? Explain'.
2. Disabiing intemrpts may help avoid race conditions. Explain its drawbackS as well.
3. Give an algorithm for deadlock detection for a sybtem with mtltiple resources bf the same

4. What is ihe major drawback bf implementing file. system with linl<ed list allocation using
a table in memory? Give an irnplementation scheme that rbmoves thi's drawback.
'
5. Mutiiprogramming'systems have a considerable overhead because of process switching.
r Does multiprogramming indee! optirpize CPU utilization? Illustrate with . a genuine'
. example. . '
6. Differentiate betweenpaging.and segmentation.
7. Expiain in detail about the device independent UO softrvare
8. What are protection domains? Coqrparg protection domains with access control lists.
*** 1.:.

-,,

.,4
-a .-
 '!:."

STI E ENGINEERING 'Level'":" BE :'..#i#-Ii FulI lvlarks'-t i-;$Q :u.;r'-+r.

...lte..:.,:-. _' ...r{i..'-.,. o ..i.r.;
-rilL-,.\
Q tag I -.S
d.qiE-{tt on ail Progr-amme .B,EL.r*lEi'j5* L..--Pasd l*'Iarits,
-.-r.E+-a'ad
f.?'r'::r:ii:.'r;-
9i;i.-*$ild:s:rJ
2A65 Chaitra Year/Part lm/il Tirne 3. hrs-

.rt
,.. '!?..';4.4,r-.
',s: i,rii..r. .1

Canciidir,tes to sllve answers in their own lvords as far as practicable.

,li,".'+- ri-r-l;'-'
,/-.. ttitiiipi'Att '..iJ*'-
-,Ldjfur:liFr.. ..
?'hc figtres in the ffinigttl FqII Marks.

[1+7]
?. Dcscribe the top-down view and bottom-up view of operating system. -:..--+.. - t8I -..----.
':*"-3.*1,i/hat'?Jr!*j;6'froEi1deifrast'd -bf '=ffiltisiod- and -critical 'sectiori? *nxpHiasrr6{f-+4+.i*?r!rt'
t n,u plg. i t-trf so lv e.th e dgc el cgnsum.er problem. .' ....ir;pir,,;.;'-- r.-. --,-..-. --

,,. I:::L:^*l $ .!9, .gp r.i-.j *iu.5r:.'1

1.2+6J
" " ...'
.

4. Wrat is processor scheduling?. Explain how Shortest Job First (SJI) and mr{tilevei ..'.-ia'
' ' queuss rvork? Which do vou thick is better anrl whv?
a'.r3^'-'rrft1-Jr..i.,':?j'r..r..!j;+($L:+r.r.ar'.2r,,'1.;-.1,..',.-'i=,'1qpff.t*r.',.'*...-i..f..;.1 ..1
' :--',
Er
'

5. Fiorv can you eliminate waste in variable partltion multiprogramming? Also explain the
drar.,,backs cf such methocls. ,[r++Il]
call you manage n:relnory
7. lVhat are for handling? Explain any two techniques for prevcnting
deadlocl<. [2+5]
8. 'Explain the rvorkiug principles
...".. --.tr.,-.. i:-t..r.{lyi ..
ofI generd.l device driver. ., . ...-. ;
.:...fr
,'''- [6]
.-, 9. . DiiTcrentiate between absolute loader. : '' .r,i.'*i.isiih.-/arapf --lqll.:- ',
[6] -""
M*i- o to I 99.' AidqGs-fL-ffiin*tb*iEffi
cornc in for cylinders in the ord.erjof 87 , 146, 90, 99; 183, 15, 48, 19. Which of the disk
,ni scfra<lulingloigodth*t among FCFS, SSF and'SCaN is Uest'for. the gtyen set of
calculation.
rctiuesis? Justily with "' t8i

--.. -.1
l..\['rite short notes on: (any. two) .-*,..--...-.. -",*. - lZx..ZJ .

a) l-nc',tlcs t,
.

i:)' Cl4inder skew and interleaving in disk

c) Leist Recently Used (LRII)'"t:replacement : : '

: - +*d< --
-f.
..--.-J____4e..!,,;...:i.:..r.:.__-::...:i-#.'?. ...r:i . t 'i'
 41 TzuBHUVAN UM\TERSITY Exam. Back
INSTITUTE OF E}.IGINEERiI\IG LeveI BE FuII Marks ',1 :80
.BCT
Examination Control Division Programme PassMarks 32
. 2065 Kartik Year / Part m/tr Time 3 hrs.

'/ Candidates are required to give their answers in their own words as far as practiqble.
. .:. : -;.; ,.t, -Attempl.-4!!,Questtoni. _
1,;
.,,.,_ .,:. j , :._,:.j.,i--:.1,.,,.".:-:.j,.;:r:-
.1 ,
.. ,/ fllquestions carry iiqual markS. 1..

,/ Assume suttable data if necessary. .

1. What is an operating system? Can you justify that an operating system acts as a resource
manager?
2. Differentiate between a process.and a thread. What is a process control block? Explain.
3. What is semaphore? What is its use in inter-process communication? Explain. with
'
a
suitable example.
. , 4. I/hat- iq. a .
deadlock? How can. a system recover from deadlock? List all possible
alternativeq and also state the problems ttteywould induce. " ' r ':

5. What is virrual memqry? How is it ppssibie to work on memory spaoe larger than the
dctual available physical memory? Assurne a virnral memory configuration with a page
frame of size 2K, virtual address space of size 32kand physical address space of 16K.
j.iH-
With a page mapping of your choice determine the actual physical lddress corresponding ,l {.. .

to the virtual address 0573H.

: ;i -{F_t,

6. What are the different tlpes of UO software layers? What are the tasks of device j:id
5_:it
,**li
independent VO softrvare? Explain : :
,tF:
.ri$
7. How does it erimrnate the n1br3m in rinked rist arlocatiol?
#S,ffl:9,ffii?:Jt1";
'.
. 8. What is securiry? Whatarethepossible attacks tpmiosiaetheqnstem?., 1,. .,,,.'. ,
t.
i 9. Differentiate between an absolute and a relocation loader. E-xplain in brief about the boot-
strap loader
i 10. Write short notes on any two:
a) Real time operating system
I b) Login spoofing
c) .Kerrtel
*rl.*