Computer Science: An Overview (12th Edition)
Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
Question
Book Icon
Chapter 2, Problem 36CRP

a.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “00000000”.
  • Initialize the variable “bit_pattern2” as “11110000” which is the mask value.
  • Perform logical “OR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to display “1’s” in upper 4-bits, store the resultant value in the variable “result”.
  • Print the result.

b.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “00000000”.
  • Initialize the variable “bit_pattern2” as “10000000” which is the mask value.
  • Perform logical “XOR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to find complement of most significant bit in pattern, store the resultant value in the variable “result”.
  • Print the result.

c.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “00000000”.
  • Initialize the variable “bit_pattern2” as “11111111” which is the mask value.
  • Perform logical “XOR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to find complement of 8-bits pattern, store the resultant value in the variable “result”.
  • Print the result.

d.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “00000000”.
  • Initialize the variable “bit_pattern2” as “01111111” which is the mask value.
  • Perform logical “AND” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to find “0” in least significant bit, store the resultant value in the variable “result”.
  • Print the result.

e.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “00000000”.
  • Initialize the variable “bit_pattern2” as “01111111” which is the mask value.
  • Perform logical “OR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to find “1” in all bits except the most significant bit, store the resultant value in the variable “result”.
  • Print the result.

f.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “111111111111111111111111”.
  • Initialize the variable “bit_pattern2” as “111111111111111111111111” which is the mask value.
  • Perform logical “XOR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to find change the color to black, store the resultant value in the variable “result1”.
  • Initialize anremaining variable “bit_pattern3” as “111111110000000011111111” which is the mask value to filter all the green components.
  • Perform logical “OR” operation between the value of the variables “result1” and “bit_pattern3” to filter out all green color components, store the resultant value in the variable “result2”.
  • Print the result.

g.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “111111111111111111111111”.
  • Initialize the variable “bit_pattern2” as “111111111111111111111111” which is the mask value.
  • Perform logical “XOR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to invert all bits, store the resultant value in the variable “result”.
  • Print the result.

h.

Program Plan Intro

Program plan:

  • Initialize the variable “bit_pattern1” as “111111111111111111111111”.
  • Initialize the variable “bit_pattern2” as “000000000000000000000000” which is the mask value.
  • Perform logical “XOR” operation between the value of the variables “bit_pattern1” and “bit_pattern2” to invert all bits, store the resultant value in the variable “result”.
  • Print the result.

Blurred answer
Students have asked these similar questions
make corrections of this program based on the errors shown. this is CIS 227 .
Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories:  Groups should have Read+Write access Leave owner permissions as they are  “Everyone else” should not have any access   Submit for grade: Screenshot of  /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions
⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…

Chapter 2 Solutions

Computer Science: An Overview (12th Edition)

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
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
A+ Guide to Hardware (Standalone Book) (MindTap C...
Computer Science
ISBN:9781305266452
Author:Jean Andrews
Publisher:Cengage Learning
Text book image
A+ Guide To It Technical Support
Computer Science
ISBN:9780357108291
Author:ANDREWS, Jean.
Publisher:Cengage,
Text book image
Comptia A+ Core 1 Exam: Guide To Computing Infras...
Computer Science
ISBN:9780357108376
Author:Jean Andrews, Joy Dark, Jill West
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT