Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 2, Problem 26CRP
Program Plan Intro
Vole machine language:
In vole machine language, the instructions are coded with specific meaning. The size of the instruction is 16 bit. The first hexadecimal digit shows the op-code of the instruction. The next 3 digits show the operation field of the register.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Suppose r0 = ox300010A0, r2 = 0x00000011, and the memory layout is as follows
Address: Data:
0x300010A7 0x72
0x300010A6 0XA5
0x300010A5 0x9F
0x300010A4 0x00
0x300010A3 0x50
0x300010A2 0x2B
0x300010A1 0XA5
0x300010A0 0x01
-What is the Value of r0 and r1 after executing LDR r1, [r0, #2]
-What are the values of r0 and r1 after executing the following code? Illustrate your process in a memory map.
LDR r1, [r0], #3
ADD r1, r1, r2
STR r1, [r0, r#4]
Suppose r0 = ox300010A0, r2 = 0x00000011, and the memory layout is as follows
Address: Data:
0x300010A7 0x72
0x300010A6 0XA5
0x300010A5 0x9F
0x300010A4 0x00
0x300010A3 0x50
0x300010A2 0x2B
0x300010A1 0XA5
0x300010A0 0x01
-What are the values of r0 and r1 after executing the following code? Illustrate your process in a memory map.
LDR r1, [r0], #3
ADD r1, r1, r2
STR r1, [r0, r#4]
Question 2: Write the MIPS code for the given Hexadecimal Machine Code that starts at memory address 0x40000. Line1: 0x0080082A Line2: 0x14200002 Line3: 0x2084FFFF Line4: 0x08010005 Line5: 0x20840001 Line6: 0x1480FFFA Line7: 0x03E00008 Line8: 0x0C010000
Chapter 2 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
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 - Classify each of the following Vole 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
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
- Most Intel CPUs use the __________, in which each memory address is represented by two integers.arrow_forwardConsider a memory implemented for 8086 microprocessor Draw the memory block diagram. Determine the values for A0 , /BHE ,address lines(A1..A19) and data lines(D0.. D15) in order to access: A byte at odd address [01FF3H] A byte at even address [01FFCH] A word at even address [01FFEH] A word at odd address [01ABFH]arrow_forwardConsider a MIPS processor and a program that is loaded in the main memory between the addresses 130h and 161Ch (h means hexadecimal). Calculate the number of blocks of the main memory that this program uses if the size of a block is 2^7 words (give the result in decimal).arrow_forward
- 3. If we have an 8 bit microcontroller that has 4kB of instruction memory starting at address 0x0000, and 2kB of data memory immediately above that, what is the next available byte in our address map?arrow_forwardA digital computer has a memory unit with 24 bits per word. The instruction set consists of 150 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word ofmemory.a. How many bits are needed for the opcode?b. How many bits are left for the address part of the instruction?c. What is the maximum allowable size for memory?d. What is the largest unsigned binary number that can be accommodated in one word of memory?arrow_forwardSuppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…arrow_forward
- Calculate Physical Address of Main memory • Given the contents of CS:IP = [3000H]:[100H] • Given the contents of SS:SP = [50A0H]:[300H] • Given the contents of ES:DI = [60C0H]:[200H] • Given the contents of DS:SI = [A1C0H]:[2F00H] • Given the contents [CS]:[IP]=[1F0AH]:[15A6H] • Given the contents [SS]:[SP]=[82FFH]:[0FA1H]Questions are from Microprocessor (8086)arrow_forwardGiven the binary format of an instruction as follows0000 0011 0000 1000 1000 1000 0110 0011a. What assembly instruction does this correspond to?b. If the PC = 0X0040 00F4, what is the target address?c. How many instructions forwards or backwards is that?d. How many bytes is that in decimal?arrow_forwardSuppose we have a 64Kbyte byte-addressable memory that is 16-way low-order interleaved. What is the size of the memory address module number field? Explain why.arrow_forward
- Suppose a byte-addressable computer using 4-way setassociative cache has 216 words of main memory (where each word is 32 bits) and a cache of 32 blocks, where each block is four words. Show the main memory address format for this machine. (Hint: Because this architecture is byte addressable, and the number of addresses is critical in determining the address format, you must convert everything to bytes.)arrow_forwardA computer has a 16 bit address space A[15:0]. If all addresses having bits A[15:14]=11 are reserved for I/O device registers, then the maximum number of actual word addressable memory locations is 216 - 214 Group of answer choices True Falsearrow_forwardUnlike a byte that is always 8 bits, word size can vary from machine to machine. Let's say we have a 16-bit system (word size is 2 bytes) and a memory unit that has 10 address lines. Because there are 10 address bits, we can have 210 unique addresses, hence 1024 addresses. If we are working with something word-addressable, that means each word has a unique address, and we canstore 1024 words. The memory size is 1 kiloword, or equivalently, 2kilobytes because each word is 2 bytes long. The address of the first word is 0, the second word is 1, the third word is 2, and the last word is 1023.Now, with 4 address lines and a word size of 4 bits, what is the address of the last word?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