How a procedure define in assembly, Computer Engineering

Assignment Help:

Q. How a Procedure define in Assembly ?

Procedure is defined within source code by placing a directive of form:

PROC

A procedure is terminated using:

ENDP

The is identifier used for calling the procedure and is either FAR orNEAR. A procedure can be defined in:

1.  The same code segment as the statement which calls it.

2.  A code segment which is different from one comprising the statement which calls it however in the same source module as calling statement.

3.  A different source module and segment from calling statement.

In the first case code NEAR must be used as the procedure and code are in same segment. For latter two cases should be FAR.


Related Discussions:- How a procedure define in assembly

What are the types of assemblies, What are the Types of Assemblies? One...

What are the Types of Assemblies? One of the drawback of using Visual Studio.NET and the .NET framework to develop applications has been the lack of cross-platform support. As

What is hashing, What is Hashing? Hashing: Hashing gives the direct acc...

What is Hashing? Hashing: Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing functio

C++, what is polymorphism

what is polymorphism

Speed of memory versus speed of CPU, In the past there was a large gap betw...

In the past there was a large gap between speed of a memory andprocessor. So a subroutine execution for an instruction for illustration floating point addition may have to follow a

Software engineering, #quest2. Each time a defect gets detected and fixed, ...

#quest2. Each time a defect gets detected and fixed, the reliability of a software production..

What is full form of bdc session, What is full form of BDC Session? Bat...

What is full form of BDC Session? Batch Data Communication Session.

Data structures.., in asingle function declaration what is maximum no of st...

in asingle function declaration what is maximum no of statements that may be recursive calls

By which finders are connected, In step by step switching line finders are ...

In step by step switching line finders are connected to the (A) Calling subscriber.                   (B) Switching network. (C) Called subscriber.                    (

Sort Wars, If quicksort is so quick, why bother with anything else? If bubb...

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

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