………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

………. Involves treating main memory as a resource to be allocated to and shared among a  number of active processes.  
A) Partition management
B) Memory management
C) Disk management
D) All of the above
by

1 Answer

Answer :

B) Memory management
by

Related questions

A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Description : A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Last Answer : C) real memory, virtual memory

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use a resource at a time. A) i-a, ii-b, iii-c B) i-a, ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Description : Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use ... , ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Last Answer : D) i-c, ii-a, iii-b

The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively. (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Description : The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly ... message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Last Answer : (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. 

Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Description : Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also ... memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Last Answer : Answer: C Explanation: T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s Ninstr x 1µs = 60,000,000 µs - 30,000,000 µs = 30,000,000 µs Ninstr = 30,000,000 The number of instruction ... doesn't mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.

The reasons leading to popularity of client-server systems are: A) More powerful workstations on LANs B) Needed for graphical user interfaces of end users. C) Remove computing load for presentation services from the system managing a shared database resource. D) All

Description : The reasons leading to popularity of client-server systems are: A) More powerful workstations on LANs B) Needed for graphical user interfaces of end users. C) Remove computing load for presentation services from the system managing a shared database resource. D) All

Last Answer : D) All

What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system performance is gained B. Shorter response time for queries is achieved C. Large sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Description : What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system ... sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Last Answer : A. Higher system performance is gained

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Description : Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Last Answer : (B) 14

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

…………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Description : …………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Last Answer : A) Mutual Exclusion

Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Description : Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Last Answer : (D) Kill one of the processes

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Description : Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U ... No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Last Answer : (C) Yes, D, E, G

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is inexpensive to implement. (1) (A), (B) and (C) are false. (2) (A) and (B) false; (C) true. (3) (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Description : Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is ... (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Last Answer : Answer: 3

What type of resource is most likely to be a shared common resource in a computer Network? a) Printers b) Speakers c) Floppy disk drives d) Keyboards

Description : What type of resource is most likely to be a shared common resource in a computer Network? a) Printers b) Speakers c) Floppy disk drives d) Keyboards

Last Answer : a) Printers

The ............... transfers the executable image of a C++ program from hard disk to main memory. (A) Compiler (B) Linker (C) Debugger (D) Loader

Description : The ............... transfers the executable image of a C++ program from hard disk to main memory. (A) Compiler (B) Linker (C) Debugger (D) Loader

Last Answer : (D) Loader

Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. (B) Message buffers are allocated dynamically. (C) The PVM communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages. (D) In PVM Model, the message order is not preserved.

Description : Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. ... of such messages. (D) In PVM Model, the message order is not preserved. 

Last Answer : (D) In PVM Model, the message order is not preserved.

A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Last Answer : (B) 335 K

In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Last Answer : (C) Shared memory segments 

Which of the following is the storage area whit in the computer itself which Holds data only Temporarily as the computer processes instructions? 1) The Hard Disk 2) Main Memory 3) The Control unit 4) Read Only Memory

Description : Which of the following is the storage area whit in the computer itself which Holds data only Temporarily as the computer processes instructions? 1) The Hard Disk 2) Main Memory 3) The Control unit 4) Read Only Memory

Last Answer : 4) Read Only Memory

Which of the following is not valid with reference to Message Passing Interface (MPI)? (A) MPI can run on any hardware platform (B) The programming model is a distributed memory model. (C) All parallelism is implicit. (D) MPI - Comm - Size returns the total number of MPI processes in specified communication.

Description : Which of the following is not valid with reference to Message Passing Interface (MPI)? (A) MPI can run on any hardware platform (B) The programming model is a distributed memory model. (C) All ... implicit. (D) MPI - Comm - Size returns the total number of MPI processes in specified communication.

Last Answer : (C) All parallelism is implicit.

In resource allocation, the resources are allocated to a project in order that the…...............are attained a. Goals b. Objectives c. Both a, b d. None of the above

Description : In resource allocation, the resources are allocated to a project in  order that the…...............are attained a. Goals b. Objectives c. Both a, b d. None of the above

Last Answer : c. Both a, b

_________ is a data area shared by hardware devices or program processes that operate at different speeds or with different sets of priorities. A. Flash memory B. Virtual memory C. Buffer D. None of the Above

Description : _________ is a data area shared by hardware devices or program processes that operate at different speeds or with different sets of priorities. A. Flash memory B. Virtual memory C. Buffer D. None of the Above

Last Answer : C. Buffer

The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Description : The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Last Answer : A) Fetch policy

