Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 2, Problem 49CRP
Suppose the Vole communicates with a printer using the technique of memory-mapped I/O. Suppose also that address 0xFF is used to send characters to the printer, and address 0xFE is used to receive information about the printer’s status. In particular, suppose the least significant bit at the address 0xFE indicates whether the printer is ready to receive another character (with a 0 indicating “not ready” and a 1 indicating “ready”). Starting at address 0x00, write a machine language routine that waits until the printer is ready for another character and then sends the character represented by the bit pattern in register 0x5 to the printer.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Assume you are given an array of four 16-bit numbers stored in memory with a starting address x3110. Using PC-
relative addressing, write an LC-3 machine language program that will copy the same four 16-bit numbers in reverse
order, starting at memory address x3120. For example, if the following are the four 16-bit values stored in x3110,
x3110
12
x3111
23
х3112
34
х3113
45
then the result of your program execution should write the following starting at memory address x3120:
x3120
45
х3121
34
x3122
23
x3123
12
Load your program starting at address x3100. You will need to demonstrate the correct execution of your program by
using the LC-3 Simulator.
A set of eight data bytes is stored in memory starting at XX50 H. Write a program to
add two bytes at a time and store the sum in the same memory locations, low-order sum
replacing the first byte and a carry replacing the second byte. If any pair does not
generate a carry, the memory location of the second byte should be cleared.
Example 9.7. In this example, we want to construct an 8-bit dedicated datapath for solving the following problem: Input an 8-bit number. Output a 1 if the number has the same number of 0’s and 1’s, otherwise, output a 0. (E.g., the number 10111011 will output a 0; whereas, the number 10100011 will output a 1.) he algorithm for solving the problem is shown in Figure 9.24. The WHILE loop is executed eight times using the counteight variable for the 8 bits in the input number n. For each bit in n, if it is a 1, the variable countbit is incremented, otherwise, it is decremented. At the end of the WHILE loop, if countbit is equal to 0, then there are the same number of 0’s and 1’s in n. After analyzing the algorithm, we conclude that the following registers and functional units are needed for the datapath: • An 8-bit shifter with parallel load register for storing and shifting n. • A 4-bit up counter for counteight. • A 4-bit up-down…
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
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
In Exercises 1 through 22, determine the output displayed in the text box or list box by the lines of code.
Introduction to Programming Using Visual Basic (10th Edition)
The following program creates a linked list with three names: #include iostream #include string using namespace...
Problem Solving with C++ (10th Edition)
Give a general description of the input validation process.
Starting Out with Python (3rd Edition)
When displaying a Java applet, the browser invokes the _____ to interpret the bytecode into the appropriate mac...
Web Development and Design Foundations with HTML5 (9th Edition) (What's New in Computer Science)
In Exercises 3 through 24, carry out the task.
Place “CHECKING ACCOUNT”in the title bar of a form.
Introduction To Programming Using Visual Basic (11th Edition)
Knowledge Booster
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
- Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B a) If the machine is big endian and uses two's complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). b) If the machine is big endian and the number is an IEEE single-precision floating-point value, is the number positive or negative? c) If the machine is big endian and the number is an IEEE single-precision floating-point value, determine the decimal equivalent of the number stored at address 100 (you may leave answer in scientific notation form, as a number times a power of two). d) If the machine is little endian and uses two's complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). e) if the machine is little endian and the number is an iEEE single-precision floating-point value, is the number positive or negative? f)…arrow_forwardThe memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the memory location at the address of 0X003FB02 contains 1-byte memory variable K (0001 0010), see figure below. There is a 2-byte variable M which hold binary information M (1110 0101 0000 1i11). What is the address in hexadecimal format for 2-byte memory variable M, following little Endian computer? 7 Address in Data in Hex. Format Hex. Format 0X003FBF04 1110 0101 M OX003FBF03 0000 1111 0X003FBF02 0001 0010 0X003FBF01 0010 0001 J Its address in hexadecimal is 0X003FBF02. а. Its address in hexadecimal is 0×003FBF03. O b. Its address in hexadecimal is 0X003FBF04. Its address in hexadecimal is 0×003FBF01. d.arrow_forwardGiven rax = 0x0000000200000100, rbx = 0x0000000000000100, and rcx = 0x0000000000000001,and the following values in memoryaddress -> byte at that address0x0000000000000100 -> 0x010x0000000000000101 -> 0x000x0000000000000102 -> 0x000x0000000000000103 -> 0x000x0000000000000104 -> 0x020x0000000000000105 -> 0x000x0000000000000106 -> 0x000x0000000000000107 -> 0x00what is the new value in %rax after the following operation?subq -0x04(%rbx, %rcx, 4), %raxarrow_forward
- Suppose the memory cells at address A4 to B3 in the machine described in language description table contains the bit pattern given in the following table. Assume that the machine is starting with its program counter containing A4. Explanation of the output is compulsory. Address A4 A5 A6 A7 A8 A9 AA Contents 20 00 21 03 22 01 B1 во 50 02 во AA co 00 50 05 AB AD AE AF во B1 B2 B3 a) Display the machine cycle in the table form with Program Counter (P.C), increment of P.C., Instruction Register (I.R.) and General-Purpose Register (G.P.R) and description of each instruction executed. Explanation of the output is compulsory. b) What is in register 0 the first time the instruction at address AA is executed? c) What is in register 0 the second time the instruction at address AA is executed? d) How many times is the instruction at address AA executed before the machine halts e) What is the bit pattern found in program counter when the machine halts?arrow_forward3. Implement a 32-bit subtraction of two numbers X and Y that are stored in memory as: X = (DS: 503H) MS byte of MS word (DS: 0502H) (DS: 0501H) (DS: 0500H) LS byte of MS byte of LS byte of MS word LS word LS word Y = (DS:0507H) (DS: 0506H) (DS: 0505H) (DS: 0504H) The result of X - Y is to be saved in the place where X is stored in memory.arrow_forwardAssume you now have 1kB of memory, i.e. the memory address space runs from 0 to 1023. The starting address of the first word is 0, the second word is 4, the third word is 8, and so on. The last word comprising 4 bytes resides in addresses 1020, 1021, 1022, 1023. Thus, the last word starts at 1020, which is a multiple of 4. Now assume the same 1kB of memory but now, word size is 64 bits. The starting address of the first word is 0, the second, third, and last word starts at? my answer: (correct) the second is equal to = 8 the third is equal to = 16 help me find the last wordarrow_forward
- Consider the string of data #. The ASCII value of data # is 23 H which has to be moved from source memory to destination memory. Calculate the 20 bit PA of source memory and destination memory. Assume CS=2000 H, DS=5000 H, SS=6000 H, ES=8000 H. BX=1234 H, BP=2434 H, SP=3500 H, SI=4000 H, DI=5276 H, IP=D1245 H.arrow_forwardWrite a MIPS assembly code program that asks the user to enter an unsigned number and read it. Then swap the bits at odd positions with those at even positions and display the resulting number. For example, if the user enters the number 9, which has binary representation of 1001, then bit 0 is swapped with bit 1, and bit 2 is swapped with bit 3, resulting in the binary number 0110. Thus, the program should display 6. Example of the MIPS assembly code I went the answer on MIPS Code only!!!!arrow_forwardAssume you now have 1kB of memory, i.e. the memory address space runs from 0 to 1023. The starting address of the first word is 0, the second word is 4, the third word is 8, and so on. The last word comprising 4 bytes resides in addresses 1020, 1021, 1022, 1023. Thus, the last word starts at 1020, which is a multiple of 4. Now assume the same 1kB of memory but now, word size is 64 bits. The starting address of the first word is 0, the second, third, and last word starts at?arrow_forward
- Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…arrow_forwardA set of eight data bytes is stored in memory locations starting from XX70H. Write a program to add two bytes at a time and store the sum in the same memory locations, low order sum replacing the first byte and a carry replacing the second byte. If any pair does not generate a carry, the memory location of the second byte should be cleared. Data(H) F9, 38, A7, 56,98,52, 8F, F2arrow_forwardVariable x has 4-byte representation 0x01234567 Address given by &x is 0x100 If the machine uses Big endian byte ordering which of the following table presents variable in machine memory Select one: a. 0x100 : 100x001: 320x102: 540x103: 76 b. 0x100 : 670x001: 450x102: 230x103: 01 c. 0x100 : 760x001: 540x102: 320x103: 10 d. 0x100 : 010x001: 230x102: 450x103: 67arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY