Unformatted text preview: Chapter 1 Review '11 Binary and Hmdecimal Notation I Howdoyoutransform positive integersﬁ'omdeeimaltohinary notationandthe reverse? (1:. 59) How do you add and subtract integers using limos-3|r notation? (p. 50) What is a half-adder? (p. til) What is a hill—adder? (1:. d2) What is the 8-bit two's oomplement ofan integerinhinary notation? (p. dd) Hoar do you ﬁnd the 3-bit two's complement of a panties integer a that is at most 255? (p. a} a Hoar do you ﬁnd the decimal representation of the integer with a. given 8—bit two's complement?
(it 65) o How are negative integers represent-ed using two's complements? (p. Eli} a How is eamputer addition with negative integers performed? (pp. it'd-ft?) a How do you transform positive integers from hexadecimal to decimal notation? (p. TI} o How do you transﬁurm positive integers from binary to hexadecimal notation and the means?
(a. TE) . not: a note] notation? (p. m I...- Test Your Understanding: Chapter 1 Thstyourselibyﬂiiingintbeblanhs.
2.1fpandqarestatements,thestatement “photo" issymholiaedﬁg
3. prandqmststements, the statemmtt “neitherplsuitor"I issymbolised _.
4. Anondstatementistrueif,andonljrif, hothoomponeutsare_.
T. Astetementofthefonnpt—rqistrueif,andonl}rif _.
5 .Ii'a logicalenqareasion tuclndeatbssrmbolsw. our V,ﬁﬁtl—l-0r Handthe messioudoos
not include parentheses, then the ﬁrst operation to be performed is , the second is ,
and the third is _. To indicate the order of operations for an expression that includes both
A and V orhoth —I and H, it ist':l'equent13.rmoment-3|r toaddh___. 9. A. tautoiogy is for ever}r substitution of statements for the statement variables.
1!]. A contradiction is for every substitution of statements for the statement variables. 11.Twosmtanentformsuehgicaﬂyeqmvﬂentﬁ,andonlyﬂ,theirtruthmlnmare for
every substitution of statements for the statement sarishlea. 12. Leas formal torsion: Two statement forms are logicallyr eqlﬁiralent if. and only if. their alwairs have 13. Two statement forms are not logically equivalent if. and only if. . ...
View Full Document
- Fall '08
- Computer Science