To do the question make up a few small examples and work through the details. He
ID: 3706238 • Letter: T
Question
To do the question make up a few small examples and work through the details. Here is one example:
n=7
a1=0
a2=200
a3=600
a4=1000
a5=1100
a6=1500
a7=1700
Initially each program i fits in the space between ai and a(i+1). After some processing time, some of the programs may need more or less space. The new memory requirements are:
l1=300
l2=100
l3=600
l4=200
l5=100
l6=300
l7=100
To understand the problem and this example:
List all of the ordered pairs in R.
Draw the Hasse diagram for R.
Identify a chain C that contains 1 and 7.
Show how to shift 7-|C| programs to satisfy the requirements with no overlapping.
3. (8 marks) A computer's memory holds programs 1 through n, where each program occupies t address a consecutive memory locations and no two programs overlap. Program z begins a for each 1-i-n, and al ? a2? ?an. After a certain amount to time, some of the programs change their memory requirements, with the new length of the ith program being It might be necessary to shift some of the programs to satisfy the new memory requirements with no programs overlapping. Suppose that the programs must remain in the same order. Further, suppose that the starting addresses of programs 1 and n cannot be changed, and that programs 1 through n - 1 with their new memorv requirements can fit into the space between ai and an, that is, L1 + l2 + + Ln-1 K an - ai Let R be a relation on 11,2,... ,n) where: (i,j) ER » iExplanation / Answer
Solution:
Given that,
a: R is considered to be anti- symmetric relationship in all condition i,j become to A, if iRj and jRi then i=j considered to be partial order relationship if R lies in between the reflexive, anti-symmetric and transitive relationship. Let R{ (i,j)/j = 2i) and R= (i,j) i=2ki) referring to same non - negative integer and considered to be in binary relationship with the natural number n . so it is justified that R is in a partial order relationship.
b. Here C is considered to be part of partially order set 'a' which contain consequence memory allocation from (1,2,...,n) which is in relationship with R such that set of consecutive memory allocated can be allowed within set . If number of consecutive memory allocation within 'a' becomes available by shifting n-mod c towards right without overlapping the memory allocation of the other program.
'C' is subset of a partially order set a. If number elements in 'c' are a part of 'a' and both are considered to be partial reationship with 'R'.
Thus the given statement is considered as true.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.