Lab 2 - FL13 - ECE 198 JL - University of Illinois - Engineering Wiki

2 3 4 100 199 1000 243 21000 22000 32767 1 5 32767

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: mmit and c hec k y our s ubmis s ion.) Signed integer computation In s igned 16-bit mode, run the following c omputations with b inc alc : 1. 2. 3. 4. 100 - 199 1000 + 243 21000 + 22000 32767 + 1 5. -32767 - 1 Ans wer the following ques tions in lab2.tx t: 1. 2. 3. 4. W hat is the larges t value repres entable in 16-bit s igned format? Smalles t? W hat is the res ult of the third c omputation? W hy ? W hy does the fourth c omputation overflow, but not the fifth? If y ou were to s tart at 0, and inc rement repeatedly (add 1), what pattern would y ou s ee (in s igned mode)? Unsigned integer computation In uns igned 16-bit mode, run the following c omputations : 1. 100 - 199 2. 21000 + 22000 3. 32767 + 1 Ans wer the following ques tions in lab2.tx t: 1. 2. 3. 4. 5. W hat is the larges t value repres entable in 16-bit uns igned format? Smalles t? W hat res ult do y ou get from the firs t c omputation? W hy ? W hy does n't the s ec ond or third c omputation overflow? If y ou were to s tart at 0, and inc rement repeatedly (add 1), what patter...
View Full Document

Ask a homework question - tutors are online