السلام عليكم ورحمة الله وبركاته
انا هذي اول مشاركة لي وااتمنى انكم تساعدوني
عندي مجموعه من الاسئله وابي حل لها لانه عندي اختبارفيها يوم الثلاثاء يعني مافيه وقت بس يوم واحد
الله يجزاه خير اللي يساعدني
الاسئله هم :
1: Show the representation for (305)10 using three BCD digits
2. For the following single precision IEEE 754 bit patterns
show the numerical
value as a base 2 significand with an exponent (e.g. 1.11 25).´
a) 0 10000011 01100000000000000000000
b) 1 10000000 00000000000000000000000
c) 1 00000000 00000000000000000000000
d) 1 11111111 00000000000000000000000
e) 0 11111111 11010000000000000000000
f ) 0 00000001 10010000000000000000000
g) 0 00000011 01101000000000000000000
3: Show the IEEE 754 bit patterns for the following numbers:
25 (single precision)´a) +1.1011
b) +0 (single precision)
c) 1 (double precision)-2´1.00111 -
NaN (single precision)-d)
4. A memory has 224 addressable locations. What is the
smallest width in
bits that the address can be while still being able to address all 224 locations?
5: What are the lowest and highest addresses in a 220 byte memory, in which
a four-byte word is the smallest addressable unit?
6: A section of ARC assembly code is shown below. What does it do? Express
your answer in terms of the actions it goes through. Does it add up numbers,
or clear something out? Does it simulate a for loop, a while loop, or something
else? Assume that a and b are memory locations that are defined elsewhere
in the code.
Y: ld [k], %r1
addcc %r1, -4, %r1
st %r1, [k]
bneg X
ld [a], %r1, %r2
ld , %r1, %r3
addcc %r2, %r3, %r4
st %r4, %r1, [c]
ba Y
X: jmpl %r15 + 4, %r0
k: 40
** اللي يعرف اجابه اي سؤال يحله مو لازم يحل كل الاسئله لو شي بسيط الحل يكون
