Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2.4, Problem 2QE
Program Plan Intro
AND operation:
This is a Boolean operation in which 0 represents the false value and 1 represents the true value. It produces true output when both inputs are true.
In this operation, if both inputs are false
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
If you want to set last (8-bit) of a
binary number and reset the other
bits, you could set a mask with 1's and
OR it with the original binary number.
O Skip
O False
O True
Calculate the parity of a byte with the value 31ten and show the pattern stored to memory. Assume the parity bit is on the right. Suppose the most signifi cant bit was inverted in memory, and then you read it back. Did you detect the error? What happens if the two most signifi cant bits are inverted?
Separate the bit sequence into appropriate sized chuncks for each of the following domains. (You do NOT have to decode this bit sequence.)
1. Octal String: 010 110 101 010 101 111 010 111 111 101 011 011 011 011 010 1001. Hex String:1. Base64 String:
Chapter 2 Solutions
Computer Science: An Overview (12th Edition)
Ch. 2.1 - What sequence of events do you think would be...Ch. 2.1 - What information must the CPU supply to the main...Ch. 2.1 - Prob. 3QECh. 2.2 - Prob. 1QECh. 2.2 - In the text, JUMP instructions were expressed by...Ch. 2.2 - Is the instruction If 0 equals 0, then jump to...Ch. 2.2 - Write the example program in Figure 2.7 in actual...Ch. 2.2 - The following are instructions written in Vole...Ch. 2.2 - What is the difference between the instructions...Ch. 2.2 - Here are some instructions in English. Translate...
Ch. 2.3 - Prob. 1QECh. 2.3 - Suppose the Vole memory cells at addresses 0xB0 to...Ch. 2.3 - Suppose the Vole memory cells at addresses 0xA4 to...Ch. 2.3 - Suppose the Vole memory cells at addresses 0xF0 to...Ch. 2.4 - Prob. 1QECh. 2.4 - Prob. 2QECh. 2.4 - Prob. 3QECh. 2.4 - a. Suppose you XOR the first 2 bits of a string of...Ch. 2.4 - Prob. 5QECh. 2.4 - Prob. 6QECh. 2.4 - Prob. 7QECh. 2.4 - Prob. 8QECh. 2.4 - Prob. 9QECh. 2.4 - Prob. 10QECh. 2.4 - Using Vole machine language (Appendix C), write a...Ch. 2.4 - Prob. 12QECh. 2.5 - Prob. 1QECh. 2.5 - Prob. 2QECh. 2.5 - Prob. 3QECh. 2.6 - The hypotenuse example script truncates the sides...Ch. 2.6 - Prob. 2QECh. 2.6 - The Python built-in function str () will convert a...Ch. 2.6 - Use the Python built-in bin () to write a script...Ch. 2.6 - Prob. 6QECh. 2.7 - Referring back to Questions 3 of Section 2.3, if...Ch. 2.7 - Prob. 2QECh. 2.7 - Suppose there were two central processing units...Ch. 2 - a. In what way are general-purpose registers and...Ch. 2 - Answer the following questions in Vole machine...Ch. 2 - Prob. 3CRPCh. 2 - What is the value of the program counter in the...Ch. 2 - Prob. 5CRPCh. 2 - Prob. 6CRPCh. 2 - Prob. 7CRPCh. 2 - Suppose a machine language is designed with an...Ch. 2 - Translate the following instructions from English...Ch. 2 - Rewrite the program in Figure 2.7 assuming that...Ch. 2 - 11. Classify each of the following instructions...Ch. 2 - Prob. 12CRPCh. 2 - Prob. 13CRPCh. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Suppose the memory cells at addresses 0x00 through...Ch. 2 - Prob. 18CRPCh. 2 - If the Vole executes an instruction every...Ch. 2 - Prob. 20CRPCh. 2 - Prob. 21CRPCh. 2 - Prob. 22CRPCh. 2 - Prob. 23CRPCh. 2 - Write a program in Vole to compute the sum of...Ch. 2 - Prob. 26CRPCh. 2 - Prob. 27CRPCh. 2 - Suppose the following program, written in Vole, is...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Summarize the steps involved when the Vole...Ch. 2 - Suppose the registers 0x4 and 0x5 in the Vole...Ch. 2 - Prob. 33CRPCh. 2 - Prob. 34CRPCh. 2 - Prob. 35CRPCh. 2 - Prob. 36CRPCh. 2 - Prob. 37CRPCh. 2 - Prob. 38CRPCh. 2 - Prob. 39CRPCh. 2 - Prob. 40CRPCh. 2 - Prob. 41CRPCh. 2 - Prob. 42CRPCh. 2 - a. What single instruction in the Vole machine...Ch. 2 - Write a Vole program that reverses the contents of...Ch. 2 - Write a Vole program that subtracts the value...Ch. 2 - Prob. 46CRPCh. 2 - Suppose a person is typing forty words per minute...Ch. 2 - Prob. 48CRPCh. 2 - Suppose the Vole communicates with a printer using...Ch. 2 - Write a Vole program that places 0s in all the...Ch. 2 - Prob. 51CRPCh. 2 - Prob. 52CRPCh. 2 - Suppose you are given 32 processors, each capable...Ch. 2 - Prob. 54CRPCh. 2 - Prob. 55CRPCh. 2 - Describe how the average of a collection of...Ch. 2 - Write and test a Python script that reads in a...Ch. 2 - Write and test a Python script that reads in a...Ch. 2 - Prob. 59CRPCh. 2 - Suppose a computer manufacturer develops a new...Ch. 2 - Prob. 2SICh. 2 - Prob. 3SICh. 2 - Prob. 4SICh. 2 - Suppose a manufacturer produces a computer chip...Ch. 2 - Prob. 6SICh. 2 - Prob. 7SICh. 2 - Prob. 8SI
Knowledge Booster
Similar questions
- Performing the bitwise XOR operation on A = 000111 and B = 001101 and enter the result. The result must also have a size of 6 bit. Use only "0" and "1" without any other characters or spaces. Do not add a prefix.arrow_forwardTake into consideration the binary BCH code, which is 127 bits long and has a spacing of 6 bits, and use the binary field extension F128, which is 128 bits in size. How big is the code, and can you ensure a certain minimum space between entries?arrow_forwardTake into consideration the binary BCH code, which is 127 bits long and has a distance of 6 bits intended for it, and use the binary field extension F 128, which is 128 bits in size. How big is the code, and can you guarantee a certain minimum distance between entries?arrow_forward
- Explain the term masking. How is it useful for data representation? Explain the concept using an example For a floating-point format with a k -bit exponent and an n -bit fraction, give a formula for the smallest positive integer that cannot be represented exactly (because it would require an n + 1 –bit fraction to be exact).arrow_forwardIn the steps of “Append the padding bits” in SHA-512 system (shown in Figure 1), the message is padded so that its length is congruent to 896 mod 1024 or (length ≅ 896 mod 1024). State the value of the following padding field is the message length is: a) 1919 b) 1920 c) 2942arrow_forwardimplement bitMask(x,y) Generate a mask consisting of all 1’s from lowbit to highbit /* * bitMask - Generate a mask consisting of all 1's * lowbit and highbit* Examples: bitMask(5,3) = 0x38* Assume 0 <= lowbit <= 31, and 0 <= highbit <= 31* If lowbit > highbit, then mask should be all 0's* Legal ops: ! ~ & ^ | + << >>* Max ops: 16* Rating: 3*/int bitMask(int highbit, int lowbit) {return 2;}arrow_forward
- 1. Assume you have an unsigned 8-bit binary number b (the value does not matter) and that you wish to negate the number b. For example, if the value is 100 01 101, the result will be 0 1110010. What is the mask that will accomplish this and the operation that must be performed? a) 11111111, OR operation b) 00000000, XOR operation c) 111111 00, AND operation d) 11111111, XOR operation 2. Assume that the register x5 stores the value 12. The value in x5 will be () after the following operation is executed: slli x5, x5, 2 а) 6 b) 24 c) 48 d) 36 3. Add the 8-bit numbers 0110 1111 + 0110 1010. To calculate the result of the addition (as a binary value), please figure out whether overflow occurred if the numbers were treated as signed, and whether overflow occurred if the numbers were treated as unsigned. a) Signed Overflow: Yes; Unsigned Overflow: Yes b) Signed Overflow: No; Unsigned Overflow: No c) Signed Overflow: No; Unsigned Overflow: Yes d) Signed Overflow: Yes: Unsigned Overflow: No 4.…arrow_forward3 Counting k-inversions A k-inversion in a bitstring b is when a 1 in the bitstring appears k indices before a 0; that is, when b; = 1 and bi+k = 0, for some i. For example, the string 010010 has two 1-inversions (starting at the second and fifth bits), one 2-inversion (starting at the second bit), and one 4-inversion (starting at the second bit). Devise an algorithm which, given a bitstring b of length n, counts all the k-inversions, for each k from 1 to n - 1. Your algorithm should run faster than (n²) time. You can assume arithmetic on real numbers can be done in constant time. Give a 3-part solution.arrow_forwardCalculate the parity of a byte with the value 31 and show the pattern stored to memory. Assume the parity bit is on the right. Suppose the most significant bit was inverted in memory, and then you read it back. Did you detect the error? What happens if the two most significant bits are inverted?arrow_forward
- B={1,2,3,4,5,6,7,8,9,10} Using the n-bit binaries to which subset in the power set of the ordered set B does the following bit string represent: 1100000011arrow_forwardIn the Hamming coding system (7.3), its representation is expressed as 3 control (test) bits and 7 total bits (data+control bits).In the literature, control bits are represented as (cl, c2, c3, or (pl, p2, p3, .) The bit string sent by encoding with Hamming coding (15,4) is on the receiving side, It is retrieved as 001100101100 (pl.p2.dll). According to this bit sequence;Which option is given according to the control bits (p1.p2.p3.p4) sequence of the received bit sequence?A 0110B 1100C 1001D 0011E 0010arrow_forward15. Add these three 6-bit binary numbers: 110011, 111100 , 011100. You should only add two numbers at a time. Show your addition procedure by drawing a Word table, putting each bit in a separate table cell. Create an extra row above the top number where you will show the carry bit (if any) from one column to the next. Add an extra column to the left of the most-significant digit, where you will keep the bit (if any) that overflows the 6-bit field. Once you have your answer from adding the first two numbers, create another table and add the third number to sum you calculated previously. Write a procedural programming loop that imitates the one given in the PowerPoint presentation. Your loop should start variable n with a value of 10 and count down to zero. The loop should terminate when n reaches the value of zero.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning