Comparison instructions , Basic Computer Science

They are used to evaluate operators, and they have an effect on the content of the flags.
CMP
CMPS (CMPSB) (CMPSW)
CMP INSTRUCTION
Idea: To measure up to the operators.
Syntax:
CMP destiny, source
This instruction subtracts the source operator from the destiny operator but with no this one storing the outcome of the operation, and it only concerns the state of the flags.

CMPS (CMPSB) (CMPSW) INSTRUCTION
Idea: To compare sequences of a byte or a word.
Syntax:
CMP destiny, source
With this instruction the series of source characters is subtracted from the destiny chain.
DI is used as an index for the additional segment of the source chain, and SI as an index of the destiny series.
It only affects the content of the flags and DI as well as SI is incremented.
Posted Date: 5/4/2012 7:18:33 AM | Location : United States







Related Discussions:- Comparison instructions , Assignment Help, Ask Question on Comparison instructions , Get Answer, Expert's Help, Comparison instructions Discussions

Write discussion on Comparison instructions
Your posts are moderated
Related Questions
a cloth merchant A cloth showroom has announced the following seasonal discounts on purchase of items: Purchase amount Discount Mill items Handloom items 0-100 - 5% 101-200 5% 7.5%

The role of array processor

compare encoders and multiplers

These addressing modes are: With immediate addressing, no lookup of data is essentially required. The data is located in the operands of the instruction itself, not in a different

write an essay explaining the following: 1.Storage aspects a. Disk formatting, b.Disk boot block ,c.Bad block removal, d.Compensation.

Basic steps/tasks involved in spreadsheets development

Laser Printers: These printers can print a whole page at one command, offer highest quality and can combine text, graphics, etc. They are generally restricted to A4 paper and

• It is also known as Shortest-Process-Next (SPN). • Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-


what is the logic diagram for the Boolean expression x''y + xy'' + xz