0
What else can I help you with?
WHAT IS SINGLE USER CONTIGUOS SCHEME?
Single user contiguous scheme is a memory allocation technique where a single block of contiguous memory is allocated to a process. This means that the entire memory space needed by a process must be available in a single block without any breaks or fragmentation. It simplifies memory management but can lead to wastage of memory due to fragmentation.
What is a heavyweight?
Each process (Linux, windows) gets own memory although this not be fully so on process switch we have to use the different CPU registers and the different memory map .this is probably to mean that a new collection of pages must be to be cache from main memory or even from disk.
What is memory allocation?
Memory allocation is the act of reserving a chunk of memory for some set of data. In programming terms, this is normally done by declaring a variable. Large arrays of data will require large blocks of contiguous memory, which the programmer must request from the operating system.
Before a computer can process data where must data be stored?
I'm guessing RAM Random access memory
What is the significance of ''process''in an operating system environment?
Process is a programm under execution in main memory. Or in other world when a user wants to execute a programm which resides on secondary memory it must be placed in to the primary memory for the execution then it is called as process.
Is system operation is the process of operating system?
Process is a programm under execution in main memory. Or in other world when a user wants to execute a programm which resides on secondary memory it must be placed in to the primary memory for the execution then it is called as process.
Can perception and memory be seen as constructive processes?
Yes, perception and memory can be seen as constructive processes. To be considered a constructive process the idea of accuracy in perception and memory must be displaced.
Is necessary when a printer does not have its own internal memory?
When a printer does not have its own internal memory, the computer memory must do the work. The work is then transferred in chunks that the printer can handle. This does compromise the speed of the process.
What is the difference between Light-weight process and heavyweight process?
Light weight process are the process are the processes which is considered for the os as less burden like thread.means the threads are executing inside a process which share the same code and data also memory space of a single process that's it has a less burden to the os and considered as a light weight process.also the communication between the threads are much more efficient. where as in case of a heavy weight process for doing multiple task the os has to create multiple processes which have a multiple memory address space and for communication between them they have to use inter process communication using sockets and pipe and which has more burden on the os than the threads(ligt weight processes) and hence considered as a heavy weight process
What is contiguous memory in c plus plus?
Contiguous memory refers to a single block of consecutive memory addresses. All data types larger than a char require contiguous memory addresses. For any given data type T, sizeof (T) tells us how many bytes of contiguous memory will be allocated to an object of that type: std::cout << "sizeof (char) == " << sizeof (char) << std::endl; std::cout << "sizeof (int) == " << sizeof (int) << std::endl; std::cout << "sizeof (double) == " << sizeof (double) << std::endl; struct X {/* ... */}; std::cout << "sizeof (X) == " << sizeof (X) << std::endl; When we speak of contiguous memory, we don't usually refer to the number of bytes allocated to a given type; it can be taken as read that those bytes will be allocated contiguously such that the low-order byte refers to the whole object, regardless of its length. Typically we use the term contiguous memory when referring to an array of objects. All objects in an array (the array elements) are exactly the same length (in bytes) and because they are allocated contiguously it is trivial to calculate the offset address of any one element relative to any other element in the same array. This is precisely how the array suffix operator works using only a zero-based index; the operator is nothing more than a convenient method of implementing pointer arithmetic. The upshot is that all arrays permit constant-time random access to any element in the array. Arrays are dense data structures. That is, there is no additional memory required to maintain the structure. The only information we need to keep track of is the start address and the number of elements. However, the downside of contiguous memory allocations is that whenever we wish to increase the amount of memory allocated we often have to move the entire allocation to new memory. The larger the allocation the more costly this becomes. Moreover, inserting new data means we must move elements to make room. This is why variable-length arrays typically reserve additional memory for moderate expansion while new elements are always pushed onto the end of the array rather than inserted in the middle. Linked-lists are non-contiguous data structures which make use of additional memory to maintain links between the elements. As such, the elements need not move once allocated. If we want to change the element sequence or insert a new element into the sequence we simply update the affected links; the elements themselves remain wherever they were originally allocated. Some data structures make use of both contiguous and non-contiguous allocations. A deque (a double-ended queue, pronounced deck) is a typical example because it is usually implemented as a linked-list of separate arrays. Each array is contiguous but the list of arrays is not necessarily contiguous.
How many pages does Tamburlaine Must Die have?
Tamburlaine Must Die has 160 pages.
How many pages does The King Must Die have?
The King Must Die has 352 pages.
