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

Explain vector reduction instructions, Vector reduction Instructions Wh...

Vector reduction Instructions When operations on vector are being decreased to scalar items as a result then these are vector reduction instructions. These instructions are ref

What is drop-down list, A dialog box such as a File menu that have one comm...

A dialog box such as a File menu that have one command until it is clicked when a number of dissimilar commands "drop-down."

Write an algorithm for deadlock detection, Write an algorithm for deadlock ...

Write an algorithm for deadlock detection. An algorithm for deadlock detection: 1. Assume that Work and Finish be vectors of length m and n, correspondingly. Initialize:

Explain elements of language grammer, Explain elements of language Gram...

Explain elements of language Grammer . As proposed through Noam Chomsky, a grammar G contains the following elements: a. A finite set N of non terminal symbols. b. A f

What is fan-out, What is fan-out? Estimate the average count of every "...

What is fan-out? Estimate the average count of every "many" association encountered with the path. Multiply the individual fan-outs who obtain the fan-out of the whole path, wh

What is the use of boot block, What is the use of boot block? For a com...

What is the use of boot block? For a computer to start running when powered up or rebooted it needs to have an initial program to run. This bootstrap program tends to be simple

Projects on cluster computing, Some famous projects on cluster computing ar...

Some famous projects on cluster computing are as follows: High Net Worth Project: (developed by: Bill McMillan, JISC NTI/65 - The HNW Project, University of Glasgow, The prim

Instruction set for ia - 64 architecture, Q. Instruction set for IA - 64 ar...

Q. Instruction set for IA - 64 architecture? Instruction set: Architecture gives instructions for multimedia operations as well as floating point operations. Itanium supports

Define congestion, Define Congestion. Congestion: This is uneconomic ...

Define Congestion. Congestion: This is uneconomic to give sufficient equipment to carry all the traffic which could possibly be offered to a telecommunication system. Inside

Explain the relationship b/w translated & load time address, Explain the re...

Explain the relationship amongst Translated address and Load time address. Translated address: Address assigned through the translator Load time address: Address ass

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