pera ng ys em
ues on
an
PART- A Questions
1. G iven a system ystem with n proc esses, esses, ho ho w many ma ny pos po ssible wa ys c a n those those proc esses esses be sched sc hedul uled ed.. Give G ive a formul formula a in terms terms of n. 2. In whic whic h sta state te is a p ro c e ss in if it has ha s the C PU? 3. Consider a logical address space of eight pages of 1024 words each, map ped pe d onto a physic physica a l memory o f 32 fra fra mes. mes. a . Ho Ho w many ma ny bits bits a re there in the the logic log ica a l a d dress dress? b . Ho Ho w many ma ny bits a re ther the re in the physic physica a l a d d ress? ess? 4. C onsider onsider the the follow following ing seg segment ment table: tab le: Segment eg ment Ba se Length eng th 0 219 600 1 2300 14 2 90 100 3 1327 580 4 1952 96 What a re the phys p hysica ica l add ad d resses esses for the fol fo llowing logic log ica a l addres ad dress ses? a . 0,430 0,430 b. b . 2,500 2,500 5. G ive an a n exa exa mple of an ap plic plic a tion tion in in whic whic h data da ta in a file file shoul should d be be a c c essed essed in the follow following ing order: a . Sequentiall eq uentially y b. Ra ndoml ndo mly y 6. Why must must the bit map ma p for fo r file file alloca alloc a tio tio n be kept kep t on ma ma ss stora tora ge , ra ther than in main memory me mory? ? 7. A _____ __ ___ sema semapho phorre is such uc h tha thatt it’s it’s integ integer er valu va lue e c a n ra ra nge over o ver a n unrest unrestrricted icte d do main 8. When is is a pr p roc ess sa id to to be b e in a c ritica itica l sec tio tio n? 9. It is not pos po ssible to to have ha ve a dea d ea dloc k involvi involving ng onl o nly y o ne singl single e pr p roc ess. ess. Whi Whic ch a mong the 4 nec essa essa ry and suffic uffic ient cond c ondit itions ions is viola violated ted? ? 10. 10. What Wha t is is the c o mmand mmand interpreter in in Unix Unix c a lle lle d ? 11. So ftware may tr trigger igge r a nd inter interrrupt exec exec uting uting a spec ial o p eratio eratio n c a lled lled __________. __________. 12. A c o mmon rep reprresentation for a disc disc uss ussion of pr p roc ess sc hedul hed ulin ing g is a ______. _____ _. 13. What is is a c a sc a ding termi termina nati tio o n? 14. 14.
What Wha t is a se rial sc hedule? hed ule?
15. 15.
Define sa fe state? ta te?
16.
________ne ____ ____never ver swap wa p s a pa p a ge into into memory unless unless that p a ge will will b e needed.
Karunya University | Dept. of Information Technology
1
pera ng ys em
ues on
an
17. 17.
What Wha t a re the p ro p erties erties o f immutab immutab le file? file?
18.
_________ ____ _____k knows now s a bo ut files files a nd their their logic a l bloc ks a s we well ll a s p hysic hysica al blocks.
19. 19.
What Wha t is the use use o f c ontroller? ontroller?
20. 20.
What Wha t is the us use of the the asymmetr asymmetric ic multi multi proc essing? essing?
21.
Whic Whic h device de vice is is used used to c ommunic ommunic a tio tio n in small a rea networ netwo rk?
22.
What is threa threa d c a nc ellation? ellation?
23.
What is dispa dispa tch tc h latenc y?
24. 24.
What Wha t is a virtua virtuall a d d ress?
25.
M ention a ny two tec hnique hniques s used used to solve the external external fra fra gmentation. gme ntation.
26.
List ist the two broad broa d c a tegor tego ries of pa ge replac ep lac ement eme nt a lgor lgo rithms ithms..
27.
Spec pe c ify a ny two type type s of file file a c c ess methods method s.
28.
M ention a ny two type types s o f veloc ity ity a re used used in disk disk tra tra c k a c c ess ess mechanisms
29.
List ist the two fac fa c tors tors which whic h dec de c ide the the efficienc effic iency y o f the the use use of d isk spa c e.
30.
What Wha t is the main a dva ntage ntag e o f multi multip p ro gramming? gramming?
31. 31.
The interfac interfac e betwe be tween en the the ope op e ra ting ting sys system tem a nd the user user sitti itting ng at a termi termina nall is is c a lled a s __________ _____ _______. __.
32.
What does do es a proc proc ess ess c ontrol ontrol bloc k c ontain?
33.
O per pe ra ting ting Sys Systems tems p rovide a mea ns for c oo per pe ra ting ting proc proc esses esses to c ommunica ommunica te with with ea c h other thr thro ugh ________________________.
34.
If the system ystem c a n a llo llo c a te reso eso urc urc es to ea c h proc ess in some order orde r a nd still till a void a d ea dloc k, then the sys system tem is sa id to be b e in __________ _____ ________ ___
35. 35.
M ention the synchr ync hro o niza niza tio tio n c o nstr nstruc uc ts use use d when whe n se map ma p hor ho re s a re used used incor inco rrec tly tly to to solve c ritic itica a l sec sec tion tion pr p roblem. ob lem.
36.
A proc ess is __________ ____ _______ _ if it is spending pe nding more more time time paging pa ging tha than n exec uting. uting.
37.
M ention a ny two metho methods ds imple implemented mented to manage mana ge free free spa spa c e lis listt in files files..
38.
What a re the the ma ma in fac fa c tors tors to be dea d ea lt with with respec t to disk disk sc hedul hed ulin ing? g? 2
39.
What a re the sever eve ra l a sp ec ts of disk disk manage mana gement? ment?
40. 40.
What Wha t a re the a d vanta va ntage ges s o f multiproc multiproc esso esso rs system? ystem?
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
an
17. 17.
What Wha t a re the p ro p erties erties o f immutab immutab le file? file?
18.
_________ ____ _____k knows now s a bo ut files files a nd their their logic a l bloc ks a s we well ll a s p hysic hysica al blocks.
19. 19.
What Wha t is the use use o f c ontroller? ontroller?
20. 20.
What Wha t is the us use of the the asymmetr asymmetric ic multi multi proc essing? essing?
21.
Whic Whic h device de vice is is used used to c ommunic ommunic a tio tio n in small a rea networ netwo rk?
22.
What is threa threa d c a nc ellation? ellation?
23.
What is dispa dispa tch tc h latenc y?
24. 24.
What Wha t is a virtua virtuall a d d ress?
25.
M ention a ny two tec hnique hniques s used used to solve the external external fra fra gmentation. gme ntation.
26.
List ist the two broad broa d c a tegor tego ries of pa ge replac ep lac ement eme nt a lgor lgo rithms ithms..
27.
Spec pe c ify a ny two type type s of file file a c c ess methods method s.
28.
M ention a ny two type types s o f veloc ity ity a re used used in disk disk tra tra c k a c c ess ess mechanisms
29.
List ist the two fac fa c tors tors which whic h dec de c ide the the efficienc effic iency y o f the the use use of d isk spa c e.
30.
What Wha t is the main a dva ntage ntag e o f multi multip p ro gramming? gramming?
31. 31.
The interfac interfac e betwe be tween en the the ope op e ra ting ting sys system tem a nd the user user sitti itting ng at a termi termina nall is is c a lled a s __________ _____ _______. __.
32.
What does do es a proc proc ess ess c ontrol ontrol bloc k c ontain?
33.
O per pe ra ting ting Sys Systems tems p rovide a mea ns for c oo per pe ra ting ting proc proc esses esses to c ommunica ommunica te with with ea c h other thr thro ugh ________________________.
34.
If the system ystem c a n a llo llo c a te reso eso urc urc es to ea c h proc ess in some order orde r a nd still till a void a d ea dloc k, then the sys system tem is sa id to be b e in __________ _____ ________ ___
35. 35.
M ention the synchr ync hro o niza niza tio tio n c o nstr nstruc uc ts use use d when whe n se map ma p hor ho re s a re used used incor inco rrec tly tly to to solve c ritic itica a l sec sec tion tion pr p roblem. ob lem.
36.
A proc ess is __________ ____ _______ _ if it is spending pe nding more more time time paging pa ging tha than n exec uting. uting.
37.
M ention a ny two metho methods ds imple implemented mented to manage mana ge free free spa spa c e lis listt in files files..
38.
What a re the the ma ma in fac fa c tors tors to be dea d ea lt with with respec t to disk disk sc hedul hed ulin ing? g? 2
39.
What a re the sever eve ra l a sp ec ts of disk disk manage mana gement? ment?
40. 40.
What Wha t a re the a d vanta va ntage ges s o f multiproc multiproc esso esso rs system? ystem?
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
an
41. 41.
State ta te var va rious states tate s o f a p ro c e ss.
42.
What a re the c ommon ommo n typ typ es o f thre thre a d impleme implementation? ntation?
43. 43.
What Wha t is d isp isp a tche tc herr?
44.
State the the seq sequenc uenc e of the utili utiliz za tion tion of a resour resourc c e for a proc ess ess.
45.
What d o you mean mea n b y over ove rlays? lays?
46. 46.
What Wha t is a lazy swap wa p p er?
47. 47.
State ta te the typ typ e s o f p a th names. na mes.
48.
What d oe oes s a file file c ontrol ontrol bloc k (FC (FC B) c o ntains? ntains?
49.
State three three major a ppr pp roa c hes of a lloc lloc a ting ting disk disk spa c e.
50.
_________ is is a prog progrra m that manage mana ges s the the computer c omputer hard hard war wa re.
51.
A _______ is a collec c ollecti tio o n of related ela ted infor information mation defin de fine e d by its its c rea tor. tor.
52.
A threa threa d is a ________ _____ ___ proc ess. ess.
53.
The tim time e taken for the d ispa ispa tcher tc her to stop one o ne pro pro c ess a nd start start a nother no ther running unning proc ess is known a s disp disp a tch tc h ________ ___ ______. _.
54.
M ention the four nec essa essa ry c ondit ond itions ions requi eq uirred for the oc c urr urrenc e of the deadlock.
55.
Deadloc Dea dloc ks c a n be des de sc ribed be d more more preci prec isely in terms terms of a dir direc ted gra gra ph c alled alled _______ gra gra ph.
56.
_________ ____ _____ memo memorry is a techni tec hnique que tha tha t a llow llows s the exec utio utio n of proc ess that may not be completely in memory.
57.
The user user who cr c rea ted the the file file is c a lled lled as a s ______. _____ _.
58.
________ ____ ____ conta c ontains ins inform informa a tio tio n a b out the file, file, inc inclu luding ding owner owne rship hip , per pe rmis missions and loc a tion tion o f the file file c o ntents ntents.
59.
Spec pe c ify the the thr three ee major ma jor methods method s used used for a lloc lloc a ting ting the disk disk spa c e.
60. 60.
List ist the four fo ur c o mpone mpo nents nts o f c o mputer mpute r system ystem
61.
Define C ommand omma nd Interpr Interpreter eter
62.
What a re the b enefi ene fits ts of multi multith thrrea ded de d progr prog ra mming? mming?
63.
What a re the two ba sic models mod els of Inter Inter Proc Proc ess C ommunic ommunic a tion? tion?
64.
What a re the nec ess essa ry c o nditio nditio ns o f dea de a dloc dlo c k situa ituati tion? on?
65. 65.
Define Pre Pre empti emp tive ve Kerne Kernell
Karunya University | Dept. of Information Technology
3
pera ng ys em
ues on
an
66.
Write the formula for effective acc ess time
67.
What are the benefits of slap alloc ator?
68.
List the performanc e issues of tertiary – storage
69.
Define Buffer
70.
What is a System C all?
71.
What do you mean by a C ontrol C ard?
72.
Define Socket
73.
Name the two fundamental models of inter proc ess communic ation.
74.
What do you mean by dispa tch latency?
75.
What is a transac tion?
76.
When will you say that the system is in safe state?
77.
Define pa ging
78.
What is an interrupt?
79.
Brief Belady’s Anomaly.
80.
What is mea nt by resident monitor?
81.
An operating system that is capable of allowing multiple software proc esses to run at the same time is c alled ____________.
82.
A proc ess which has just terminated but has to relinquish the resource is called____________.
83.
Define safe state.
84.
What is mea nt by external fragmentation?
85.
Who performs ga rba ge c ollec tion?
86.
The high paging ac tivity is c alled ____________.
87.
List the different acc ess methods of file system.
88.
What is mea nt by physical formatting?
89.
Define Kernel.
90.
What is layered approa c h?
91.
What is a state?
92.
Wha t is FCFS?
Karunya University | Dept. of Information Technology
4
pera ng ys em 93.
Write the Little’s formula.
94.
What do you mean by deadloc k prevention?
95.
State two levels of proc ess termination.
96.
The string of memory referenc e is called ____________.
97.
Write the two types of pa ge replac ement algorithms.
98.
What is a c ontroller?
99.
What do you mean by sec tor sparing?
100.
ues on
an
How are system calls useful?
101. What is the adva ntage of Microkernel approa ch to system de sign? 102. What information does an operating system generally need to keep abo ut running proc esses in order to execute them? 103. Assume that a system c onsists of four resources of same type, they are shared by three proc esses, eac h of which needs almost two resourc es. Show that the system is deadlock free. 104. What are monitors? 105. What is paging? 106. What do you mean by Belady’s anomaly? 107. State the use of bloc k devic e. 108.
What is the need of RAID c onc ept?
109. Write the name of any one distributed operating system. 110. Define Dual-Mo de operation. 111. Define Process. 112. What is meant by threa d? Specify the benefits of multithrea ded programming. 113. Define Dispa tch latenc y. 114. Define fragmentation and its types. 115. What is meant by thrashing? 116. What are the different types of file ac c ess methods? 117. What are the c harac teristic s of Dea dlock?
Karunya University | Dept. of Information Technology
5
pera ng ys em
ues on
an
118. Define Rotational latenc y. 119. What are the different types of disk formatting? 120.
What are the modes of operations?
121. Write any two application programs. 122. Define RMI. 123. What is throughput? 124.
What are the approac hes used to handle Critica l Sec tion?
125. How do you ensure that the dea dlocks never oc c ur? 126. Write any four file attributes. 127. What is a hash table? 128. How do c omputers access disk storage? 129. What is seek time? 130. Software may trigger an interrupt by exec uting a special operation called a _________. 131. List the main advantages of multiprocessor systems. 132. Define proc ess. 133. Mention any two properties of CPU scheduling algorithms. 134. No two proc esses are exec uting in their critical sec tions at the same time. Say True or False. 135. What is safe state? 136. Wha t is thrashing? 137. Name the file acc ess methods. 138. What is the drawback of network-attached storage systems? 139. What is a spool? 140.
What is the function of an operating system?
141. What is LAN? 142. Define proc ess. 143. What do you mea n by Turnaround time? 144.
What are the nec essary conditions for a deadloc k to occ ur?
Karunya University | Dept. of Information Technology
6
pera ng ys em 145.
ues on
an
What do you mean by compac tion?
146. What is the principle of optimal pa ge replacement algorithm? 147.
What do you mean by absolute pathname?
148. Why is disk scheduling important? 149. What is RAID level1? 150. What is mea nt by real time operating systems? 151. C ompare loosely coupled and tightly coupled system. 152. What is mea nt by context switch? 153. What are the benefits of multithrea ded programming? 154. What are the three requirements that a solution to the critical-sec tion problem satisfy? 155.
Define deadloc k.
156. What is compac tion? 157.
How do you compute the effec tive ac cess time for a demand-pa ge system?
158. What is latenc y time? 159. What are strea ms 160. Define the degree of Multiprogramming. 161. Spec ify the most heavily used system calls for File Management. 162. Define Process. 163. What is a Context Switch? 164. What is a Binary semaphore? 165. State the conditions for Deadlock. 166. Wha t is thrashing? 167. What data type is File? 168. Define seek time. 169. What are the adva ntages of using disk over Main Memory for storage? 170.
Define context switch.
171. What are System calls?
Karunya University | Dept. of Information Technology
7
pera ng ys em
ues on
an
172. Define a threa d. 173. What are preemptive and non-preemptive sc heduling? 174. State the assumption behind the bo unded buffer produc er consumer problem. 175. List the four conditions for dea dloc k. 176. Define Virtual memory. 177. What is the purpose of paging the page tables? 178.
Mention the importance of swap-spa ce management.
179. What is the kernel of an OS? 180. A single-threa ded proc ess has one ________ to spec ifying the next instruction to exec ute. 181. Write the differenc e between Policy and Mec hanism in Operating System Design. 182. A program is a________ entity. 183. C PU Sc heduler is also called ________. 184.
Dea dlocks c an be described more prec isely in terms of a direc ted graph called a ________.
185. An address generated by the CPU is commonly referred to as a ________. 186. A ________ never swaps a page into memory unless that page will be needed. 187. The ________ provides host-name-to-network-address translations for the entire Internet (including the World Wide Web). 188. A synchronous device performs da ta transfers with predictable ________. 189.
The ________ is the time for the disk arm to move the hea ds to the c ylinder containing the desired sector.
190. What are the two types of modes used in dua l modes op eration? 191. How is the protec tion for memory provided? 192. Define proc ess. 193. What do you meant by throughput? 194. What is the use of semaphore? 195. Write some classical problems of synchronization.
Karunya University | Dept. of Information Technology
8
pera ng ys em
ues on
an
196. What is meant by thrashing? 197. How is free-spa c e managed using bit vec tor implementation? 198. What are the tec hniques used for performing I/O? 199.
How c an the index bloc ks be implemented in the indexed alloc ation scheme?
200 . The extended instruc tions are known as _______. 201. What are the two main functions of an operating system? 202. What is preemptive sc heduling? 203. What is meant by rac e c ondition? 204. What is mea nt by critical sec tion? 205 . The virtual address space is divided up into units c alled _______. 206. What is the main function of NRU algorithm? 207. _______ is a table assoc iated with ea ch disk bloc k. 208. Define swap spa ce. 209. A disk that has a boo t pa rtition is c alled a _______ or_______. 201. What is a sector?
PART-B Questions
1.
Define the scheduling.
difference
between
preemptive
and
nonpreemptive
2.
Why are page sizes always powers of 2?
3.
What are ac c ess c ontrol matrice s?
4.
Mention some complexities assoc iated with pa rallel proc essing.
5.
What is the need for condition variables in monitors and how are they different from conventional variables?
6.
What are the two real time systems? 9
7.
Define dispa tcher? What are the functions of its?
8.
What are the methods to eliminate deadloc ks by abo rting proc ess?
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
an
9.
List the attributes of files.
10.
List out the Kernel I/O subsystem services.
11.
Define time sharing.
12.
What is sema phore?
13.
List the four nec essary conditions are nec essary to oc c ur dea dlock.
14.
Mention the adva ntages of virtual memory.
15.
Define contiguous memory alloc ation
16.
List the various services provided by the operating systems.
17.
C ompare the user-level threa ds and kernel- level threa ds.
18.
What are the ways of rec overing from a deadloc k?
19.
G ive short notes on the methods used to implement direc tories?
20.
Mention the various servic es provided by kernel I/O subsystem.
21.
Explain five major groups of system c alls c ategories.
22.
What are the criteria rec ommended for evaluating C PU scheduling algorithms?
23.
State and explain the nec essary c onditions for deadlock.
24.
Write down the steps for handling the pa ge fault.
25.
Show the struc ture and c ontents of UNIX inode.
26.
Differentiate compute-server systems and file server systems.
27.
Differentiate asynchronous cancellation and deferred c ancellation in threads issues.
28.
How best fit strategy is used to selec t a free hole from the set of available holes?
29.
Mention the various operations performed on a direc tory.
30.
Differentiate co nstant linea r veloc ity and constant angular veloc ity in disk struc ture.
31.
Write a short note on Mass - Storage Management
Karunya University | Dept. of Information Technology
10
pera ng ys em 32.
What is use of fork () and exec ()?
33.
Write a short note on dynamic loading
34.
List the typic al file attributes
35.
Describe Storage – Area Network
ues on
an
36. List the ac tivities of proc ess mana gement for which the operating system is responsible. 37.
State the bene fits of multithreaded programming.
38.
What do you mean by Mutual exclusion?
39.
Mention the two strategies for managing free memory that is assigned to kernel process.
40.
What is a boot control bloc k?
41.
What is virtual mac hine? State its adva ntages and disadva ntages.
42.
Mention the various criteria of C PU scheduling.
43.
What is the differenc e between deadloc k and starvation? Discuss the nec essary conditions for dea dloc k.
44.
Disc uss the c onc ept of free spa c e mana gement briefly.
45.
What are bad bloc ks? How do you rec over the disk from the bad bloc ks?
46.
Explain proc ess state.
47.
Write about sema phores.
48.
What is paging?
49.
Write the file attributes.
50.
Explain caching.
51.
Explain the different states of a process with a neat diagram.
52.
C ompa re pa ging and segmentation.
53.
Distinguish between internal and external fragmentation.
54.
State producer consumer problem.
55.
Explain about working sets.
Karunya University | Dept. of Information Technology
11
pera ng ys em
ues on
an
56.
What are the five major activities of an operating system in regard to process management?
57.
List the fea tures of process sc heduling in multiprogramming scheduler.
58.
What is a spin loc k? What is an alternative to spin loc king?
59.
What are link and unlink direc tory operation?
60.
What is the need for disk scheduling? What are the advantages of multiproc essor system?
61.
What is a threa d library? How it is implemented?
62.
Define serial sc hedule and loc king protoc ol.
63.
How is the effective acc ess time computed for a demand paging memory?
64.
Define network-attac hed storage and storage-area network.
65.
How system calls are used ? Illustrate with an example.
66.
Explain about dispa tcher in C PU-scheduling function.
67.
List the steps in processing a user program.
68.
Write the func tions of any six file types.
69.
Summarize the interrupt-driven I / O c yc le with a nea t bloc k diagram.
70.
What do you mean by multiprogramming?
71.
What is PC B? List out its contents.
72.
Explain the TestAndSet hardware instruc tion.
73.
What is thrashing?
74.
What is seek time and latenc y time?
75.
List any three services provided by an operating system. Explain how ea c h provides convenience to the users.
76.
C ompa re short-term, medium-term, and long-term schedulers. 12
77.
Summarize the Safety Algorithm.
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
an
78.
What are the various sc heduling criteria for C PU scheduli What is the use of co-operating process?
79.
Explain proc ess state transition diagram.
80.
Differentiate be tween Logic al versus Physical Ad dress spa c e.
81.
What is meant by loc ality of referenc e? What are its types?
82.
Why is disk scheduling important?
83.
What is low-level formatting? Enumerate the services of an operating system.
84.
C an a multithreaded solution using multiple user-level threads ac hieve better performance on a multiproc essor system than on a single proc essor system? J ustify.
85.
Write short notes on swapping.
86.
Define file. Explain its attributes.
87.
What is the need for disk scheduling?
88.
Write the fundamental idea behind a virtual mac hine?
89.
Define the term Proc essor Affinity.
90.
What are the essential conditions of Dea dloc k?
91.
Virtual address spac e of a process refers to what?
92.
I/O request specifies several pieces of information. List out that information.
93.
Draw labeled diagram for the proc ess state transitions.
94.
What are the different ways in which a threa d ca n be cancelled?
95.
What are c onditions under which a dea dloc k situation may arise?
96.
What is meant by internal and external fragmentation?
97.
What criteria should be used in deciding which strategy is best utilized for a particular file?
98.
What is the need for system c alls?
99.
What do you mean by a proc ess?
Karunya University | Dept. of Information Technology
13
pera ng ys em
ues on
an
100. Write a brief note on pa ging. 101. List the components of on-disk structure of a file system. 102. Why is rotational latenc y usually not c onsidered in disk sc heduling?
PART-C Questions
1. C onsider the following set of proc esses, with the length of the CPU-burst time given in millisec onds: Proc ess Burst Time Priority P 1 10 3 1 1 P 2 P 3 2 3 1 4 P 4 5 2 P 5 The proc esses are assumed to have arrived in the order P 1, P 2, P 3, P 4, P 5, all at time 0. a. Draw four Gantt c harts illustrating the execution of these processes using FCFS, SJ F, a nonpreemptive priority (a smaller priority number implies a higher priority), and RR (quantum =1) scheduling. b. What is the turnaround time of ea ch proc ess for ea ch of the scheduling algorithms in part a? c. What is the wa iting time of ea c h proc ess for eac h of the scheduling algorithms in part a? d. Which of the schedules in part a results in the minimal average waiting time (over all proc esses)? 2.
Write a note on interrupt handling.
3.
G iven memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algo rithms plac e processes of 212K, 417K, 112K, and 426K (in order)? Which algorithm makes the most efficient use of memory?
4.
C onsider the following page referenc e string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
Karunya University | Dept. of Information Technology
14
pera ng ys em
ues on
an
How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all c ost one fault eac h. _ LRU replac ement _ FIFO replac ement _ Optimal replac ement 5. C onsider a file currently consisting of 100 bloc ks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold. In the contiguous allocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added is stored in memory. a. The bloc k is added at the beginning. b. The block is added in the middle. c. The bloc k is added at the end. d. The bloc k is removed from the beginning. e. The bloc k is removed from the midd le. f. The bloc k is removed from the end. 6. Suppose that a disk drive has 5000 c ylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, what is the total distanc e (in cylinders) that the disk arm moves to satisfy all the pending requests, for ea ch of the following disk sc heduling algorithms? a. FC FS b. SSTF c. SC AN d. LOO K e. C-SC AN 7. C onsider the “rea de rs and writers” problem, where a set of reader proc esses and writer proc esses c ontend for shared da ta. Only one writer may acc ess the data at a time, and while doing so, no readers may read. If no writers
Karunya University | Dept. of Information Technology
15
perat ng ystem
uest on an
are writing, rea ders may rea d the data at will, without excluding ea ch other; however, no writers may ac cess the data while it is being read. Show how to implement P r e a d , V r e a d , P w r i t e and V w r i t e (mutual exclusion primitives for readers and writers) using ordinary semaphores. 8.
Write the 4 versions of mutual exc lusive primitives as spec ified by Dekker.
9. C onsider 5 processes P0 through P4 and 3 resourc e types A(10 instanc es), B(5 instanc es), and C (7 instanc es). The snapshot at time T0 is given below:
Is the system in a safe state? Now P1 requests (1,0,2). Is the system now in a safe state? 10.
Write short notes on the file system in the Unix operating system.
11.
Define the essential properties of the following operating system. a. Timesharing
12.
b. Real time
Explain the following: a. Memory protec tion
c. Distributed OS.
b.
CPU protec tion
13.
Briefly explain proc ess sched uling with nea t diagram.
14.
Explain the following C PU sc heduling algorithm with an example. a.
Round Robin
b. Shortest J ob First
15.
Explain nec essary c ondition for deadloc k to oc cur?
16.
What is external fragmentation? Explain any one solution to this problem?
17.
When do a pa ge faults oc c ur? Describe the ac tions taken by the OS when a page fault oc c urs.
18.
Explain any three direc tory struc ture in detail.
19.
Explain any two file alloc ation method s in disk spac e with its advantages and disadvantages.
Karunya University | Dept. of Information Technology
1
pera ng ys em
ues on
an
20.
What is swap space management? What is the use? Where it is loc ated and managed?
21.
C ompa re and contrast multiprogramming and multi tasking systems.
22.
What are the different proc ess states? Explain with a diagram.
23.
What is multi-threa ding? What are the benefits of multi-threading programming?
24.
Explain critical section problem in detail.
25.
Explain the deadlock detec tion proc ess in detail with diagrams.
26.
Explain the concept of segmentation with nea t diagram.
27.
Explain the FIFO and LRU page replacement algorithms with examples.
28.
Explain the concept of file sharing in detail.
29.
Explain sc an sc heduling algorithms in detail. Give examples.
30.
Explain in detail with an example about the swap spa c e management
31.
Explain the system c omponents of the operating system?
32.
Write short notes on:
33.
Disc uss the various issues involved in implementing inter proc ess c ommunication in message passing system.
34.
Assume that the following proc esses arrive at time 0, in the order given, with the length of the C PU-burst time given in milliseconds
a.
Virtual machines
b.
System c alls
J ob Burst time (ms) A 10 B 29 C 3 D 7 E 12 a. Give the Gantt c hart illustrating the exec ution of proc esses using FCFS, Round Robin (quantum=10) and SJ F sc heduling. b. C alculate the average waiting time for each of the above algorithm 35.
Explain the various classic problems of synchronization.
Karunya University | Dept. of Information Technology
17
pera ng ys em
ues on
an
36.
Explain the Banker’s algorithm with a suitable example.
37
Disc uss in detail about demand pa ging.
38,
Briefly explain the free spa c e mana gement and File sharing.
39.
Explain the various aspects of disk management briefly?
40.
Mention the services of Kernel subsystems with respec t to I/O and disc uss briefly.
41. Explain the main ac tivities and servic es of operating system in connec tion with proc ess mana gement, main memory mana gement and file management in detail. 42. Explain the non-virtual and virtual machine models in detail. Also state their benefits. 43.
Explain various thread models in detail. Write their advantages.
44. Five proc esses arrive at time 0, in the order given, with the length of the C PU-burst time in milliseconds, as shown below. Processes Burst time P1 10 P2 29 P3 3 P4 7 P5 12 Find the average waiting time, considering the following algorithms: (i) FCFS (ii) SJ F (iii) RR (time quantum = 10 millisec onds). (iv) Which algorithm gives the minimum average waiting time? 44. C onsider a system with 5 processes P0 through P4 and three resource types A, B and C . Resource type A has 10 instanc es, type B has 5 instanc es and type C has 7 instanc es. Suppose that at time T0, the following snapshot of the system has been taken.
P0 P1 P2 P3 P4
Alloc ation A B C 0 1 0 2 0 0 3 0 2 1 1 1 0 0 2
Max A B 7 5 3 2 9 0 2 2 4 3
C 3 2 2 2 3
Available A B C 3 3 2
Karunya University | Dept. of Information Technology
18
pera ng ys em
ues on
an
a. What is the content of the ‘n e e d ’ matrix? b. Is the system in safe state? c. If a request from proc ess P1 arrives for (1, 0, 2), can this request be granted immediately? 45. Explain the conc ept of paging memory management sc heme in detail with a nea t hard support diagram. 46. C onsider the following pa ge reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1. How many page fault would occur for the Optimal replacement algorithm, assuming three and four frames. 47.
Explain various direc tories struc tures in detail.
48. Explain the concept of C ontiguous alloc ation method of disk bloc k with a neat diagram in detail. 49. C onsider a disk queue with requests for I/O to bloc ks on c ylinders, in FIFO order: 98, 183, 37 122, 14, 124, 65, 67. The disk head is currently at cylinder 53. Using FC FS algorithm, a. C alculate the total head movement and b. Suggest a mec hanism to rea rrange the request so that the total hea d movement is dec rea sed to improve the disk performance. 50.
Explain the system c omponents in operating system struc ture in detail.
51.
Describe the system structure in operating system in detail with diagrams.
52.
Write in detail about C PU scheduling algorithms with diagrams.
53.
Explain the sema phores in detail.
54.
Explain the pa ging in detail with diagrams.
55.
Describe the segmentation in detail with diagrams.
56.
Write in detail about the thrashing with diagrams.
57.
Explain the file sharing in detail.
58.
Explain the disk scheduling algorithms in deta il with diagrams. 19
59.
Describe the file system implementation in detail with diagrams.
60.
Explain different types of system c alls in detail
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
61.
Describe about C omputing Environment in detail
62.
Explain any three sc heduling algorithm in detail
63.
Describe the following: a. Remote Method Invoc ation
b.
64.
Explain the C lassic problem of Synchronization
65.
a.
66.
Describe the following: a. FIFO pa ge replac ement algorithm b)
67.
an
Multithreading Model
Describe how to rec over from Dead Loc k b. Explain address binding in detail
LRU pa ge replac ement algorithm
Explain the following: a. C ontiguous Alloc ation
b.
Linked Alloc ation
68.
Disc uss various disk scheduling algorithm in detail
69.
Describe the following: a. STREAMS
b.
Direc t Memory Ac c ess
70. What are the major c ategories of System C alls? Briefly desc ribe the various types of system c all that may be provided by the operating system. 71.
Briefly desc ribe how the computer system orga nization and major operating system components are used in a variety of computing environments.
72.
Write short notes on a. Proc ess b.
73.
Proc ess State
c.
Proc ess C ontrol Block
Explain the following scheduling algorithms in detail with examples a. First-come, First served c. Round robin
b. d.
Shortest job first Priority
74.
Describe pa ging in detail with the neat bloc k diagram.
75.
List the various pa ge replacement strategies and explain any four strategies in detail.
76.
What is a direc tory? Describe the most c ommon schemes for defining the logic al structure of a direc tory.
Karunya University | Dept. of Information Technology
20
pera ng ys em
ues on
an
77.
Explain the three major methods of alloc ating disk spac es in detail with suitable examples.
78.
State the different disk scheduling algorithms and desc ribe it in detail with examples.
79.
Write short notes on: a. C aching b.
Interrupts
c.
Buffering
80.
Mention the services of operating systems. Discuss the different types of operating systems in detail.
81.
Describe the different types of Operating System struc ture in detail.
82.
Disc uss the concept of Interprocess c ommunication. Explain in detail how it is implemented.
83.
What is meant by proc ess? Discuss the c onc ept of proc ess. Explain the operation of process in detail.
84.
Why is synchronization of processes required? Disc uss any two c lassic problems of synchronization in detail.
85.
What is pa ging? Desc ribe the ba sic method of paging. structure of pa ge table and its types in detail.
86.
What is page fault? C onsider the referenc e string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. There are 3 frames allotted in the memory at a time. Apply FIFO, LRU, Optimal page replacement algorithms and find the number of page faults.
87.
a. What is meant by direc tory? Explain the tec hniques of direc tory implementation in detail
88.
89.
b.
Explain the conc ept of demand pa ging in detail.
a.
Describe the RAID struc ture in detail.
b.
Describe the various disk sched uling in detail.
a.
Describe the kernel I/O sub systems in detail.
b.
Explain in detail about stable-storage implementation.
Explain the
21
90.
Explain cooperating proc esses.
91.
Write about schedulers.
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
92.
Explain the classic problem of synchronization.
93.
Write about monitors.
94.
Explain the deadloc k prevention, detection and avoida nce in detail.
95.
Write about memory alloc ation.
96.
Write about ac cess methods.
97.
Explain Directory struc ture.
98.
G ive a detailed account of kernel I/O subsystem.
99.
Explain disk management in detail.
100
a. b.
an
Explain about the multi proc essor system. Explain with examples the process management system c alls.
101. Write short notes on: a. Real time systems b. System design and implementation. 102. a. Assume that there are 10 jobs, each of which takes 100 sec to exec ute. C ompare the average turn around time for the 10 jobs between FIFO and round robin scheduling. b.C ompa re the performanc e of SJ F with FIFO and round robin for the c ase when all jobs are of same length and if the jobs have varying length. c. Explain how the multi level feedback queue attacks both efficiency and response time problems in scheduling. 103. a. Write notes on C o-operating processes. b. Explain naming and synchronization issues in IPC . 104.
a. Gridloc k is a term describing a traffic situation in which there are so many cars in the streets and the intersec tions that essentially no c ar can move in any direc tion bec ause other cars are in the way. Explain how this is the same as deadloc k in an operating system by showing each of four conditions for deadlock hold in this situation. b. Explain abo ut locking and time stamp protocols.
105.
A system with following processes and resources exists. In the c ontext of Dijkstra’s algorithm discuss:
Karunya University | Dept. of Information Technology
22
pera ng ys em a.
ues on
an
Whether the system is safe state or unsafe state?
b. If a state is safe, show it is possible for all processes to complete. If a state is unsafe, show how it is possible for deadloc k to occur. Max. Available demand resources X Y Z X Y Z X Y Z P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3 c. Explain the concept of dea dloc k prevention and avoidance. 106. Explain segmentation memory mana gement scheme. Process
Allocation
107. Write notes on: a. b. 108.
Tec hniques for free spa ce management. LRU pa ge replac ement.
a. On a disk with 1000 c ylinders, numbers 0 to 999, c ompute the number of trac ks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request servic ed was at track 345 and head is moving to trac k 0. The queue in FIFO order contains requests for the following tracks: 123, 874,692, 475, 105, 376. Perform the computation for the following disk scheduling algorithms. i.
FIFO
ii.
SSTF
iii.
SC AN
iv.
LOOK
b. Explain the various issues of storage a lloc ation in a file system with that of main memory allocation. 109 . G ive an ac c ount on the following: a. b.
DMA Polling and interrupts.
110. What is the purpose of System c alls? Briefly explain the types of system calls provided by a typical operating system. 111. a.
What are the various proc ess states? Depict proc ess state diagram.
Karunya University | Dept. of Information Technology
23
pera ng ys em b.
What are the important issues involved implementation of operating systems?
ues on
an
in the design and
112. Explain how co-operating proc esses communic ate with ea c h other via an IPC. 113. C onsider the following set of processes, with the length of the CPU burst time given in milliseconds Process Burst time Priority P1 8 3 P2 3 1 P3 4 4 P4 2 2 P5 6 5 The proc esses are assumed to have a rrived in the order P1, P2, P3, P4 and P5 all at time 0. a. Draw four G antt charts illustrating the exec ution of these proc esses using FC FS, SJ F a non-preemptive priority (a smaller priority number implies a higher priority) and Round Robin (quantum=2) scheduling. b.
What is the turnaround time of ea ch proc ess for ea ch of the sc heduling algorithm in (a)?
c.
What is the waiting time of eac h process for ea c h of the scheduling algorithm in (a)?
d.
Which of the schedules in (a) results in minimal average waiting time (overall processes)?
114. Explain in detail how sema phores and monitors are used to solve produc er-consumer problem. 115. Disc uss the methods of deadloc k detec tion and rec overy. 116. Explain the various file directory struc tures. 117. Explain FIFO, Optimal, LRU and LRU approximation pa ge rep lac ement algorithms with an example reference string. Mention the merits and demerits of eac h of the a bove a lgorithms. 118. On a disk with 1000 c ylinders, numbers 0 to 999, compute the number of trac ks the disk arm must move to satisfy all the request in the disk queue. Assume the last request rec eived was at track 345 and the hea d is moving
Karunya University | Dept. of Information Technology
24
pera ng ys em
ues on
an
towards trac k 0. The queue in FIFO order contains requests for the following trac ks. 123, 874, 692, 475, 105, 367. Perform the c omputation for the following scheduling algorithm (i) FIFO (ii) SSTF (iii) SC AN (iv) LOOK (v) C -SC AN (vi) C-LOOK. 119. Explain briefly about various levels of RAID. 120. How is the computer system orga nized acc ording to the number of general purpo se proc essors used? 121.
122.
What are the approa c hes available for users to interface with the operating system? Write notes on following terms: a.
123.
b.
Proc ess C ontrol Block
Explain the following scheduling: a.
124
Proc ess State
First C ome First Served Sched uling
b.
Priority Scheduling
What is a Semaphore? Explain its usage and implementation.
125. Disc uss in detail about Paging Model of logica l and physical memory. 126. Write notes on the following page replac ement algorithm a.
Optimal Page Replac ement
b.
LRU Page Replac ement
127. Explain the Allocating Disk Spa c e methods: C ontiguous alloc ation and Linked alloc ation. 128. Define RAID struc ture and explain the RAID levels. 129. a. b. 130. a. b.
Explain the Direc t Memory Ac cess. Explain the Kernel I/O sc heduling. Disc uss multiprogramming and timesharing operating systems. Write notes on multimedia systems and handheld systems.
131. Disc uss the important issues involved in design and implementation of operating systems. 132. C onsider the following set of processes, with the C PU burst time given in millisec onds. Proc ess P1
Burst Time 10
Karunya University | Dept. of Information Technology
25
pera ng ys em
ues on
an
P2 29 P3 3 P4 7 P5 12 C onsider FC FS, Non-preemptive SJ F, RR(quantum = 10 ms) scheduling algorithms. Illustrate scheduling using Gantt chart. Calculate their waiting time and a verage waiting time. 133. Disc uss in detail about Interprocess c ommunic ation. 134. a. Disc uss the critical section problem. State the basic requirements of c ritic al sec tion problem solution. b. Explain segmentation hardware with suitable example. 135. State c learly four nec essary c onditions for deadloc ks to oc c ur. Explain Banker’s algorithm for deadloc k avoidance. 136. Illustrate FIFO page replacement and LRU pa ge replac ement with suitable examples. 137. Briefly explain three major methods of alloc ating disk spac e. 138. Disc uss with diagrams the following disk sc heduling algorithms: FCFS, SSTF, and SC AN. 139. Disc uss the services provided by Kernel I / O subsystem. 140. Explain the following: a.
Distributed systems
b.
System programs
141. a. b.
Explain about the various operating system services. What are the types of system c alls?
142. Explain about inter proc ess communic ation. 143. C ompute average turnaround time and average waiting time for the following scheduling methods. a. b. c.
FIFO SJ F Round robin (quantum = 2ns). Proc ess Burst time (ns) P1 4
26
Arrival time 2
Karunya University | Dept. of Information Technology
pera ng ys em
ues on
an
P2 2 1 P3 5 1 P4 3 3 Draw the Gantt charts for the a bove scheduling methods. 144. a. Write and explain the monitor solution for Dining-philosopher problem. b.
What is a semaphore? What are its operations?
145. a. b.
Explain the deadlock rec overy methods. Explain about pa ging.
146.
a. b.
Explain the ba sic c onc epts involved in demand pa ging. Explain any two-direc tory struc tures.
147. a. b.
Describe any 2-disk alloc ation methods. Disc uss about any 2 free spa c e management methods.
148.
Explain the various disk scheduling algorithms.
149.
Write short notes a.
Kernel I/O subsystem
b.
Swap spa c e management.
150. Explain how protec tion is provided for the hardware resources by the operating system. 151. Explain about the various systems c alls. 152. Explain in detail about interproc ess communic ation. 153. C onsider the following set of processes, with the length of the C PU-burst time given in milliseconds: Proc ess Burst time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 5 2 Processes are a rrived in P1, P2, P3, P4, P5 order of all at time 0. Draw G antt c harts to show exec ution using FC FS, SJ F, non-pree mptive priority (lower number implies higher priority) and RR (time quantum = 1) scheduling. Also calculate waiting and turnaround time of each process for eac h one of the above scheduling algorithms.
Karunya University | Dept. of Information Technology
27
pera ng ys em
ues on
an
154. Explain about the Banker's algorithm for deadloc k avoida nce. 155.
Explain about the basic c onc epts of pa ging.
156. C onsider the following page-referenc e string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming three frames? Remember all frames are initially empty. a. FIFO replac ement b. replacement 157. a. b.
LRU replac ement c.
Optimal
Briefly explain about the single and two level direc tory structures. Write notes abo ut the protec tion strategies provided for files.
158. Explain SSTF, SC AN, C-SC AN and LOO K disk scheduling tec hniques with examples. 159. Disc uss about the kernel I/O subsystem. 160. Briefly explain the types of system calls provided by a typic al operating system. 161. Disc uss in detail on the services provided by the operating system. 162. a.
What is the role of PC B? List the attributes of PC B.
b. State and explain the different mec hanism for Inter proc ess communication. 163. Explain FCFS, SJ F, a non-preemptive priority and RR sc heduling algorithm by considering four proc esses with burst time and priority. Compa re the turn around and waiting times of each process for each of the above scheduling Algorithms. 164. Explain in detail how semaphores and monitors are used to solve the Dining-Philosopher problem. 165.
What are the tec hniques involved in deadloc k detection?
166. Explain the LRU approximation page replac ement algorithms. 167. Explain the various file directory struc tures.
Karunya University | Dept. of Information Technology
28
pera ng ys em 168. Write short notes on the following: a. SSTF b. FC FS
ues on c.
SC AN
d.
an
C -SC AN
169. Explain briefly about RAID. 170. a. b.
Explain the various operating system services. Write notes on system programs.
171. Illustrate how operating system ac ts as a resourc e manager. 172. a. b.
Explain about inter proc ess c ommunic ation. Describe the proc ess lifec yc les and PC B with nea t illustrations.
173. a. b.
Disc us the various multithrea ding models. Explain about multiple proc essor sc heduling.
174.
a. Disc uss the monitor solution for Dining Philosopher problem. b. Explain the Peterson’s solution for proc ess synchronization.
175. a. Why are segmentation and pa ging sometimes c ombined into one scheme? b. What is the cause of thrashing? How do es the system detec t thrashing? Onc e it detec ts thrashing, what can the system do to eliminate this problem? c.
Explain Bankers algorithm for deadloc k avoidance.
176. a. Given five memory partitions of 100kB, 500kB, 200kB, 300kB, and 600kB (in order), how would each of the first-fit, best-fit and worst-fit algorithms plac e processes of 212kB, 417kB, 112kB, and 426kB (in order)? Which algorithm makes the most efficient use of the memory? b.
Write short notes on segmentation.
177. C onsider the following page referenc e string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 How many page faults would occur for the following replacement algorithms: LRU, FIFO, and O ptimal assuming three frames that all frames are initially empty. 178. a. b.
List and discuss the various methods for implementing a direc tory. Disc uss the various file operations.
Karunya University | Dept. of Information Technology
29
pera ng ys em
ues on
an
179. A ha rd disk having 500 c ylinders, numbered from 0 to 499. The drive is c urrently serving the request at cylinder 143, and the previous request was at c ylinder 125. The status of the queue is as follows: 86, 470, 13, 177, 448, 150, 102, 175, 130. What is the total distanc e (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk -scheduling algorithms? a.
FCFS
b.
SSTF
c.
SC AN
d.
LOOK
180. An Operating system provides an environment for the execution of programs. What are the services provided for the convenience of the programmer, to ma ke the programming task easier? Explain the services in detail. a. b.
List out Various Exec ution modes in the Operating System. What is a System call? Explain the various types of system calls
181. In general a Proc ess can be divided into Single Threa ded Proc ess and Multi Threaded Process. a. b. c.
List out the benefits of multithreaded programming. Explain the Multithrea ding Models with proper diagram. Explain Round robin sc heduling with an example.
182. a. b.
Define C ritical Sec tion. There are some classical problems of synchronization and these problems are examples of a large class of concurrency–control problems. One of the problems is Dining-Philosophers problem. Explain this problem with proper example. Write the Monitor solution for this problem. 183. Explain the Banker’s algorithm for deadlock avoida nce with an example. 184. Paging is a memory mana gement scheme. Draw the Paging hardware diagram. Write the working proc edure of paging hardware in detail. 185.
How can you handle a page fault in demand paging? Explain FIFO pa ge replac ement and Optimal Page replac ement algorithms in detail.
186. Explain the various diskspace alloc ation methods. 187. Explain the various disk scheduling algorithms with an example. 30
188. Write short notes on: a. RAID b. Tertiary storage struc ture
Karunya University | Dept. of Information Technology
