What happens to the values of the registers at each step when the program in memory is run on the following system. Assume that memory words are 16bits and 4-bit is reserved for opcode, 12-bit is reserved for addresses. Assume that the value of 8 comes from the device number 5. (the memory address and its contents are given in hexadecimal) CPU 0001 (1h) = LOAD AC from memory 0011 (3h) = Compare the value of the given device to the value of the AC. The result is stored in eq. flag 0111(7h) = If the equality flag is 1, continue with the given address (JMPEQ) 111(Fh) = Load the given address value into the PC, ie jump to given address |(JMP) МЕМORY PC MAR ADDRESS VALUE 300 1940 301 3005 7304 302 303 IR MBR F301 AC Execution Unit 1/O AR 940 0003

What happens to the values of the registers at each step when the program in memory is run on the following system. Assume that memory words are 16bits and 4-bit is reserved for opcode, 12-bit is reserved for addresses. Assume that the value of 8 comes from the device number 5. (the memory address and its contents are given in hexadecimal) CPU 0001 (1h) = LOAD AC from memory 0011 (3h) = Compare the value of the given device to the value of the AC. The result is stored in eq. flag 0111(7h) = If the equality flag is 1, continue with the given address (JMPEQ) 111(Fh) = Load the given address value into the PC, ie jump to given address |(JMP) МЕМORY PC MAR ADDRESS VALUE 300 1940 301 3005 7304 302 303 IR MBR F301 AC Execution Unit 1/O AR 940 0003

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose that you have a computer with a memory unit of 24 bits per word. In this computer, the assembly program's instruction set consists of 198 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 of memory. a. How many bits are needed for the opcode? b. How many bits are left for the address part of the instruction? c. How many additional instructions could be added to this instruction set without exceeding the assigned number of bits? Discuss and show your calculations.
Q2. For the following assume that values A, B, C, D, E, and F reside in memory. Also assume that instruction operation codes are represented in 6 bits, memory addresses are 64 bits, data size is 32 bits and register addresses are 5 bits. a. For each instruction set architecture shown in Figure A.1, how many addresses or names (including both memory and register), appear in each instruction for the code to compute C = A+ B, and what is the total code size? passor TOS Memory (A) Accumulator (C) Registry (D) Re loed oore Figure A.1 Operand locations for four instruction set architecture classes. The arrows indicate whether the oper and is an input or the result of the orithmetic-logical unit ALU operation, or both an input and result Lighter shoes indicate inputs, and the dark shode indicates the result in a top of stack (TOS) register points to the top input operand, which is combined with the operand below. The first operand is removed from the stack, the result takes the place of the…
Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mb
Microprocessor Hw Q1 Execute the following code and show the contents of the registers: LDI R16,$03 LDI R17,$10 HERE: AND R16, R17 BREQ HERE ADD R16,17 Q2 Find the number of times the following loop is performed: LDI R20,20 BACK: LDI R21,$0A HERE: DEC R21 BRNE HERE DEC R20 BRNE BACK Q3. Execute the following code and show the contents of the registers: LDI R16,$03 LDI R17,$15 HERE: ADD R16, R17 COM R16 BRSH HERE EOR R16,17 JMP NEXT SUB R16,R17 NEXT: ROR R16
Assume that a memory is initialised as follows: Memory Address Cell Contents 0x000336 0x38 0x000337 0x26 0x000338 0x48 0x000339 0x38 0x00C33A 0x00C33B 0x77 0x38 The following sequence of operations is executed in the given memory: Write(0x00C337, 0x0205) Write (0x00C339, 0x0106) Write(0x00C338, 0x0109) Assume that the read and write operations are done in groups of two bytes, and the system is a big endian system. What is the result of read(0x00C337) +read (0x00C338)? Write your answer in Base 10 (decimal)
ISA of a hypothetical CPU 1 Address Memory: Address Data - (8-bits) LOAD M 100 25 STORE M 101 90 ADD M 102 65 SUB M 103 36 MUL M 104 22 105 77 DIV M 106 89 Where: Note: all numbers are hexadecimal M-a memory address AC - accumulator Sample program: //line 1 /line 2 //line 3 //line 4 //line 5 //line 6 LOAD 100 ADD 101 STORE 106 LOAD 102 SUB 103 STORE 105 Answer the following questions based on the given information above. 1. What is the content of memory location 106 after executing line 3? 2. What is the content of memory location 105 after executing line 6? 3. Write a program segment that will multiply the content of memory location 105 with the content of AC and store the result at memory location 100. а. b. 4. For this CPU, what is the width of the program counter? (express answer in terms of bits, do not include the word "bits" in your answer)
For each question, give the following three values for the last line of each code block following the execution of the entire block: 1. the memory address which that line writes to, 2. the value that is written to that address, and 3. the number of distinct memory reads required by that line. If you cannot determine the memory address from the information given, enter 0 for the address. When computing the number of memory reads, assume nothing about the value of registers prior to the execution of the last statement: count a read even if the previous line also read (or wrote) the location. Count the number of distinct memory locations read by that statement; that is, if the line reads a memory location multiple times, count it only once. Assume that memory accesses always succeed, i.e. that all memory addresses are accessible to the program. For example, for the following code block: int *foo (int *)0x1000; int *bar = (int *)0x1000; *foo = 1; *foo=foo + *bar + 1; you would answer…
Assume all of Pep/9's main memory is filled up with unary instructions. How many steps are there in each one? B) If there are no unary instructions, how many instructions can fit in the main memory? An equal number of unary and nonunary instructions are stored in the main memory. What is the total number of instructions?
A 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, similar to Marie). Each instruction is stored in one word of memory. 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?
The description of three-address instructions species the components of each type of instruction, but it does not specify the representation of these instructions in a data structure. Write the three – address code for the following expressions:(i) a = b * −c + b * −C(ii) A = −B * (C + D)(iii) (4 * 7 + 1) * 2(iv) a * - (b + c)
Q: Compute the physical address for the specified operand in each of the following instructions. The register contents and variable are as follows: (CS)=0A00H, (DS)=0BO0H, (SS)=OD00H, (S)-OFFOH, (DI)-вон, (ВР)-00EАН and (IP)-0000H, LIST-0OFOH, АХ-4020H, Вх-2500H. 1) Destination operand of the instruction MOV LIST (BP+DI] , AX 2) Source operand of the instruction MOV CL, [BX+200H] 3) Destination operand of the instruction MOV [DI+6400H], Dх 4) Source operand of the instruction MOV AL, (BP+SI-400H] 5) Destination operand of the instruction MOV (DI+SP] , AX 6) Source operand of the instruction MOV CL, [SP+20OH] 7) Destination operand of the instruction MOV [BX+DI+6400H] , CX 8) Source operand of the instruction MOV AL, [BP- 0200H] 9) Destination operand of the instruction MOV [SI) , AX 10) Destination operand of the instruction MOV (BX][DI]+0400H,AL 11) Source operand of the instruction MOV AX, [ВP+20он] 12) Source operand of the instruction MOV AL, (SI-0100H] 13) Destination operand of…