
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
A computer is available without an instruction pointer (IP) or program counter (PC). Instead, all
instructions contain three parts: an operation code, an address of an operand, and the address of the next
instruction. The operation code consists of 6 bits and the computer has a memory unit of 8192 words.
a) How many bits must be in a memory word if an instruction is stored in one word? Show the instruction word
format.
b) What other register is needed in the control unit besides an operation register?
c) List the micro-operations for the instruction fetch cycle of this computer. Use any register specified in part (b).
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

Knowledge Booster
Similar questions
- Imagine we have a small computer which contains a simplified version of a CPU and RAM. The CPU can execute a single program that is stored in the RAM, and while running the program it can access 3 memory locations: its internal register AL, and two RAM locations that we'll call address 1 and address 2. Since this is a simplified computer it is able to skip some of the steps to access memory that are in our textbook, but accessing RAM still takes longer than accessing AL. The only values this computer is capable of storing in memory are unsigned bytes (8 bit binary numbers), and when it starts running a program all 3 of its memory locations initially contain the value 00000000. Here is a list of all of the instructions our imaginary computer can perform: Write [number] to AL This instruction takes the operand [number], which must be an 8-bit binary number, and puts it into AL. This overwrites whatever was in AL previously. It takes 3 cycles to complete: 1 cycle each to fetch, decode,…arrow_forwardPlease answer all the following questions. 1. In a hypothetical computer, the processor has four registers: an 8-bit Program Counter (PC), a 16-bit Accumulator (AC), a 16-bit Counter (CTR), and a 12-bit Pointer (PTR). The memory is divided into words each of which is 16-bit long. Each word can hold either an instruction or a piece of data. For each instruction X, the four most significant bits (denoted by X15-12) represent an opcode. The rest of the instruction (denoted by X11-0) can be either an address or a value of an operand. The table below explains some of the instructions supported by the processor. Opcode (binary) 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 Operation Load AC from a memory location whose address is X11-0. Store AC into a memory location whose address is X11-0. Add to AC the contents of a memory location whose address is the value of PTR. The result is saved to AC. 1100 Subtract from AC the contents of a memory location whose address is the value…arrow_forwardComputer architecturearrow_forward
- Highlight the data path (shown below) and show control values when a jump instruction is executed.arrow_forwardComputer Architecture Consider a computer that has a number of registers such that the three registers R0 = 1500R1 = 4500R2 = 1000 Show the effective address of memory and the registers’ contents in each of the following instructions (assume that all numbers are decimal). 1. ADD (R0)+, R2 2. SUBTRACT - (R1), R2 3. MOVE 500(R0), R2 4. LOAD #5000, R2 5. STORE R0, 100(R2)arrow_forwardIt is necessary to convert mnemonics to binary machine code because the central processing units (CPUs) of microprocessors do not understand them in their original form.arrow_forward
- The three alternative designs for a computer's central processing unit (CPU) are a general register, a single accumulator, or a stack. Each one has a unique set of benefits and drawbacks. It is up to you to respond, and the response you give might be right or it might be wrong.arrow_forwardAssume 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 Mbarrow_forwardSuppose a program’s 15-th logical instruction (counting starts from zeroth) is at physical address 1234ABDE16 in the RAM. (contents of any logical address fits into any physical address) What is the physical address in the RAM where the program has been loaded? What is the physical address in the RAM of the last instruction of the program if it has 37 logical instructions altogether?arrow_forward
- Computer Architecture (Already submit this question, but I think I got wrong solution) Consider a computer that has a number of registers such that the three registers R0 =1500, R1 = 4500, and R2 = 1000 Show the effective address of memory and the registers’ contents in each of the following instructions 1. ADD (R1), R2 2. MOVE 500(R0), R2 3. ADD (40), R1 4. SUBTRACT (5000), R2 5. ADD #30, R2arrow_forwardSuppose the RAM for a certain computer has 4M words, where each word is 16 bits long. What is the capacity of this memory expressed in bytes? If this RAM is byte addressable, how many bits must an address contain? If this RAM is word addressable, how many bits must an address contain?arrow_forwardComputer Sciencearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY