vtucode.com ‘Question Bank Course name: Operating Systems Course code:21CS44 Semester: IV ‘Module:t I Explain different types of computer system structures 2. Explain the working principle of Dual Mode operations. 3 ‘What is an Operating system? Explain its functions. 4 Explain the Multiprocessor Systems and also describe the difference between symmetric and asymmetric multiprocessing 5 Explain Mass storage management and its activity. 6 What is the difference between multiprogramming and multi-tasking? 7 What are the different types of system calls and Why itis needed? 8 Explain file management and its activity. 9 Explain the working principles of Distributed operating Systems 10. | Define the following operating system and its advantages a. Batch b. Multiprogramming cc. Multitasking 4d. Clustered Systems Ti. _ | Explain the system components of OS. 12. | With neat flow diagram explain the different stages of a Process. 13 Distinguish Client server systems and Peer to Peer systems. 14,__ | Explain the working principle of caching and its advantages. 15. _ | Explain Real time Embedded systems, Multimedia systems and Hand held systems, 16 | Explain the VMware Virtual system architecture with neat diagram. 17 _ | Describe message passing model and Shared memory model of communication between processes (OF scanned wth oneN ScannerDiscuss the reasons for providing an environment that allows process Cooperation. 19 | Describe the differences among short-term, medium-term, and longterm scheduling. Module -2 20 | List the differences between Process and Thread in a tabular form. 21 | Consider the following processes with the CPU burst time given in. milliseconds Process ‘Arrival time Burst time PL 0 8 P2 1 4 P3 2 9 P4 3 5 FCS ii) Preemptive SIF iii) Round Robin(quantum=1 unit) Calculate average turnaround time and average waiting time for the above algorithms drawing Gantt chart. 23 | Consider the following processes with the CPU burst time given in milliseconds Process | Arrival | Priority | CPU Burst | /0 time time time PI 0 2 1 5 P2 2 3 3 3 P3 3 1 2 3 Pa 3 4 2 4 Assuming Preemptive mode and criteria as Priority based, compute the Completion time of each process using Gantt chart. Also calculate CPU idle time and CPU usage time in percentage 24 | Discuss the benefits of Multithread programming. 25__| Explain the different Multithreading Models 26 | Consider the following processes with the CPU burst time given in. milliseconds. Process Arrival time | Bursttime | Priority PL 0 7 4 P2 3 2 2 P3 4 3 1 Pa 4 1 4 PS 5 3 3 Calculate average turnaround time and average waiting time using Gantt for: i) ___ Preemptive SJE (OF scanned wth oneN Scannerii) Priority based iii) Round Robin(quantum=I unit) 27 __| What are Monitors? Explain dining Philosopher's solution using monitor 28 | Illustrate how Reader’s-Writer's problem can be solved by using semaphores 29 _| Explain Critical section problem, What are the requirements that critical section problem must satisfy. 30 | What is Synchronization? Explain Synchronization Hardware. 31___| Define a Process Synchronization? 32 _| Explain the Peterson's Solution Problem ? 33 | What are Semaphores? Explain the usage and implementation of Semaphores. 34 __| Mention the different types of Classical Problems of Synchronization? Module -3 35 | What is deadlock? What are necessary conditions for deadlock? 36 | Discuss the various approaches used for deadlock recovery. 37 | Whatis resource Allocation Graph? Explain how itis very useful in describing deadly embrace by considering an example. 38 | Illustrate with example the internal and external fragmentation problem. 39a ‘What are the methods available for handling deadlocks? Explain Banker’s Algorithm, Consider the following snapshot of the system, Process] Allocated ‘Maximum Total Resources Resources Requirements Ri [| R2] R3 [RI | R2 | R3 | Ri [ R2 [RB pre[2[2/3 [3 [6 [3s [7/7 [10 po ;2fo[3]/4f/31]3 ps [if[2[4f[3s [34 Use Banker's Algorithm : What is the content of need matrix? Is the system in safe state? If the following requests are made, can they be granted /satisfied immediately in the current state, PI request (I, 1, 0), P3 request for (0, 1, 0) immediately 396 | Consider the following snapshot of the system, Total resourves available are RI = 7, R2 = 7 and R3 =10. Process | Allocated Resources Maximum ‘Available Requirements Rif R2] R3 [Ra | Ri | R2 | R3 [Ra] RI | R2 [RS | RS rp fofotit2totfotif2tits [2 To (OF scanned wth oneN ScannerrieTijJo;o][o|]iJ7]s]o pm [i{3{/s/4)/2/3{[s1/6 ps [tole 3 [2 tole Ts [2 ps [oltotif4)/ole|[s]s Use Banker's Algorithm : What is the content of need matrix? Is the system in safe state? If so, In what sequence? 40 | Describe the Segmentation technique. 41 | Whatis Paging? Explain the Structure of Page Table. 42 | What is Swapping? Does this increase OS overhead? Justify your answer. 43__| What are Translation Load side Buffer( TLB)?Explain TLB in detail with a simple paging system with a neat diagram 44 __ | Write a note on Contiguous memory allocation ‘Module-4 45 | Describe briefly about demand paging in memory management scheme. 46 | Illustrate how demand paging affects system performance. 47 | Describe the steps involved handling a page fault 48 | What is Thrashing? How it can be controlled? 49 1. Consider the following page reference stfing 7,0,1,2,0,3,0,4,2,3,0, 1,2,0,1,7,0,1 Assuming there are 2 memory frames, how many page faults would occur in case of ii) al algorithm, Note that initially all frames are empty. 50 _ | Consider the following page reference string 8,1,2,3,1.4,1,5,3,4,1,4,3,2,3,1,2,8,1,2 Assuming there are 4 memory frames, how many page faults would occur in case if Most Recently Used (MRU) Algorithm is used. Most recently is the page that is used recently which is chosen for replacement assuming that it may not be needed later for a longer time. Repeat the same with Least Recently used (LRU) algorithm and calculate the hit ratio and miss ratio for both. 31 | Discuss briefly about file attributes in a file system. 32 Explain in detail about various file types in a file system. 53 Explain the various access methods of files. 54 | Explain in detail about various file operations in a file system. (OF scanned wth oneN Scanner35 Explain the various operations performed on files 36 | With suitable example, explain any two methods of implementation of free space list 57 | Explain the various access methods of files. “Module-5 58 | Explain in detail about overview of mass storage structure. 59 | Consider the disk queue with requests for 1/0 to blocks on cylinders 98, 183, 37,122, 14, 124, 65, 67 in that order. Initially disk head is located at cylinder 53. Calculate the Total cylinder head movement for the following Disk Scheduling algorithms, 1. FCFS. 2. STF. 3. SCAN. 4. C— LOOK. 60 | Consider the following tack request in disk queue. 95, 180, 34, 119, 11, 123, 62, 64 Assume that C-SCAN Algorithm is used. The Read/Write head is at $0. If the tracks are numbered from 0 to 199 and head is moving towards smaller tracks on its servicing. Calculate the the Total SEEK Time needed with 2ms time to move from one track to another while servicing the request. ( Assume that moving, from one end to other end takes 10ms), 61 _| Explain in detail goals and principles of Protection, 62 | Explain in details implementation of Access Matrix. 63 | With aneat diagram explain the components of a Linux operating system. 64 _| Discuss about design principles of Linux system. 65 | Describe the different Linux kernel modules 66 _| Explain different IPC mechanisms available in Linux. 67 _| Explain process scheduling in a Linux system. 68 _| Explain the file system implementation in Linux 69 | Write anote on portability issues in Linux (OF scanned wth oneN Scanner