Consider the linear arrays XXX (-10:10), YYY (1935:1985), ZZZ (35).
(a) Find the number of element in each array.
(b) Suppose Base (YYY) = 400 and w=4 words per memory cell for YYY. Find the address of YYY [1942], YYY [1977] and YYY [1988].
Answer:
(a) Given Linear arrays are: XXX (-10:10), YYY(1935:1985) and ZZZ(35)
The number of elements is equal to the length. We can determine the length
By the following formula,
Length = UB – LB +1
For XXX the Upper Bound is 10 and the Lower Bound is -10
For YYY the Upper Bound is 1985 and the Lower Bound is 1935 and
For ZZZ the Upper Bound is 35 and Lower Bound is 1.
So,
Length (XXX) = UB (XXX) – LB (XXX) +1
= 10 – (-10) + 1
= 21
Then,
Length (YYY) = UB (YYY) – LB (YYY) +1
= 1985 – 1935 +1
= 51
And, Length (ZZZ) = UB (ZZZ) – LB (ZZZ) +1
= 35 – 1 +1
=35
(b) We know,
Address of any element of a linear array LA is determined by the formula,
LOC (LA[k]) = Base (LA) + w (k – lower bound)
Where,
Base (LA) = Base address of linear array LA.
w = Number of words per memory cell for the array LA
And k = Any elements of linear array LA
Given,
Base (YYY) = 400,
Lower Bound = 1935
And w = 4
SO, LOC (YYY [1942]) = 400 + 4(1942 – 1935)
= 428
LOC (YYY [1977]) = 400 + 4(1977 – 1935)
= 568
LOC (YYY [1988]) = 400 + 4(1988 – 1935)
= 612
you are really a just right webmaster. The site loading velocity is incredible. It seems that you’re doing any unique trick. In addition, The contents are masterpiece. you’ve performed a great activity in this matter!|
Oh my goodness! Awesome article dude! Thanks, However I am going through issues with your RSS. I don’t understand the reason why I cannot join it. Is there anybody else getting identical RSS issues? Anyone that knows the answer will you kindly respond? Thanx!!|
Simply desire to say your article is as surprising. The clarity to your put up is just cool and i can assume you’re a professional on this subject. Well together with your permission let me to snatch your feed to stay up to date with approaching post. Thanks one million and please keep up the rewarding work.|
Outstanding post however , I was wanting to know if you could write a litte more on this subject? I’d be very thankful if you could elaborate a little bit further. Thank you!|
Hiya very cool site!! Guy .. Excellent .. Wonderful .. I will bookmark your website and take the feeds additionally?
I’m satisfied to search out numerous useful info here within the
post, we’d like develop more strategies in this regard,
thanks for sharing. . . . . .