D) none of the mentioned 30. Because of virtual memory, the memory can be shared [ ] A) processes B) threads C) instructions D) none of the mentioned 31. The pager concerns with the [ ] A) individual page of a process B) entire process C) entire thread D) first page of a process 32. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then [ ] A) segmentation fault occurs B) fatal error occurs C) page fault occurs D) no error occurs 33. In FIFO page replacement algorithm, when a page must be replaced [ ] A) oldest page is chosen B) newest page is chosen C) random page is chosen D) none of the mentioned 34. A process is thrashing if [ ] A) it is spending more time paging than executing B) it is spending less time paging than executing C) page fault occurs D) swapping cannot take 35. Which one of the following is the deadlock avoidance algorithm? [ ] A) banker’s algorithm B) round-robin algorithm C) elevator algorithm D) karn’s algorithm 36. For effective operating system, when to check for deadlock? [ ] A) every time a resource request is made B) at fixed time intervals C) both (A) and (B) D) none of the mentioned 37. A problem encountered in multitasking when a process is perpetually denied necessary resources is called A) deadlock B) starvation C) inversion D) aging 38. The request and release of resources are ___________. [ ] A) command line statements B) interrupts C) system calls D) special programs 39. Multithreaded programs are: [ ] A) lesser prone to deadlocks B) more prone to deadlocks C) not at all prone to deadlocks D) None of these Process is defined as____________________________ [ ] A)static program B)running program C)both D)none
D) none of the mentioned 30. Because of virtual memory, the memory can be shared [ ] A) processes B) threads C) instructions D) none of the mentioned 31. The pager concerns with the [ ] A) individual page of a process B) entire process C) entire thread D) first page of a process 32. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then [ ] A) segmentation fault occurs B) fatal error occurs C) page fault occurs D) no error occurs 33. In FIFO page replacement algorithm, when a page must be replaced [ ] A) oldest page is chosen B) newest page is chosen C) random page is chosen D) none of the mentioned 34. A process is thrashing if [ ] A) it is spending more time paging than executing B) it is spending less time paging than executing C) page fault occurs D) swapping cannot take 35. Which one of the following is the deadlock avoidance algorithm? [ ] A) banker’s algorithm B) round-robin algorithm C) elevator algorithm D) karn’s algorithm 36. For effective operating system, when to check for deadlock? [ ] A) every time a resource request is made B) at fixed time intervals C) both (A) and (B) D) none of the mentioned 37. A problem encountered in multitasking when a process is perpetually denied necessary resources is called A) deadlock B) starvation C) inversion D) aging 38. The request and release of resources are ___________. [ ] A) command line statements B) interrupts C) system calls D) special programs 39. Multithreaded programs are: [ ] A) lesser prone to deadlocks B) more prone to deadlocks C) not at all prone to deadlocks D) None of these Process is defined as____________________________ [ ] A)static program B)running program C)both D)none