Chapter 1: Problem 32
Use 8-bit representations to compute the sums in 31-36. $$ 62+(-18) $$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 1: Problem 32
Use 8-bit representations to compute the sums in 31-36. $$ 62+(-18) $$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
In addition to binary and hexadecimal, computer scientists also use octal notation (base 8) to represent numbers. Octal notation is based on the fact that any integer can be uniquely represented as a sum of numbers of the form \(d \cdot 8^{n}\), where each \(n\) is a nonnegative integer and each \(d\) is one of the integers from 0 to 7 . Thus, for example, \(5073_{8}=5 \cdot 8^{3}+0 \cdot 8^{2}+7 \cdot 8^{1}+3 \cdot 8^{0}=2619_{10} .\) a. Convert \(61502_{8}\) to decimal notation. b. Convert \(20763_{8}\) to decimal notation. c. Describe methods for converting integers from octal to binary notation and the reverse that are similar to the methods used in Examples 1.5.12 and 1.5.13 for converting back and forth from hexadecimal to binary notation. Give examples showing that these methods result in correct answers.
Let \(p\) be the statement "DATAENDFLAG is off,"' \(q\) the statement "ERROR equals 0 ," and \(r\) the statement "SUM is less than 1,000." Express the following sentences in symbolic notation. a. DATAENDFLAG is off, ERROR equals 0 , and SUM is less than \(1,000 .\) b. DATAENDFLAG is off but ERROR is not equal to \(0 .\) c. DATAENDFLAG is off; however ERROR is not 0 or SUM is greater than or equal to 1,000 . d. DATAENDFLAG is on and ERROR equals 0 but SUM is greater than or equal to 1,000 . e. Either DATAENDFLAG is on or it is the case that both ERROR equals 0 and SUM is less than 1,000 .
In 38-41 (a) use the logical equivalences \(p \rightarrow q \equiv \sim p \vee q\) and \(p \leftrightarrow q \equiv(\sim p \vee q) \wedge(\sim q \vee p)\) to rewrite the given statement forms without using the symbol \(\rightarrow\) or \(\leftrightarrow\), and (b) use the logical equivalence \(p \vee q \equiv \sim(\sim p \wedge \sim q)\) to rewrite each statement form using only \(\wedge\) and \(\sim\). $$ (p \rightarrow(q \rightarrow r)) \leftrightarrow((p \wedge q) \rightarrow r) $$
Represent the decimal integers in 1-6 in binary notation. 1609
Rewrite the statements in \(1-4\) in if-then form. Fix my ceiling or I won't pay my rent.
What do you think about this solution?
We value your feedback to improve our textbook solutions.