Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2.1, Problem 2.8PP
Program Plan Intro
Boolean algebra operations:
- The Boolean algebra is represented by the two element set such as {0, 1}.
- Encode logic value for “1” and “0” is “TRUE” and “FALSE” respectively.
- Operation of Boolean algebra are “~”, “&”, “|” and “^”.
- Encode logical operations for “~”, “&”, “|” and “^” is “NOT”, “AND”, “OR”, and “EXCLUSIVE-OR” respectively.
Table for “~” Boolean operation:
The “~” operation means change the bit “1” to “0” and change the bit “0” to “1”.
- It is also called as “NOT” operation.
~ | |
0 | 1 |
1 | 0 |
Table for “&”Boolean operation:
This Boolean operation is used to “AND” the value of two bits
& | 0 | 1 |
0 | 0 | 0 |
1 | 0 | 1 |
Table for “|”Boolean operation:
This Boolean operation is used to “OR” the value of two bits vectors.
| | 0 | 1 |
0 | 0 | 1 |
1 | 1 | 1 |
Table for “^”Boolean operation:
This Boolean operation is used to “EXCLUSIVE-OR” of two bits vectors.
^ | 0 | 1 |
0 | 0 | 1 |
1 | 1 | 0 |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Problem
1.10: Simplify
F(A, B,C, D) = ACD+
A'B + D'
Problem #2: [35 pts] Parity Bit CheckerThe parity bit of a sequence of bits is 0 if the number of 1’s in the sequence is even and 1otherwise.Example: if the sequence of bits is 1 1 0 1, the parity bit should be 1 (total number of 1-bits is 3 whichis odd) if the sequence of bits is 1 0 1 0, the parity bit should be 0 (total number of 1-bits is 2 whichis even)Write a Java program that asks the user to enter the number of bits he has. The program thenreads the bits as separate integers. In the end, the program prints the parity bit on the screen. Ifthe use enters a bit value that is neither 0 nor 1, the entry should be discarded and a messagedisplayed as shown in the sample run.Sample run 1:How many bits do you have? 6Enter 6 bits: 1 1 0 0 1 0The parity bit is 1Sample run 2:How many bits do you have? 8Enter 8 bits: 1 1 1 0 0 0 0 1The parity bit is 0Sample run 3:How many bits do you have? 5Enter 5 bits: 1 1 3 0 1Incorrect bit value 3 is discarded.The parity bit is 1
java brogram
Chapter 3: Practice Problems
VIII. You are given the following C code to compute integer absolute value:
int abs(int x)
{
}
return x > (sizeof(int)*8-1);
int comp = x mask;
return comp;
}
A. What bit pattern does mask have, as a function of x?
B. What numerical value does mask have, as a function of x?
C. For what values of x do functions abs and opt abs return identical
results?
D. For the cases where they produce different results, how are the two
results related?
E. Show that with the addition of just one single arithmetic operation
(any C operation is allowed) that you can fix opt abs. Show your
modifications on the original code. (You can just provide the line that
you will add).
F. Are there any values of x such that abs returns a value that is not
greater than 0? Which value(s)?
Chapter 2 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 2.1 - Practice Problem 2.1 (solution page 143) Perform...Ch. 2.1 - Prob. 2.2PPCh. 2.1 - Prob. 2.3PPCh. 2.1 - Practice Problem 2.4 (solution page 144) Without...Ch. 2.1 - Prob. 2.5PPCh. 2.1 - Prob. 2.6PPCh. 2.1 - Prob. 2.7PPCh. 2.1 - Prob. 2.8PPCh. 2.1 - Practice Problem 2.9 solution page 146 Computers...Ch. 2.1 - Prob. 2.10PP
Ch. 2.1 - Prob. 2.11PPCh. 2.1 - Prob. 2.12PPCh. 2.1 - Prob. 2.13PPCh. 2.1 - Prob. 2.14PPCh. 2.1 - Prob. 2.15PPCh. 2.1 - Prob. 2.16PPCh. 2.2 - Prob. 2.17PPCh. 2.2 - Practice Problem 2.18 (solution page 149) In...Ch. 2.2 - Prob. 2.19PPCh. 2.2 - Prob. 2.20PPCh. 2.2 - Prob. 2.21PPCh. 2.2 - Prob. 2.22PPCh. 2.2 - Prob. 2.23PPCh. 2.2 - Prob. 2.24PPCh. 2.2 - Prob. 2.25PPCh. 2.2 - Practice Problem 2.26 (solution page 151) You are...Ch. 2.3 - Prob. 2.27PPCh. 2.3 - Prob. 2.28PPCh. 2.3 - Prob. 2.29PPCh. 2.3 - Practice Problem 2.30 (solution page 153) Write a...Ch. 2.3 - Prob. 2.31PPCh. 2.3 - Practice Problem 2.32 (solution page 153) You are...Ch. 2.3 - Prob. 2.33PPCh. 2.3 - Prob. 2.34PPCh. 2.3 - Practice Problem 2.35 (solution page 154) You are...Ch. 2.3 - Prob. 2.36PPCh. 2.3 - Practice Problem 2.37 solution page 155 You are...Ch. 2.3 - Prob. 2.38PPCh. 2.3 - Prob. 2.39PPCh. 2.3 - Practice Problem 2.40 (solution page 156) For each...Ch. 2.3 - Prob. 2.41PPCh. 2.3 - Practice Problem 2.42 (solution page 156) Write a...Ch. 2.3 - Practice Problem 2.43 (solution page 157) In the...Ch. 2.3 - Prob. 2.44PPCh. 2.4 - Prob. 2.45PPCh. 2.4 - Prob. 2.46PPCh. 2.4 - Prob. 2.47PPCh. 2.4 - Prob. 2.48PPCh. 2.4 - Prob. 2.49PPCh. 2.4 - Prob. 2.50PPCh. 2.4 - Prob. 2.51PPCh. 2.4 - Prob. 2.52PPCh. 2.4 - Practice Problem 2.53 (solution page 160) Fill in...Ch. 2.4 - Practice Problem 2.54 (solution page 160) Assume...Ch. 2 - Compile and run the sample code that uses...Ch. 2 - Try running the code for show_bytes for different...Ch. 2 - Prob. 2.57HWCh. 2 - Write a procedure is_little_endian that will...Ch. 2 - Prob. 2.59HWCh. 2 - Prob. 2.60HWCh. 2 - Prob. 2.61HWCh. 2 - Write a function int_shifts_are_arithmetic() that...Ch. 2 - Fill in code for the following C functions....Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: / ...Ch. 2 - You are given the task of writing a procedure...Ch. 2 - Prob. 2.68HWCh. 2 - Write code for a function with the following...Ch. 2 - Write code for the function with the following...Ch. 2 - You just started working for a company that is...Ch. 2 - You are given the task of writing a function that...Ch. 2 - Write code for a function with the following...Ch. 2 - Write a function with the following prototype: /...Ch. 2 - Prob. 2.75HWCh. 2 - The library function calloc has the following...Ch. 2 - Prob. 2.77HWCh. 2 - Write code for a function with the following...Ch. 2 - Prob. 2.79HWCh. 2 - Write code for a function threefourths that, for...Ch. 2 - Prob. 2.81HWCh. 2 - Prob. 2.82HWCh. 2 - Prob. 2.83HWCh. 2 - Prob. 2.84HWCh. 2 - Prob. 2.85HWCh. 2 - Intel-compatible processors also support an...Ch. 2 - Prob. 2.87HWCh. 2 - Prob. 2.88HWCh. 2 - We are running programs on a machine where values...Ch. 2 - You have been assigned the task of writing a C...Ch. 2 - Prob. 2.91HWCh. 2 - Prob. 2.92HWCh. 2 - following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Prob. 2.97HW
Knowledge Booster
Similar questions
- 4.25. Use the equations in the book or the computer program of this chapter. Find the radiation efficiency of resonant linear electric dipoles of length (a) I = 1./50 (b) I=1/4 (c)l=1/2 (d)1 =1 Assume that each dipole is made out of copper [o = 5.7 x 107 S/m], has a radius of 10-42, and is operating at f = 10 MHz. Use the computer program Dipole of this chapter to find the radiation resistances.arrow_forwardA.13 [5] Assume that X consists of 3 bits, x2 x1 x0, and Y consists of 3 bits, y2 y1 y0. Write logic functions that are true if and only if ■ X< Y, where X and Y are thought of as unsigned binary numbers X< Y, where X and Y are thought of as signed (two's complement) numbers ■ X = Yarrow_forwardH.W 2: Using: 1) 32 - to - 1 MUX 2) 16- to - 1 MUX 3) 4- to -1 MUX 4) 2- to - 1 MUX To realize the following function F= 2.3.7,9,13.14,19,20,22,25,27,29,30,31)arrow_forward
- [#165] Adding vectors |\vec{\textbf{A}}| = |\vec{\textbf{B}}| = |\vec{\textbf{C}}|∣A∣=∣B∣=∣C∣. Further, \vec{\textbf{A}} + \vec{\textbf{B}} + \vec{\textbf{C}} = 0A+B+C=0. What is the angle between \vec{\textbf{A}}A and \vec{\textbf{B}}B ?arrow_forwardQuestion 1 a) Given f(x)=x² - 6x +1 i) Find the exact value of f(1.22) ii) Determine the error value, absolute error, and relative error produced from f(1.22) using three decimal points calculation b) Given the following operation 4.232+2.0321+5.43-2.38 Compute the most accurate value for the operation where each number has been rounded to a certain decimal point.arrow_forwardH.W:- Find the value of Z Where Z=AX+BX+CX*DX, IF AX=4,BX=8,CX-2,DX-3 result in memory location (DS:1200H] IF DS=2000H? Alo Mor A+, 2000 Narrow_forward
- Problem 9.1 Problem 9.2 Using python: Using python: Write a py-file to plot the following function: Use the Taylor series x2 + 2! x6 + 6! x4 COSX = 1 - 4! 8. f(x) = x³ – 5x² + 5x = 2, -1< x < 3 to write a py-file to compute cosx correct to four decimal places (x is in radians). See how many terms are needed to get 4-figure agreement with the Python function math.cos(x). Use math,factorial function to compute the factorial value of and then print out the maximum and minimum values. (Note: The range of x-axis of your figure should vary from -1 to 3 with an increment of 0.01 ) a positive integer. For example, math.factorial(4)= 4! in Python. (Note: Test your program with x =arrow_forward4. Determine whether each distribution is a probability distributionarrow_forwardProblem D. DNA Input file: Output file: Time limit: standard input standard output 1 second 256 megabytes Memory limit: As you know desoxyribonucleic acid consists of 4 mucleobases: adenine, guanine, cytosine, thymine. This nucleobases must form pairs: adenine with thymine and guanine with cytosine. You are given the sequence of nucleobases in the first part of DNA spiral. Please, find its second part. Input You are given the only string DNA. It is guaranteed that DNA consists only of uppercase letters 'A', "C', T', 'G'. Output Print the second part of DNA spiral. Examples standard input standard output ACTG TGÁC A GTA СATarrow_forward
- Question 2 Using the incomplete programming code given, complete the code using dynamic programming with memory function, to reproduce the results in the following Table 1. (C++) #include<iostream>using namespace std; // max knapsack capacity // *** WRITE YOUR CODE HERE ***// num of items // *** WRITE YOUR CODE HERE ***// weight of each item // *** WRITE YOUR CODE HERE ***// value of each item // *** WRITE YOUR CODE HERE ***// variable for dynamic programming matrix // *** WRITE YOUR CODE HERE *** //==========================================// Dynamic programming function: recursive// ========================================= // ALGORITHM F(i,j) // int value // if F[i,j] is not filled yet (-1): // (start with j = W, i = n) // if capacity j < current item's weight w[i]: // value = recall F(i-1, j) // else: // we can include current item,…arrow_forward[11] Determine the value of F in a standard form: y Z' F y'arrow_forwardPROBLEM 21 - 0517: Write a subroutine which computes the roots of the quadratic equation a,x2 + a,x + a, = 0 according to the quadratic formula: X12 = (-az/2a,) + V[(a,/2a,)2 – (a,/a,)) (= [{a, + v(a?, - 4a,a,)} / 2a,]) (START SUBROUTINE QUAD COMPUTE, DISCRIMINANT (DISC) DISCarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education