Question

1 (24) Multiple Choice(3 points for each): 1) In the interrupt systems. What processing need be done by hardware when an interrupt occurs? A. Save remainder of process state information B. Restore process state information c. pushes PSW and PC onto control stack D. Restore old PSW and PC E None of the above. 2) In the distributed system, which of the following statement is true? A All the processors in the system share the memory. B. Users are aware of the different computers that make up the system. C. Multiple computers are transparent to the user. D. Execute programs that are guaranteed to have an upper bound on tasks that they carry out E None of the above 3) Which of the following is not one of the directory structure? A One-Level structure B Two-Level Structure C Tree-Level Structure D Acyclic Graph Structure E None of the above 4) The degree of multiprogramming is fixed in which of the following memory management method? Fixed partitioning B Dynamic partitioning C Paging system D. Segmentation system Segmentation with paging system Internal fragmentation can be produced in which of the following memory management Fixed partitioning А. 3) methods А. R Dynamic partitioning Fixed partitioning and paging system D Fixed partitioning and segmentation system Dynamic partitioning and segmentation system The following figure shows the memory layout at some time (block A, B, C, D, Ewe unused blocks and the treate A 100KB, B: 500KB, C 200KB, D: 300KB, and E 60063 respectively and at this time a job rives requiring 212KB. best-fit algorithm is a which block will this job be allocated to A Block B Block B D. Focus

Operating systems: please explain

Answer 1

Ohway 4: false because during intercept it us done by the software Coperating system) hot hardware 0; X is done oftes the descrice of interupt i False, C: Cpu pashes psw and pc onto control stack True Di faire bcz it done after the interupt service. chuc3 No: because only messages are showed between system so they have their own memary Tree: To peryaum a took he/she must be aware of where it should be done false; Bc2 cuger wie aware of only functionality not the implementation delail. free- ani structure Diffount types of dosuctory ① One - level two level (1) Tree ☺ Acyclic Groph. Anse are ut Fixed programming : because of fixed programming partition there will be fixed number of partitions in the memory there are only Lixed number of programs can be loaded x Dynamic memany may vary so mare no. of programs * paging- Depende on the number of pages allocated to the program X segmentation Systems K &gmentation with poging segment If we lood 2 segments of one-program 3-segments of other therefore digree may wory.

PAGE NO.: DATE: // w 5 (whoru there is fixed pooctitioning there will be internal fragmentation bc2 sizes of the pages, programi segments may vary cleading some space in their allocated memory there fore it cleads to internal fragmentation etnis: fixed Dynanst Dynamic X fixed and paging fixed and segmentation L Dynamic and sog mentation X Anit Block suercure (212 kB) then lowest memory in which 212KB loaded 8pca will be Block D