Bissoy.com
Doctors Medicines MCQs Q&A

When in contiguous allocation the space cannot be extended easily?

When in contiguous allocation the space cannot be extended easily? Correct Answer the contents of the file have to be copied to a new space, a larger hole

Related Questions

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? I. Contiguous II. Linked III. Indexed
Contiguous allocation has two problems _________ and _________ that linked allocation solves.
Read the following passage carefully and then choose the right word to complete the sentence that follows. Rockets are very expensive as it can be used only once. Appled scientists have therefore develped a reusable space craft called a space shuttle which takes off like a rocket; however, does no get destroyed as it returns to earth. It can also be used to lunch satellired into space, retrieve them from space if any repairing os required and allow around 8 scientists to crryout experiments in space. The space shuttle does not get.
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state: REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?
In a system, there are three types of resources and four processes that execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[ ] is the maximum number of instances of that would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available. Allocation   E F G P0 1 0 1 P1 1 1 2 P2 1 0 3 P3 2 0 0   Max   E F G P0 4 3 1 P1 2 1 4 P2 1 3 3 P3 5 4 1   From the perspective of deadlock avoidance, which one of the following is true?
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
If A and B is causally related, then which among the following is not the necessary and sufficient condition of A becoming the cause of B according to Hume.
1. A be precedent and contiguous to B
2. Events resembling A be precedent and contiguous to events resembling B
3. The idea of A be followed by the idea of B
4. The idea of A be associated with the idea of B
5. B must be present in A
Read the given statements and conclusions carefully. Assuming that the information given in the statements is true, even if it appears to be at variance with commonly known facts, decide which of the given conclusions logically follow(s) from the statements. Statements: All Matter is Space. Some Mass is Matter. Conclusions: A. All Mass is Space. B. Some Mass is Space. C. Some Space is Mass. D. All Space is Mass. E. All Matter is Mass.
Steps given are to draw an involute of a given triangle ABC. Arrange the steps. i. With C as centre and radius C1 draw arc cutting AC-extended at 2. ii. With A as center and radius A2 draw an arc cutting BA- extended at 3 completing involute. iii. B as centre with radius AB draw an arc cutting the BC- extended at 1. iv. Draw the given triangle with corners A, B, C.