Essentials of Computer Organization and Architecture
Essentials of Computer Organization and Architecture
4th Edition
ISBN: 9781284074482
Author: Linda Null, Julia Lobur
Publisher: Jones & Bartlett Learning
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 2, Problem 8RETC

Explanation of Solution

Fours ways of representing signed integers:

  • Signed magnitude representation
  • One’s complement representation
  • Two’s complement representation
  • Excess-M representation

Signed magnitude representation:

In signed magnitude representation, an extra bit is used to represent the sign of the number. This extra bit is called sign bit.

  • The Most Significant Bit (MSB) in the binary number is referred as sign bit.
  • In the signed magnitude representation, if the MSB is 0 it is treated as positive sign and if the MSB is 1 it is treated as negative sign.

For example:

Consider the decimal number 36 and can be represented as 00100100 and the -36 can be represented as 10100100.

One’s complement:

The binary numbers can be represented using one’s complement. Here, the value of every binary digit is complemented that is if the value is 1, it becomes 0 and if the value is 0 it becomes 1.

For example:

Consider the binary number 1101, the one’s complement of the given number is 0010.

Two’s complement:

Two’s complement is another way of representing the binary numbers. To implement the two’s complement to the number, the given binary number should be one’s complemented and then add 1 to the result obtained after one’s complement...

Blurred answer
Students have asked these similar questions
Consider the following database for some store: Customers (cid, cname, city, discount)Agents (aid, aname, city, percent)Products (pid, pname, city, quantity, price)Orders (ordno, mon, cid, aid, pid, qty, dollars) The relation Customers records the ID (cid), name (cname), location (city) of each customer and a discount percentage (discount) for this customer. The relation Agents records the ID (aid), name (aname), location (city) of each agent and a transaction fee (percent) charged by this agent. The relation Products lists the ID (pid), name (pname), location (city), quantity and price of available products. And finally, the relation Orders contains a unique order number (ordno), the month (mon), customer (cid), agent (aid), product (pid), quantity (qty) of each order as well as the total value (dollars) of the transaction.   1. Express the following query in SQL (a) List customers (names) who do not have discounts but purchased at least one product of price greater than $50. (b) Find…
Consider the following relational schema and briefly answer the questions that follow:   Emp(eid: integer, ename: string, age: integer, salary: real)  Works(eid: integer, did: integer, pct_time: integer)  Dept(did: integer, budget: real, managerid: integer)      a. Define a table constraint on Dept that will ensure that all managers have age > 30. b. Write SQL statements to delete all information about employees whose salaries exceed that of the manager of one or more departments that they work in. Be sure to ensure that all the relevant integrity constraints are satisfied after your updates.
Consider the following relations:     Student(snum: integer, sname: string, rmajor: string,          level: string, age: integer)   Class(cname: string, meets_at: time, room: string, fid: integer)   Enrolled(snum: integer, cname: string)   Faculty(fid: integer, fname: string, deptid: integer)     The meaning of these relations is straightforward; for example, Enrolled has one record per student-class pair such that the student is enrolled in the class.     2. Express each of the following integrity constraints in SQL unless it is implied by the primary and foreign key constraint; if so, explain how it is implied. If the constraint cannot be expressed in SQL, say so. For each constraint, state what operations (inserts, deletes, and updates on specific relations) must be monitored to enforce the constraint.   (a) Every faculty member must teach at least two courses. (b) Every student must be enrolled in the course called 'Math101'. (c) A student cannot add more than two courses at a time…

Chapter 2 Solutions

Essentials of Computer Organization and Architecture

Ch. 2 - Prob. 7RETCCh. 2 - Prob. 8RETCCh. 2 - Prob. 9RETCCh. 2 - Prob. 10RETCCh. 2 - Prob. 11RETCCh. 2 - Prob. 12RETCCh. 2 - Prob. 13RETCCh. 2 - Prob. 14RETCCh. 2 - Prob. 15RETCCh. 2 - Prob. 16RETCCh. 2 - Prob. 17RETCCh. 2 - Prob. 18RETCCh. 2 - Prob. 19RETCCh. 2 - Prob. 20RETCCh. 2 - Prob. 21RETCCh. 2 - Prob. 22RETCCh. 2 - Prob. 23RETCCh. 2 - Prob. 24RETCCh. 2 - Prob. 25RETCCh. 2 - Prob. 26RETCCh. 2 - Prob. 27RETCCh. 2 - Prob. 28RETCCh. 2 - Prob. 29RETCCh. 2 - Prob. 30RETCCh. 2 - Prob. 31RETCCh. 2 - Prob. 32RETCCh. 2 - Prob. 33RETCCh. 2 - Prob. 34RETCCh. 2 - Prob. 1ECh. 2 - Prob. 2ECh. 2 - Prob. 3ECh. 2 - Prob. 4ECh. 2 - Prob. 5ECh. 2 - Prob. 6ECh. 2 - Prob. 7ECh. 2 - Prob. 8ECh. 2 - Prob. 9ECh. 2 - Prob. 10ECh. 2 - Prob. 11ECh. 2 - Prob. 12ECh. 2 - Prob. 13ECh. 2 - Prob. 14ECh. 2 - Prob. 15ECh. 2 - Prob. 16ECh. 2 - Prob. 17ECh. 2 - Prob. 18ECh. 2 - Prob. 19ECh. 2 - Prob. 20ECh. 2 - Prob. 21ECh. 2 - Prob. 22ECh. 2 - Prob. 23ECh. 2 - Prob. 24ECh. 2 - Prob. 25ECh. 2 - Prob. 26ECh. 2 - Prob. 27ECh. 2 - Prob. 29ECh. 2 - Prob. 30ECh. 2 - Prob. 31ECh. 2 - Prob. 32ECh. 2 - Prob. 33ECh. 2 - Prob. 34ECh. 2 - Prob. 35ECh. 2 - Prob. 36ECh. 2 - Prob. 37ECh. 2 - Prob. 38ECh. 2 - Prob. 39ECh. 2 - Prob. 40ECh. 2 - Prob. 41ECh. 2 - Prob. 42ECh. 2 - Prob. 43ECh. 2 - Prob. 44ECh. 2 - Prob. 45ECh. 2 - Prob. 46ECh. 2 - Prob. 47ECh. 2 - Prob. 48ECh. 2 - Prob. 49ECh. 2 - Prob. 50ECh. 2 - Prob. 51ECh. 2 - Prob. 52ECh. 2 - Prob. 53ECh. 2 - Prob. 54ECh. 2 - Prob. 55ECh. 2 - Prob. 56ECh. 2 - Prob. 57ECh. 2 - Prob. 58ECh. 2 - Prob. 59ECh. 2 - Prob. 60ECh. 2 - Prob. 61ECh. 2 - Prob. 62ECh. 2 - Prob. 63ECh. 2 - Prob. 64ECh. 2 - Prob. 65ECh. 2 - Prob. 66ECh. 2 - Prob. 67ECh. 2 - Prob. 68ECh. 2 - Prob. 69ECh. 2 - Prob. 70ECh. 2 - Prob. 71ECh. 2 - Prob. 72ECh. 2 - Prob. 73ECh. 2 - Prob. 74ECh. 2 - Prob. 75ECh. 2 - Prob. 76ECh. 2 - Prob. 77ECh. 2 - Prob. 78ECh. 2 - Prob. 79ECh. 2 - Prob. 80ECh. 2 - Prob. 81ECh. 2 - Prob. 82E
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education