operand


Also found in: Dictionary, Thesaurus, Acronyms, Wikipedia.
Related to operand: Opcode

operand

a quantity or function upon which a mathematical or logical operation is performed

operand

[′äp·ə‚rand]
(computer science)
Any one of the quantities entering into or arising from an operation.

operand

(programming)
An argument of an operator or of a machine language instruction.

operand

The part of a machine instruction that references data or a peripheral device. In the instruction, ADD A to B, A and B are the operands (nouns), and ADD is the operation code (verb). In the instruction READ TRACK 9, SECTOR 32, track and sector are the operands.
References in periodicals archive ?
So when IEEE compatibility is claimed by two systems, in practice, computational results using extremely small operands can differ, if the two platforms do not agree in their use of gradual underflow.
Using the modifier suffix mt, it becomes possible to incorporate test vectors where the exponent of one operand is at least t less than the exponent of the other operand.
Step #3: For each operand row determine the integer quotient Q equal to the row's operand divided by the operator.
The emit code sequences also perform strength reduction of integer multiply, divide, and modulus operations with a single static operand.
Java bytecode instructions must receive constant operands from the stack.
Part of the motivation for this work was the fact that static analysis of input operand sizes has several disadvantages.
Distance operators: These select from the first operand elements that are at a given distance of some element of the second operand, under certain additional conditions.
As is referred to above, Vennemann had asserted before that the construction of subject and predicate (verb) should belong to quite a different dimension than that of operator and operand.
In [8] and [9] it is reported that (6, 3) counter arrays give best performance result for the reduction of partial products and multi-operand addition input operand reduction, whenever 6-input LUT structures are implemented.
Here we used a shift register for the second operand and a multiple generator.
If any source operand of these instructions has a copy, we compare its value with that of its copy by inserting a compare instruction.
The algorithm will process all items in the postfix queue: each time an operand is read, it will add it to the stack; and each time an operator comes up, it will extract the required operands from the stack (one or two, depending if it is a unary or binary operator), perform the operation, and push the result back to the stack.