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

Syntax of $display and $strobe, Syntax of $display and $strobe -  $disp...

Syntax of $display and $strobe -  $display ("format_string", par_1, par_2, ... ); -  $strobe ("format_string", par_1, par_2, ... ); -  $monitor ("format_string", par_1, p

Communication between memory and the processor, How are instructions sent b...

How are instructions sent between memory and the processor? Both the instruction pointer (IP) and program counter (PC) utilized to holds the memory address of the next inst

Define top-down parsing techniques, Define Top-down parsing Techniques ...

Define Top-down parsing Techniques Top-down parsing can be observed as an attempt to find left-most derivations of an input-stream through searching for parse trees using a top

Biscuit factory circuit, Biscuits move on a conveyer through an oven where ...

Biscuits move on a conveyer through an oven where they are cooked.   Two sensors, H and C, measure the temperature of the oven, H = 1 if the oven is too hot and C = 1 if the ove

What are problems of clock skew, What are problems of clock skew? This ...

What are problems of clock skew? This is typically because of two causes. The primary is a material flaw that causes a signal to travel faster or slower than imagined. The seco

Pipe and filter , How to draw the pipe and filter using data flow and it co...

How to draw the pipe and filter using data flow and it components and connectors

How many tables can an append structure be assigned, To how many tables can...

To how many tables can an append structure be assigned. One table can be assigned to append structure.

Self knowledge - characteristics of an experts system, An experts system ...

An experts system has knowledge that lets it reason about its own operations plus a structure that simplifies this reasoning process. For example if an expert system

Illustrate single in-line memory modules, Q. Illustrate Single In-line Memo...

Q. Illustrate Single In-line Memory Modules? From early days of semiconductor memory till the early 1990s memory was manufactured, brought and installed as a single chip. Chip

Minimize the logic function using NAND gate, Minimize the logic function F(...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates:  In

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