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

Write short note on quantization, Write short note on Quantization. Qua...

Write short note on Quantization. Quantization: This is the first step in PCM. The whole amplitude range of the modulating signal is divided in a number of standard levels term

Scientific applications-image processing, Scientific Applications/Image pro...

Scientific Applications/Image processing Most of parallel processing functions from science and other academic subjects, are mainly have based upon arithmetical simulations whe

Design a mod-5 synchronous counter using J-Kflip-flops, What are synchronou...

What are synchronous counters? Design a Mod-5 synchronous counter using J-K Flip-Flops. Ans. Synchronous Counters : It means that all flip-flops are clocked concurrently. T

Id3 algorithm, ID3 algorithm: Further for the calculation for informat...

ID3 algorithm: Further for the calculation for information gain is the most difficult part of this algorithm. Hence ID3 performs a search whereby the search states are decisio

Explain about dual in line memory modules, Q. Explain about Dual In line Me...

Q. Explain about Dual In line Memory Modules? A DIMM is capable of delivering 64 data bits right away. Usual DIMM capacities are 64MB and up. Every DIMM has 84 gold patted conn

How to working in dreamweaver, Q. How to Working in Dreamweaver? Let's ...

Q. How to Working in Dreamweaver? Let's now start our journey into the realm of Dreamweaver. We begin with typing in a few test lines in Design view. See that how our work area

Draw a schematic for managing dynamic storage allocation, Draw a simple sch...

Draw a simple schematic for managing dynamic storage allocation. A simple schematic for managing dynamic storage allocation is as follows: Block size pointe

Explain classless inter-domain routing, Explain Classless Inter-Domain Rout...

Explain Classless Inter-Domain Routing. It is a new addressing scheme for the internet that permits for more efficient allocation of IP addresses than old class A, B and C addr

List one advantage & disadvantage of having large block size, List one adva...

List one advantage and one disadvantage of having large block size. Ans: Advantage: By using a huge block of memory is maximum process's accommodation that resulting is less no

Hardware implementation for signed-magnitude data, Hardware Implementation ...

Hardware Implementation for signed-magnitude data When multiplication  is  implemented  in  digital  computer,  we  change  process lightly. Here, in place of providing registe

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