Scribd
Upload
106 views2 pages

CSC 105 Remedial Midterm Exam Key

This document contains the answer key for a remedial midterm exam on computer architecture and organization. It includes worked out solutions to floating point operations with 7 mantissa bits showing the guard, round, sticky and base exponent. It also contains the binary and decimal representations of several numbers in memory as either signed or unsigned integers, and the IEEE single precision floating point representations of -1.510 and -42.510.

Uploaded by

Melanie Dela Torre
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
106 views2 pages

CSC 105 Remedial Midterm Exam Key

This document contains the answer key for a remedial midterm exam on computer architecture and organization. It includes worked out solutions to floating point operations with 7 mantissa bits showing the guard, round, sticky and base exponent. It also contains the binary and decimal representations of several numbers in memory as either signed or unsigned integers, and the IEEE single precision floating point representations of -1.510 and -42.510.

Uploaded by

Melanie Dela Torre
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CSC 105 – ARCHITECTURE AND ORGANIZATION

Remedial Midterm Exam


Test Questionnaire – Answer Key
2nd Semester, 2020-2021

Name: CHRISTINE L. BACLAY


A. Floating-Point Operation (Guard, Round, Sticky). Show your Solution.

1. Perform the computation 11.101010111 2 x27 + 1.0010110012 x25 to seven (7) mantissa bits (use round
to nearest, ties to even if needed). (Max score = 9 pts.)

G R S BaseExp
Operand 1 1.110101 1 1 1 X28
Operand 2 0.001001 1 1 1 X28
Sum 1.111111 1 1 0 X28
Sum(normalize 1.111111 X28
)

2. Perform the computation 1.01111100102 x25 + 1.00111111102 x23 to seven (7) mantissa bits (use
round to nearest, ties to even if needed). (Max score = 9 pts.)

G R S BaseExp
Operand 1 1.011111 0 1 1 X25
Operand 2 0.010011 1 1 1 X25
Sum 1.110011 0 1 0 X25
Sum(normalize 1.110011 X25
)

3. Perform the computation 4.216437 x103 x 5.242714 x105 to seven (7) mantissa bits (use round to
nearest, ties to even if needed). (Max score = 9 pts.)

G R S BaseExp
Operand 1 5.242714 0 0 0 X105
Operand 2 0.042164 3 7 0 X105
Product 0.221055 7 3 2 X1010
Product(normalize) 0.221056 X1010

4. Perform the computation 754321.7641 - 654321.956 to seven (7) mantissa bits (use round to nearest,
ties to even if needed). (Max score = 7 pts.)

G R S BaseExp
5
Operand 1 7.543217 6 4 1 X10
Operand 2 6.543219 5 6 0 X105
Sum 0.999998 0 8 1 X105
Sum(normalize 0.999998 X105
)
B. Understanding memory representation: If the number cannot be represented, write “N/A”.
(1 pt. each) Show your Solution

Memory Decimal
representation Viewed as Binary Equivalent Equivalent
(in hex)
FFFFFFF08 Signed integer 11111000 -8
FFFFFFF08 Unsigned integer 1111 1111 1111 6,871,947,426
1111 1111 1111
1111 0000 1000
FE Signed integer 0010 -2
FE Unsigned integer 1111 1110 254
7FB00000 Single Float 0111 1111 1011 2,142,240,768
0000 0000 0000
0000 0000

C. Floating Point Representation. Show your Solution.

1. Express -1.510 using IEEE Single Precision Format. (Max score = 8 pts.)

Sign Bit Exponent Mantissa Representation Hex Value


Representation
1 01111111 10000000000000000000000 BFC00000h

2. Express -42.510 using IEEE Single Precision Format. (Max score = 8 pts.)

Sign Bit Exponent Mantissa Representation Hex Value


Representation
1 10000100 01010100000000000000000 C22A0000h

You might also like