Syntax of a Procedure in assembly language, Basic Computer Science

There are two kinds of procedures, the intrasegments, which are found on the similar segment of instructions and the inter-segments which can be stored on dissimilar memory segments.
The value of IP is stored on the stack, when the intrasegment procedures are used and when the intrasegments are used the value of CS: IP is stored.
To redirect the flow of a procedure (calling it), the following directive is used:
CALL Name of the Procedure
The parts which create a procedure are:
• Declaration of the procedure
Code of the procedure
Return directive
Termination of the procedure
The calling of this procedure is done the following way:
Call Adding
Macros recommend a greater flexibility in programming contrasted to the
procedures; nonetheless, these last ones will at rest be used.
Posted Date: 5/4/2012 8:10:09 AM | Location : United States







Related Discussions:- Syntax of a Procedure in assembly language, Assignment Help, Ask Question on Syntax of a Procedure in assembly language, Get Answer, Expert's Help, Syntax of a Procedure in assembly language Discussions

Write discussion on Syntax of a Procedure in assembly language
Your posts are moderated
Related Questions
Assembly language : Assembly language is a low level programming language similar to machine language, but far easier to write and understand because machine language binary in

Question 1 Write a note on modems Question 2 What are the Safe Chatting Rules Question 3 Explain three basic kinds of hypertext links Question 4 Write a no

Cryptography, the study of secret writing, has been around for a very long time, from simplistic techniques to sophisticated mathematical techniques. No matter what the form howeve

The basic parts of a computers are shown in Figure.   Input devices such as a keyboard, mouse or scanner are used to enter input (data and/or instructions), directly

Consider a CPU that implements two parallel fetch-execute pipelines for superscalar processing. Show the performance improvement over scalar pipeline processing and no-pipeline pro


Problem 1. Obtain the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1. x is 1 for all other conditions.

write an algorithm and psuedo code for the operation of the cramer`s rule


speed up factor for superscalar architecture