Blabla.pdf (Practice Questions PDF)

Question 1 It is the one who postpones linking to execution time. Response: Dynamic linking Score: 1 out of 1 Yes Question 2 It is simply the replace base register with relocation register Response: Conceptually simple scheme Score: 1 out of 1 Yes Question 3 It is a program that users can int...

Question 1 It is the one who postpones linking to execution time. Response: Dynamic linking Score: 1 out of 1 Yes Question 2 It is simply the replace base register with relocation register Response: Conceptually simple scheme Score: 1 out of 1 Yes Question 3 It is a program that users can interact directly with the operating system through a user interface (UI), such as a command-line interface (CLI) or a graphical user interface (GUI). Response: Kernel Score: 0 out of 1 No Question 4 Programs on disk are brought into memory to create running processes – but where in memory store given program code _______________? Response: Hard drive Score: 0 out of 1 No Question 5 One of its uses is to be an index into a page table which contains base address of each page in physical memory. Response: Page number Score: 1 out of 1 Yes Question 6 _________ is a technique for breaking deadlocks in real-time systems. Response: Process Termination Score: 0 out of 1 No Question 7 Address binding happens at three different points, one point is, If memory lo-cation is known a prior or absolute code can be generated and it requires recompilation if base location changes. Response: Compile time Score: 1 out of 1 Yes Question 8 _________ is the most widely used technique to ignore the deadlock Response: Ostrich Algorithms Score: 1 out of 1 Yes Question 9 In this situation, it may happen that the same process is always picked as a victim. As a result, that process will never complete its designated task. Response: Starvation Score: 1 out of 1 Yes Question 10 In conclusion, in segmentation all programs sharing one segment must use the same number because? Response: The difficulty of finding a common shared segment number grows as the number of users sharing a segment Score: 1 out of 1 Yes Question 11 In this scenario Imposing a total ordering of resource types is best solution for handling deadlock under what situation Response: Circular wait Score: 0 out of 1 No Question 12 One of these is not proper description of paging. Response: Allows physical memory to be allocated whenever available Score: 1 out of 1 Yes Question 13 It is the way to abort all deadlock process. Response: Process Termination Score: 1 out of 1 Yes Question 14 Relocation registers used to protect __________. Response: User processes from each other, OS code and data from being modified Score: 1 out of 1 Yes Question 15 It is an address seen by the memory unit Response: Physical Score: 1 out of 1 Yes Question 16 On this situation one should determine which resources, and which process should be pre-empted. Response: Selecting Victim Score: 1 out of 1 Yes Question 17 Memory allocation is needed when? Response: Contiguous allocation is an early method putting each process in one chunk of memory. Score: 1 out of 1 Yes Question 18 In accessing memory requires user program to specify a number which is called? Response: Offset Score: 0 out of 1 No Question 19 Splitting the page number into two equal parts of 10 bits. This is an example of. Response: Paging Score: 0 out of 1 No Question 20 One must determine what should be done with the process from which re-sources are preempted. Response: Rollback Score: 1 out of 1 Yes Question 21 It maps physical addresses via entries and has base and limit. Response: Segment Table Score: 1 out of 1 Yes Question 22 It allocates the smallest hole. Response: Best-fit Score: 1 out of 1 Yes Question 23 It can only access a stream of Address plus read request Response: Memory Unit Score: 1 out of 1 Yes Question 24 It is the size of the range of addresses. Response: Limit Score: 1 out of 1 Yes Question 25 It occurs when allocated memory is slightly larger than requested memory. Response: Internal Fragmentation Score: 1 out of 1 Yes Question 26 It is the segment table’s location in memory. Response: Segment-table base register (STBR) Score: 1 out of 1 Yes Question 27 It occurs when free memory exists to satisfy a request, and it is not contiguous to memory. Response: Segmentation Score: 0 out of 1 No Question 28 Which among is not a part of programs sharing segment which uses the same number to refer to its address. Response: Relocation is dynamic and done at execution time Score: 1 out of 1 Yes Question 29 In this recovery technique the process is to reverses system to the transactions of the involved processes to a time before the deadlock. Response: Rollback Score: 1 out of 1 Yes Question 30 One of these is not a process on how to enable physical address. Response: Create entries in page table to map each page to a frame Score: 1 out of 1 Yes Question 31 Main memory must support both ____________ and user processes Response: Kernel Score: 1 out of 1 Yes Question 32 It is a set when every process in the set is waiting for resources that are currently allocated to another process in the set. Response: Deadlocked/Deadlock Score: 1 out of 1 Yes Question 33 Yes or No: First-fit and best-fit is better than worst-fit in terms of speed and storage utilization. Response: Yes, First-fit and best-fit is better than worst-fit in terms of speed Only Score: 0 out of 1 No Question 34 It is the physical address where the segment resides. Response: Segment-table base register (STBR) Score: 0 out of 1 No Question 35 It contains a cycle with no pre-emption that say the system is in a Deadlock state. Response: Banker’s algorithms Score: 0 out of 1 No Question 36 It is a common technique for breaking deadlocks. Especially in database sys-tem problems. Response: Resource Pre-Emption Score: 0 out of 1 No Question 37 A process occupying at least one resource while pausing to acquire additional re-sources held by other processes. Response: Hold and wait Score: 1 out of 1 Yes Question 38 It preempts some resources from processes and gives those resources to other processes. Response: Resource Pre-Emption Score: 1 out of 1 Yes Question 39 This process allocates the largest hole. Response: Worst-fit Score: 1 out of 1 Yes Question 40 _________ is the one who can only access registers and main memory direct-ly Response: CPU Score: 1 out of 1 Yes Question 41 A call can be replaced by _________. Response: Stub Score: 1 out of 1 Yes Question 42 Swapping occurs when.? Response: Memory required exceeds physical memory in machine. Score: 1 out of 1 Yes Question 43 On this situation a resource can, be released only voluntarily by the process holding it, after that process has completed its task. Response: No pre-emption Score: 1 out of 1 Yes Question 44 Dynamic linking is particularly useful for _______ or shared libraries. Response: System Score: 1 out of 1 Yes Question 45 It is called the base address that define the physical memory address which is sent to the memory unit Response: Page offset Score: 1 out of 1 Yes Question 46 This graph shows both Processes and resources Response: Resource Allocation Graph Score: 1 out of 1 Yes Question 47 In this process only one job can use resources. Response: Mutual Exclusion Score: 1 out of 1 Yes Question 48 It is the process of stimulating allocation for determining the maximum possible amount of deadlock Response: Resource Allocation Graph Score: 0 out of 1 No Question 49 It is an address generated by the CPU. Response: Logical Score: 1 out of 1 Yes Question 50 It indicates the number of segments used by a program. Response: Segment-table length register (STLR) Score: 1 out of 1 Yes Question 51 This uses s-state check before allowing resource allocation for deadlock con-clusion.. Response: Banker’s algorithms Score: 1 out of 1 Yes Question 52 This graph emphasizes only process execution to determine the degree of deadlock Response: Resource Allocation Graph Score: 0 out of 1 No Question 53 ________ is where all libraries and program code combined into the binary program image Response: Static linking Score: 1 out of 1 Yes Question 54 In a set of processes where a cycle execution is present Response: Circular wait Score: 1 out of 1 Yes Question 55 Match Column A. with corresponding meaning in Column B. Response: Mutual Exclusion => Non-Sharable resources Response: Pre-emption => Force a process to stop Response: No Pre-emption => A process is holding a resource then that resource cannot be taken away from that process until the process voluntarily releases it. Response: Circular wait => Occurs when one or more processes wait in a circular order for the resources they require Response: Deadlock => A situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function. Response: Paging => It is a memory management scheme that eliminates the need for a contiguous allocation of physical memory. Response: Segmentation => Process is divided into Segments Response: Fragmentation => It is the process of dividing a computer file, such as a data file or an executable program file that are stored in different parts of a computer’s storage medium, such as its hard disc or RAM Response: Memory Management => It is the process of Operating System on how memory, used by multiple processes Response: Page table Implementation => It Translate (logical) page number to physical frame. Score: 10 out of 10 Yes Question 56 It is specifying the length of the segment. Response: Segment-table length register (STLR) Score: 0 out of 1 No Question 57 It defines the logical address space. Response: Base Score: 0 out of 1 No Question 58 This dynamic allocation problem shows that the hole is big enough for allocation.. Response: First-fit Score: 1 out of 1 Yes Question 59 A deadlock recovery technique, where higher priority is given to the process that already has the needed resources. Response: Priority Inversion Score: 1 out of 1 Yes Question 60 It is an address that is executed at the same time but differs in schemes. Response: Logical Score: 0 out of 1 No Question 61 It is the core part of an operating system. It acts as a bridge between software applications and hardware. Response: Kernel Score: 1 out of 1 Yes Question 62 It is the smallest legal address. Response: Base Score: 1 out of 1 Yes Question 63 This ____________ loading avoids loading until they are called. Response: Dynamic Score: 1 out of 1 Yes Question 64 It is hardware that maps logically to physical addresses at run time. Response: Memory Management Unit (MMU) Score: 1 out of 1 Yes Question 65 It occurs when reference is made to location in a memory. Response: Execution time binding Score: 1 out of 1 Yes Question 66 When multiple variable-partition allocation is done the OS maintain information about. Response: OS modification and updates. Score: 0 out of 1