Scribd
Upload
50 views1 page

As2 2023

This document provides the requirements and questions for Assignment 2 of the ELEC8550: Computer Arithmetic course at the University of Windsor. The assignment consists of 10 questions across 4 chapters related to computer arithmetic topics like decimal and binary number representations, arithmetic operations, floating point representations, and rounding schemes. Students are asked to organize their solutions into a single PDF or Word file and submit it through Brightspace by the due date of Tuesday, October 10, 2023.

Uploaded by

dhruv kakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views1 page

As2 2023

This document provides the requirements and questions for Assignment 2 of the ELEC8550: Computer Arithmetic course at the University of Windsor. The assignment consists of 10 questions across 4 chapters related to computer arithmetic topics like decimal and binary number representations, arithmetic operations, floating point representations, and rounding schemes. Students are asked to organize their solutions into a single PDF or Word file and submit it through Brightspace by the due date of Tuesday, October 10, 2023.

Uploaded by

dhruv kakkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Fall 2023 ELEC8550: Computer Arithmetic U.

Windsor

Assignment 2
Due: Tuesday, Oct 10, 2023

Requirements:

• Organize your assignment solution into one single file in PDF or Microsoft Word format. Note
that image format (incl. jpg etc) is not acceptable, however, you may convert jpg files to one
single pdf file and then submit the pdf file.
• Submission must be conducted on-line through Brightspace.

1. (Chapter 2, 10 marks) Given two decimal numbers ±873.6410 . Find the representations for
the two numbers with respect to the negative decimal system.
2. (Chapter 2, 10 marks) Perform arithmetic operations 1389−10 + 4703−10 and 1389−10 −
4703−10 .
3. (Chapter 2, 10 marks) Find the representations for two numbers ±10.2510 with respect to the
negative binary system.
4. (Chapter 3, 10 marks) Represent A = −310 and X = −710 in 4-bit 2’s complement repre-
sentation and then use sequential multiplication algorithm (Algorithm 2) to obtain the product
A × X.
5. (Chapter 3, 10 marks) Let X = (0.100000)2 = 1/2 and D = (0.101)2 = 5/8. Use Algo-
rithm 3 to obtain the quotient Q = (0.q1 q2 · · · qm )2 and the remainder R = 2−m rm .
6. (Chapter 3, 10 marks) Let X = 3210 = (100000)2 and D = 510 = (0101)2 . Use Algorithm 4
to obtain the quotient Q and the remainder R = rm .
7. (Chapter 4, 10 marks) Find the normalized floating-point representations for F1 = −88.510
and F2 = 0.187510 in single-precision IEEE format.
8. (Chapter 4, 10 marks) Follow the last problem and perform floating point multiplication
F3 = F1 × F2 .
9. (Chapter 4, 10 marks) Let a round-to-the-nearest-integer unit be given with the input X =
x1 x0 .x−1 and the output as an integer. Draw a table to show output value for an input, and
then draw a block diagram for this rounding unit using full adders (FAs) and/or necessary
logic gates.
10. (Chapter 4, 10 marks) Find the maximal positive and negative errors and the bias for ROM
rounding scheme with l = 4 and d = 1.

Dr. H. Wu -1-

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy