Operating System Question Bank

1. 2. 3. 4. 5. !. What is paging? Explain basic methods used for paging. What is segmentation and methods used for segmentation? What do you understand by safe and unsafe state in deadlock? Explain bankers algorithm. Explain data structures used in ankers algo. What is deadlock and "hat are the necessary conditions for occurrence of deadlock. #. What is difference bet"een deadlock pre$ention and deadlock a$oidance? %. Explain ho" deadlock can be pre$ented? &. What are the $arious '() scheduling criteria? 1*. What is the difference bet"een all '() scheduling algos. 11. What is preempti$e and non preempti$e scheduling? 12. +efine '() scheduling. 13. +efine star$ation. 14. Why '() scheduling is re,uired? 15. What is multile$el ,ueuing system? 1!. +ifferentiate bet"een segmentation and paging. 1#. When does page fault occurs? 1%. Why is paging re,uired in operating system? 1&. What are the $arious operating systems? 2*. +efine $irtual memory. 21. +ifference bet"een internal and external fragmentation. 22. What is external fragmentation? 23. What is internal fragmentation? 24. +iscuss physical and logical address. 25. What is meant by s"apping 2!. +ifference bet"een cache and $irtual memory. 2#. What is demand paging? 2%. +iscuss $arious page replacement algos. 2&. What is reference string? 3*. What are the attributes of file? 31. +efine elady-s anomaly. 32. What is best fit? 33. What is "orst fit? 34. What is first fit? 35. What are the structures of file system implementations? 3!. What is process? 3#. Explain (' 3%. Explain process states. 3&. What is inter process communication? 4*. Explain multi threading models. 41. What are threads and their benefits? 42. Explain context s"itch.

43. Write a short note . a. /ultitasking 0time sharing system . b. atch systems c. 'lustered system d. /ultiprocessor e. /ultiprogrammed systems . 44. Explain single threaded process and multi threaded process. 45. What are schedulers1 explain 2hort term3 long term3 medium scheduler. 4!. +efine a file system. What are $arious components of a file system? 2tate and explain commonly used operations on file. 4#. Explain the concept of (rocess. +ra" a process transition diagram and explain the $arious process states. 4%. What is meant by (rocess 'ontrol lock? +ra" and explain different fields of (' . 4&. Explain 'ontext 2"itch by gi$ing an example. 5*. Explain +istributed 2ystem. 51. +efine the essential properties of follo"ing 42 "ith its ad$antages and disad$antages. a. +istributed b. 5eal 6ime c. 6ime sharing 52. What is the purpose of system call? 53. What are the differences bet"een user le$el threads and kernel le$el threads? )nder "hat circumstances one is better than other? 54. +escribe the difference bet"een follo"ing17 a. 2ymmetric and 87symmetric /ultiprocessing b. 6ime sharing and real time 42 55. +ifferentiate bet"een (rocess and threads. 5!. What is the purpose of paging the page tables? 5#. What is thrashing? 9o" it can be pre$ented? 5%. What ad$antages do threads ha$e o$er multiple processes? What ma:or disad$antages do they ha$e? 5&. Explain differences bet"een a. ;ogical and physical address. b. <nternal and external fragmentation. !*. Write short note on a. elady-s 8nomaly b. 6hrashing c. ;ocality of references !1. 9o" address calculation is done in segmentation? !2. 2tate and explain the necessary condition that lead to deadlock situation. !3. Explain 8ccess7list and access matrix. !4. When do page fault occurs? +escribe the action taken by 4.2. "hen page fault occurs. !5. Explain single contiguous memory management techni,ue "ith ad$antage and disad$antages.

!!. Explain the "orking of banker-s algorithm for deadlock a$oidance "ith suitable examples. !#. 'onsider the follo"ing page reference string 43 33 23 13 43 33 53 43 33 23 13 5 8ssume page framer =33 pure demand paging. 9o" many page faults "ould occur for i> ?<?4 ii> ;5) iii> 4ptimal algorithm. !%. @i$e memory partition of 1**A35**A32**A33**A and !**ABin order>.9o" "ould each of the first fit3 best fit and "orst fit algorithm place process of 212k341#k3112k3and 42!kBin order>? Which algorithm makes the most efficient use of memory?