Purchase Solution

Push pop using indirect addressing

Not what you're looking for?

Ask Custom Question

Create a stack area at 1000h. Push 10h bytes, located at data memory addresses 60000h to 6000fh, on the stack using indirect addressing. Then pop the stack to memory addresses 62000h to 6200fh using indirect addressing. Load unique data into the 10h bytes in order to test the program.

Purchase this Solution
Solution Summary

Create a stack area. Pop the stack to memory addresses using indirect addressing.

Solution Preview

Solution to Posting ID: 31600

/*Load Immediate Stack Ptr */
LXI SP,1000H

/*Load HL Direct - which is now memory (M = 60000) */
LHLD 60000H

MVI M,10H
MOV B,M
PUSH B

INR M /* M = 60001 */
MVI M,11H
MOV B,M
PUSH B

INR M
MVI M,12H
MOV B,M
PUSH B

INR M
MVI M,13H
MOV B,M
PUSH B

INR ...

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

C# variables and classes

This quiz contains questions about C# classes and variables.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

View More Free Quizzes
Related BrainMass Solutions

  • C++ stack class with inheritance storing integers, strings

    (int n) // push now checks for stack overflow { if (top < MAX-1) { stack::push(n); // calling push() of superclass return true; } else return false; } bool pop(int &n) // new pop() prevents

  • basic, stack, data, structure

    Let us say you are given a basic stack data structure with just "core" operations push and pop. Is it possible to implement top using these two operations? Explain. (or) Are the following code segments equivalent? Why?

  • Interchange contents of working registers

    DX PUSH BX PUSH CX PUSH DI PUSH SI /* Popping data from stack in an order such that the values are interchanged*/ POP DI POP SI POP BX POP CX POP AX POP DX HLT See the attached file.

  • Stacks Problem

    push("r"); push("a"); push("i"); push("n"); pop(); // "n" is popup pop(); // "i" is popup pop(); // "a" is popup pop(); // "r" is popup Finally, we get "niar" 2.

  • Data Structure and Algorithms

    Pop NumStk: R=4. Pop NumStk: L=3. L op R = 3 * 4 evaluates to 12. Push 12 onto NumStk. ● read following space. ● read '+'. Pop NumStk: R=12. Pop NumStk: L=2. L op R = 2 + 12 evaluates to 14.

  • Use a stack to reverse the contents of a file

    278712 Data Structure Problem : stack class implementation with push/pop File Reverser Write a program that opens a text file and reads its contents into a stack of characters.

  • Comparing Address Machines

    B,A,D,E*F> MUL // ADD // DIV //<(C*B+A)/D,E*F> SUB //<(A+B*C)/D-E*F > POP X // Here we are using stack to store the result and finally stores the result back into X Each push and

  • Data Structures in C++ Using STL

    • Pop- The function pop() removes the first element of the queue. • Push - The function push() adds the element at then end of the queue. • Size- The function size() returns the size of the queue.

  • Push down automata

    (S0,a) --> ({Push a, Push a}, S0) ; this will take care of 2n bs.

View More Related Solutions