Seat Number CET] P. Pages : 2 | Wy ng AMIN ee COMPUTER SCIENCE : UG -Cs- 361/321 Operating System . (32421 Time : Two Hours Max. Marks : 40 Instructions t 1 Candidates: Do not write anything on question paper except Seat No 2 Graph or diagram should be drawn with the black ink pen being 3, Stadenng iting Paper or black HB pencil _ Allquettion es note, a supplement will be provided are compulsory. 5. Figures to the right indicate full marks. 1. Attempt any four. 3 @) Operating system is event driven program, comment. b) what is process state? List different process state c) What is Reentrant code? d) Explain resource allocation graph e€) What is starvation? Explain where it occurs. f) Explain the function of dispatcher 2. Attempt any two. 8 a) What is system call? Explain different system calls b) Write short note on paging. isk with 100 tracks 0 to 99. c) Suppose the head of moving head dis : Currently head at position 19, Just finished a request aie 72. If the queue request is 01, 12, 05, 02, 18, 11, 06, 20, % 81. ; Find the total head movement using - i) SSTF ii) SCAN P.T.O ax - 008NER - 008 3. a) Attempt any two. 6 a) Define i) Throughput ii) Turnaround time iii) Response time b) Write short note on Resident monitor. c) Explain Bankers Algorithm for deadlock avoidance. b) Compulsory question. 2 What is preemptive and non-preemptive CPU scheduling? 4. Attempt any two. 8 a) Find turn around time and Average Turn around time using CPU scheduling algorithm. i) FCFS ii) Round Robin Algorithm. . (time slice - 2) Job No. Arrival time Burst time 1 1 8 2 z 8 4 { 3 4 2 4 Ques ae | saat b) Describe long term scheduler and short term scheduler. c) Write short note on segmentation. 5. a) Attempt any one. a) Describe in brief MVT. b) What is distributed system? What are advantages of ditributed system? What is client and server. b) Compulsory question. 1). Seek time. 2) Latency time 118 / 385 WAX - 008 i‘Seat Number P. Pages :3 A ons COMPUTER SCIENCE : UG-CS-361 Operating System (362401) Time : Two Hours Max. M ae 60 . Marks : Instructions to Candidates : 1 2. 3. 4. Do not write anything on question paper except Seat No Graph or diagram should be drawn with the black ink pen being used for writing paper or black HB pencil. Students should note, no supplement will be provided. All questions are compulsory. 1. a) Attempt any six. a) b c) d) e) SES - 008 Logical memory is broken into blocks of same size called i) Frames ~~ ii), Pages ill) backing store iv) none The time taken for the desired sector to rotate to the disk head is called —— i) Positioning time ii) random access time ill) Seek time iv) rotational latency The number of processes completed per unit time is known as -—-—- i) output ii) throughput iii) efficiency iv) capacity A solution to the problem of indefinite blockage of low ~ priority processes is —-- i) Starvation iii) Segmentation ji) aging iv) ready queue The entry of all PCBs of current processes is in ji) program counter i) process register it iii) process unit iv) process table i it i ime slot given to a In atime sharing operating system, when the time slot ‘| process is completed, the process goes from the running state to the i) blocked state ii) ready siete iil) suspended iv) terminates 1 P.T.Ob) 9) Waiting time is -——-—- . i) the total time in blocked and waiting queue. ii) the total time spent in the ready queue. iil) total time spent in the running state. iv) total time from the completion till the submission of a process. Which module gives control of the CPU to the process selected by the short ~ term scheduler? i) dispatcher ill) scheduler h) ii) interrupt iv) none Attempt any six, a) What is Job Scheduler? b) What are limitations of MFT. ©) What is use of banker's algorithm? d) Enlist deadlock Prevention techniques. ©) Write different states of process. on f) What is deadlock? 9) Enlist types of operating system. h) What is android operating system. Attempt any six. 12 a) What is memory management? b) What is internal fragmentation. c) Explain resource allocation graph. d) Enlist android applications. e) What is resident monitor? f) | What is compaction? g) Explain logical & physical address space. h) Enlist services of operating system. i) What is google play store. IES - 008Attempt any four, ‘FEST - 008 ssc 12 plain features of android operating system b) Whatis di is difference between scan & cscan disk scheduling algorithm: ©) Explain process control block in detail. 4) Explain FCFS with example in CPU Scheduling, ©) Write short note on segmentation f) Write necessary & sufficient conditions of deadlock Attempt any three. 12 a) Explain android architecture in detail b) Compare MFT & MVT in detail. ©) Explain external fragmentation. 4) Explain SSTF disk scheduling algorithm e) ‘Operating system is called resource allocator” comment Attempt any two. 12 a) For following example calculate average turnaround time and average waiting time for following algorithms i) FCFS ii) Preemptive SJF iii) Round robin (1 time unit) Process | Arrival time 0 b) Explain paging in detail c) Explain short term & Long term scheduler. 119 | 1355 seer - 008