What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions (C) It is a chip to map virtual address to physical address (D) It is an algorithm to allocate and deallocate main memory to a process

Description : What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions ... to physical address (D) It is an algorithm to allocate and deallocate main memory to a process 

Last Answer : (C) It is a chip to map virtual address to physical address

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Last Answer : (C) R(Pi)∩R(Pj)=Φ 

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Description : File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : B) i, iii and iv only

In computer processing, ______ selects processes from the pool and loads them into memory for execution. (1) Job Scheduler (2) Resource Scheduler (3) CPU Scheduler (4) Process Scheduler

Description : In computer processing, ______ selects processes from the pool and loads them into memory for execution. (1) Job Scheduler (2) Resource Scheduler (3) CPU Scheduler (4) Process Scheduler

Last Answer : Job Scheduler

Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2. S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A Image Which of the following is true ? (A) S1 is NP problem and S2 is P problem. (B) S1 is NP problem and S2 is NP problem. (C) S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Description : Given the following statements :  S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2.  S2 : The set-partition problem takes as input a set S of numbers and ... S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Last Answer : (B) S1 is NP problem and S2 is NP problem.

The directory can be viewed as .................... that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache

Description : The directory can be viewed as .................... that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache

Last Answer : (A) Symbol table

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

Describe how memory is allocated to objects of class with suitable diagram.

Description : Describe how memory is allocated to objects of class with suitable diagram.

Last Answer : Description: The memory space for object is allocated when they are declared and not when the class is specified. Actually, the member functions are created and placed in memory space only once when ... variables will hold different data values for different objects this is shown in fig:  

The................. layer is responsible for resolving access to the shared media or resources. A) Physical B) Mac sub layer C) Network D) Transport

Description : The................. layer is responsible for resolving access to the shared media or resources. A) Physical B) Mac sub layer C) Network D) Transport

Last Answer : B) Mac sub layer

The ……………… layer is responsible for resolving access to the shared media or resources. A) Physical B) Mac sub layer C) Network D) Transpor

Description : The ……………… layer is responsible for resolving access to the shared media or resources. A) Physical B) Mac sub layer C) Network D) Transpor

Last Answer : B) Mac sub layer

A pure ALOHA Network transmit 200 bit frames using a shared channel with 200 Kbps bandwidth. If the system (all stations put together) produces 500 frames per second, then the throughput of the system is .............. (A) 0.384 (B) 0.184 (C) 0.286 (D) 0.586

Description : A pure ALOHA Network transmit 200 bit frames using a shared channel with 200 Kbps bandwidth. If the system (all stations put together) produces 500 frames per second, then the throughput of the system is .............. (A) 0.384 (B) 0.184 (C) 0.286 (D) 0.586

Last Answer : (B) 0.184

Which of the following is NOT a purpose of a marketing plan? A)it specifies how resources are to be allocated B)it co -ordinates marketing and production activities C)it assigns responsibilities, tasks and timing D)it assists in management

Description : Which of the following is NOT a purpose of a marketing plan? A)it specifies how resources are to be allocated B)it co-ordinates marketing and production activities C)it assigns responsibilities, tasks and timing D)it assists in management

Last Answer : B)it co-ordinates marketing and production activities

........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : ........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : A) Monolithic kernel

Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Description : Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Last Answer : A) File management

........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Description : ........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Last Answer : B) Monolithic kernel

Working set model is used in memory management to implement the concept of (A) Swapping (B) Principal of Locality (C) Segmentation (D) Thrashing

Description : Working set model is used in memory management to implement the concept of (A) Swapping (B) Principal of Locality (C) Segmentation (D) Thrashing

Last Answer : (B) Principal of Locality

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

A part of Windows 2000 operating system that is not portable is (A) Device Management (B) Virtual Memory Management (C) Processor Management (D) User Interface

Description : A part of Windows 2000 operating system that is not portable is (A) Device Management (B) Virtual Memory Management (C) Processor Management (D) User Interface

Last Answer : (B) Virtual Memory Management

Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Description : Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Last Answer : Answer: A

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Description : A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main ... replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Last Answer : (C) 9 and 8

In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Description : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Last Answer : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves ... A. 2 B. 3 C. 4 D. 1

In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Description : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Last Answer : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves ... 0` C. `0.0` D. `3.0`

In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Description : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method involves treating the complex with

Last Answer : In coordination chemistry there are a veriety of methods applied to find out the structure of complexes. One method ... BM C. 4.9 BM D. 5.9 BM