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
If some one wants expert view concerning running a blog after that i suggest him/her to pay a quick visit this blog, Keep up the pleasant job.|
Have you ever thought about creating an ebook or guest authoring on other blogs? I have a blog based on the same ideas you discuss and would love to have you share some stories/information. I know my readers would value your work. If you’re even remotely interested, feel free to shoot me an email.|
Hi, for all time i used to check webpage posts here early in the dawn, for the reason that i love to gain knowledge of more and more.|
This piece of writing offers clear idea for the new viewers of blogging, that really how to do blogging.|
What’s up to all, it’s truly a pleasant for me to visit this web page, it consists of precious Information.|