Programming instructions

OCTAL
MNEMONIC
CODE TIME
SYMBOL
(BITS O-3)
(b-c)
OPERATION
tad Y
34
16 Two’s complement Add. The C(Y) are
added to the C(AC) in 2’s complement
arithmetic. The result is left in the AC and
the original C(AC) are lost. The C(Y) are
unchanged. A carry out of the 0 bit corn:
plements the Link.
C(Y) + C(AC) => C(AC).
xor Y
and Y
sad Y
24
50
54
16 Exclusive OR. The logical operation Ex-
clusive OR is performed between the C(Y)
and the C(AC). The result is left in the AC
and the original C(AC) are lost. The C(Y)
are unchanged. Corresponding bits are
compared independently.
C(Yj) V C(ACj) => C(ACj).
Example
C(AC)j original
W>i
C(AC)i final
0 0 0
0
1 A
1
1
1 1 0
16 AND. The logical operation AND is per-
formed between the C(Y) and the C(AC).
The result is left in the AC, and the orig-
inal C(AC) are lost. The C(Y) are un-
changed. Corresponding bits are com-
pared independently.
C(Yj) A C(ACj) => C(ACj)
Example
16
C(AC) jrnal 1 Cr 1 C(ACi final
Skip if AC is Different from Y. The C(Y)
are compared with the C(AC). If the num-
bers are the same, the computer proceeds
to the next instruction. If the numbers
are different, the next instruction is skip-
ped. The C(AC) and the C(Y) are un-
changed.
If C(AC) # C(Y) then C(PC) + 1 => C(PC).
19