Illustrate program on hypothetical machine, Computer Engineering

Assignment Help:

Q. Illustrate program on hypothetical machine?

The program given in figure above is a hypothetical program which performs addition of numbers stored from locations 2001 onwards until a zero is encountered. Consequently X is initialized to 2001 whereas MBR which stores the result is initialized to zero. We have presumed that in this machine all operations are performed by CPU. The programs will execute instructions as:

215_Illustrate program on hypothetical machine.png

SKIP instruction is a zero-address instruction and skips next instruction to be executed in sequence. Or we can say it increments the value of PC by one instruction length. The SKIP also can be conditional. For illustration the instruction ISZ skips the next instruction only if the result of most recent operation is zero. 

715_Illustrate program on hypothetical machine1.png

CALL and RETN are used for CALLing subprograms and RETurning from them. Presume that a memory stack has been built such that stack pointer points to a non-empty location stack and expand in the direction of zero address.


Related Discussions:- Illustrate program on hypothetical machine

Hierarchical design in multisim, It is recommended that you capture your as...

It is recommended that you capture your assignment as a Hierarchical Design in Multisim. Look at the Help topic Working with Larger Designs. Design and thoroughly test each module

What is the difference among save and save as, Use SAVE when you are revisi...

Use SAVE when you are revising an existing document. Use SAVE AS when you are making a new document from scratch or an existing document. This will remain the original document

Risc approach - computer architecture, RISC Approach - computer architectur...

RISC Approach - computer architecture: The RISC processors only use easy instructions that can be executed within one clock cycle. therefore, the "MULT" command discussed abov

Identify the fastest logic gate, Which of the following is the fastest logi...

Which of the following is the fastest logic ECL, TTL, CMOS or LSI ? Ans. The fastest logic is ECL.

Define pipeline speedup, Define pipeline speedup. S(m)=T(l)/T(m) Whe...

Define pipeline speedup. S(m)=T(l)/T(m) Where T(m) is the execution time for some target workload on an m-stage pipeline. T(l) is the execution time for some workload an

Children''s game of rock, Design a game application that plays the children...

Design a game application that plays the children's game of rock, paper, scissors. The user enters a letter indicating a choice. The Math.random method is then used to pick a value

What do you mean by complexity of an algorithm, What do you mean by complex...

What do you mean by complexity of an algorithm? The term complexity is used to define the performance of an algorithm. Typically performance is calculated in terms of time or s

Managerial benefits, MANAGERIAL BENEFITS Implement integrated relia...

MANAGERIAL BENEFITS Implement integrated reliability engineering and product assurance program in all aspects of the product life-cycle, covering purchase, engineering, R&D

Explain how the different access methods work, Question: (a) Primary an...

Question: (a) Primary and secondary memory differs in their way they access data: (i) Mention the four generic access methods usually present in a computer system. (ii) E

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd