This preview shows pages 1–2. Sign up to view the full content.
ECSE2660 Computer Architecture, Networks, & Operating Systems, Spring 2001
Page 1 of 3
Activity #01 (solutions)
Last Name
First Name
Student ID Number
1.1
1.2
Total
Grader Initials
50 points
50 points
100 points
Activity 1.1 (First hour)
A. (5 points) Administrative matters
1. (3 points) Click on course syllabus, and note the course prerequisites. Check off the boxes that apply to you:
Y
I took ECSE 2610 (Computer Components and Operations)
Y
I took LITEC
Y
I took CSCI2500 (Computer Organization)
Y
Other (please see your instructor immediately)
Grading: 5 points for any answer. 0 pts for no answer.
Please hand the activities marked “other” to Prof. Roysam after grading.
2. (2 points) Do you have a learning disability that your instructor should be aware of?
Y
Nope.
Y
Yes, I have one.
Please contact your instructor immediately for further guidance.
Grading: 5 points for any answer. 0 pts for no answer.
Please hand the activities marked “yes” to Prof. Roysam after grading.
B. (30 points)
Recap of binary number representation
Grading policy for all questions: 2 pts for trying, 5 pts for correct answer.
1. (5 points)
77
10
= 0100 1101
2
= 115
8
= 4D
16
2. (5 points)
0110 0100
2
= 100
10
= 144
8
= 64
16
3. (5 points)
23
10
= __
1110 1001
__(eightbit, two’s complement)
4. (5 points) If you add 77
10
, and –23
10
using 8bit two’s complement arithmetic, do you get an overflow?
Nope – we can
never get an overflow adding numbers with opposite signs.
5. (5 points) What is the largest unsigned number that can be represented using 32 bits?___
2
32
1___
10
6. (5 points)What is the result of performing an arithmetic
right shift on the 8bit number representing 23
10
?
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '09
 WOZNY

Click to edit the document details