22516 3 teams ee Marks sexo TTT TITT] instructions — (1 All Questions are Compulsory: (2) Answer cach next main Question on a new page. (3) Illustrate your answers with neat sketches wherever necessary. (4) Figures to the right indicate full marks. (5) Assume suitable data, if necessary. (6) Mobile Phone, Pager and any other Electronic Communication devices are not permissible in Examination Hall, Marks Lh Attempt any FIVE of the following: w N__gy State and describe any oro advanisges of mulipoeessor system. b) State any four types of system calls, ©) Draw a neat labelled diagram for process state, d) State difference between preemptive scheduling and non-preemptive scheduling, e) Define the term fragmentation in terms of memory. {) Give commands to perform following tasks; i) To add delay in seript ii) To terminate a process g) List any four operations performed on a file PTO,22516 a, \ ne UB) List and describe any four se 4, °) d) a) D 4) (2) Marks 12 Attempt any ‘THREE of the following: ; «sharing system with neat diagram. Describe working of vices of operating system. Differentiate between shared memory system and message passing system of interprocess communication. State and describe any two scheduling criteria. ‘Attempt any THREE of the following: 2 Describe use of ps and wait commands with suitable example. Describe prevention of deadlock occurrence with respect to hold and wait necessary condition. With suitable diagram, describe the concept of variable partitioning of memory. Describe linked file allocation method with suitable example. ‘Also list its one advantage. Attempt any THREE of the following: 2 _2) Differentiate between command line based operating system » 4) 5) ‘and GUI based operating system (Any four points) Describe various activities performed by following operating system components. . i) Main memory management ii) File management With suitable diagram, describe use of scheduling queues in process scheduling. Write steps required for Banker’s algorithm to avoid deadlock. With suitable example, describe any one free space management technique.22516 » 9 6 b) Cc) GB) Marks 2 TWO of the followin Attempt any sage waiting time for following data using First ortestJobeFirst(S) Calculate aver algorithms. Process Burst time ‘Arrival time PO 08 0 PL 04 L P2 0s 2 P3 oe 3 Describe with example, use of following tools: i) Device Management ii) Performance monitor iii) Task scheduler Describe the concept of virtual memory with respect 10 paging. Also draw paging hardware diagrant and describe its working with example. 2 ‘Attempt any TWO of the following: Describe one-to-one multithreading model with suitable jagram. Also write any two advantages of one-to-one model ‘over many-to-one model. Consider the following page reference string arrival with three page frames:- 5, 6, 7, 8, %, 7, 8, 5, 9% 7, 8 7, % 6 56 Calculate number of page faults with optimal and FIFO (First In First Out) page replacement algorithms. Describe following directory structures in short with neat sketches: 1 i) Single level ii) Two level iii) Tree structured22516 23124 | 3 Hours / 70 Marks Seat No. ] A AML Questions are Compulsory. Instructions — (1) (2) Answer each next main Question on a new page (3) Illustrate your answers with neat sketches wherever necessary. (4) Figures to the right indicate full marks (5) Assume suitable data, if necessary. (6) Mobile Phone, Pager and any other Electronic Communication devices are npt permissible in _ Examination Hall. Marks 1 Attempt any of the following: 10 gor real time operating system, along with any two 6 applications of it. 1 List any four services provided by operating system. S) Draw neat labelled provess state diagram along with the correct directions of arrows. d) Define CPU bound progeam and 1/0 bound! program, e) Define paging and segmentation. f) What is the use of PS command? Write long forms of UID, PID in the output of this command, \ @e any four file operations. PTO.22516 4) a) b) 4) 2) Marks 12 Attempt any THREE of the following: Describe multiprocessor OS with it's advantages (any two). Write down the responsibilities of the following components of os. i) Memory management ii) File management Explain shared memory method of IPC using neat labelled diagram, Explain following terms with respect to scheduling i) CPU utilization ii) Throughput iii) Turnaround time iv) Waiting time Attempt any THREE of the following: 12 Explain following commands with their syntax — i) Kill ii) Sleep ) Wait iv) Exit What is deadlock? Discuss any one method of deadlock prevention, Describe concept of free space management technique using bit map method, Draw the diagram of linked file allocation method and explain it, 225),22516 (3) Marks 4 Attempt any THREE of the following: n Compare between CLI based OS and GUI based OS (any four \ © points, b) What are the different types of system calls? Give examples of each, ©) Explain working of CPU switch from process to process with neat labelled diagram. @) Solve given problem by using FCFS scheduling algorithm. Draw correct Gantt chart and calculate average waiting time and average tumaround time ~ Process | Arrival time | Burst time Po a 10 PL J 29 P2 2 3 P3 3 7 P4 4 12 ©) Which hole is taken for next segment request for 8 KB in a swapping system for First fit, Best fit and Worst fit os 4 KB 9 KB 20 KB 16 KB 8 KB 2 KB 6 KB PTO.22516 b) ) (4) Marks Attempt any TWO of the following: 12 Write two uses of the following operating system tools — i) Security policy ii) User management iii) Performance Monitor Differentiate between process and thread. (any two points), Also discuss the benefits of multithreaded programming. Find out the total number of page faults using — i) Least recently used page replacement ii) Optimal page replacement Page replacement algorithms of memory are coming in the order 70120304230321201701 agement, if the page Attempt any TWO of the following: 12 How pre-emptive scheduling is better than non pre-emptive scheduling by solving following problem using SJF (Solve by using pre-emptive SIF and non-pre-emptive SJF also). Process [arrive time | Burst time Pl 0 8 ' P2 1 4 P3 2 9 P4 3 | 5 List free space management technique with the help of neat diagram, explain any one technique in detail. Draw and explain directory structure of a file system in terms of single level, two level and tree structure,22516 22223 3 Hours / 70 Marks — sea No. [ | [ T | LL] Instructions — (1) All Questions are Compulsory: (2) Illustrate your answers with meat sketches wherever necessary. (3) Figures to the right indicate full marks. (4) Assume suitable data, if necessary, (5) Mobile Phone, Pager and any other Electronic Communication devices are not permissible in Examination Hall. (© Preferably, write the answer in sequential order. Marks L Attempt any FIVE of the followings + . 10 AC@) State any two features of Linux. 1 (®) Difference between Time sharing system and Real time system (any 2 points) QO) State any four services of operating system, @ Write the difference between pre-emptive and non-preemptive scheduling ¢) Define following terms : i) Virtual Memory Paging f) List any four file attributes and i's: meaning, g) Define Deadlock. i PTO,22516 2 “ ®) b) °) d) 2) Marks cof the followings 12 Attempt any TI Explain different types of system call Draw and explain process control block in detail. State and explain four scheduling criteria. Define fragmentation, Explain Internal and External Fragmentation Attempt any THREE of the following: 12 Describe multiprocessor OS with it's advantages. (any two) Explain different components of operating system. Explain diflerent types of schedulers. d) Explain two level directory structure with suitable diagram. 4. Attempt any THREE of the following: 2 + \@ Explain real time OS. Explain it's types. b) Draw process state diagram and describe each state. ¢) Describe any four condition for deadlock, d) Differentiate between paging and segmentation (any 4 points) ¢) Explain fixed and variable memory management. 5. Attempt any TWO of the following: 12 a) Explain the working of interprocess communication considering i) Shared memory ii) Message passing b) With neat diagram explain multilevel queue scheduling. Write two uses of following operating system tools. i) Security policy ii) User Management iii) Task scheduler22516 GB) \ Marks 6. Attempt any TWO of the following: 12 8) List file allocation method and explain any)oné in details b) For the page reference string 7, 0, 1, 2, 0, 3,0, 4, 2, 3,0, 3,2, 12,0, 1, 7, 0,1 Calculate the page faults applying. i) Optimal ii) LRU iii) FiFo page Replacement algorithms for a memory with three frames. ©) Consider the four processes PI, P2, P3 and P4 with length of CPO Burst time. Find out Avg waiting time and Avg tum around time for the following Algorithms. i) FCFS ii) RR (Slice-4ms) i) SIF Process Arrival time Burst time PL 0 P2 1 P3, 2 Pa 3 afolsle11920 ~~ 3 Hours 70 Marks Seat No.[™ Instructions ~ (1) All Questions are Compulsory: ‘2 Li °) Co) (2) Answer each next main Question on a new page. (3) Illustrate your answers with neat sketches wherever necessary. (4) Figures to the right indicate full marks. (5) Assume suitable data, if necessary. (6) Mobile Phone, Pager and any other Electronic Communication devices are not permissible in Examination Hall. Marks Attempt any of the following: 10 Define real time operating system. List any four applications of it Explain any four services provided by OS. Draw process state diagram. Explain any four scheduling criteria, Define virtual memory. Write syntax of following commands: (i) Sleep (i) Kill ‘ Describe any four file attributes, PTO.-\ ® lak ar 22816 (2] | @ 7 Marks \ ; @ 2. Attempt any THREE of the following: e 7 ist types ing system. Explain multiprogfamming OS \ ab Elis or af operating, sy! plain multipro far 2 oO List components of OS. Explain process management in detail ©) With neat diagram explain inter process communication model. d) Describe Vo burst and CPU burst cycle with neat diagram. 3. Attempt any THREE of the following: 12 a) Explain ‘PS’ command with any four options b) Explain deadlock? What are necessary conditions for deadlock? ©) Explain partitioning and its types 4) Describe sequential and direct access method. 4 Attempt any THREE of the following: 12 a) Write unix command for following: (i) Create a folder OSY (ii) Create a file FIRST in OSY folder (iii) List / display all files and directories. (iv) Write command to clear the sercen b) What is purpose of system call? State any two system calls with their functions. | c) State and describe types of scheduler. d) Explain Round Robin algorithm, with suitable example e) Explain PCB with diagram,(3] Marks 12 TWO of the following: Explain an} ail Attempt any yy two in detail ist the operating system tools ading model in det ment algorithm for foll b) Explain mul Explain LRU page replace string. yo1z203s04230321203 Calculate the page fault i lowing reference 701 & Attempt any TWO of the followings 12 a) The jobs are scheduled for execution as follows [roses [Anal Tine] PL 0 se: | P2 1 P3 2 _t [Pa 3 (os [4 1 Solve the problem using: (i) SIF (ii) FCFS _ ‘Also find average waiting time using Gantt chart, b) List free space management techniques? Describe any one in | detail, . c) Ei different file allocation methods? Explain contiguous allocation methed in detail.