Language of Computer :

Unsigned Binary Integers

x = x_n-12^n-1 + x_n-22^n-2 + …… + x₁2¹ + x₀2⁰

ini adalah formula bagi n-bit nombor.

-Julatnyan dari 0 hingga 2^n-1

-contoh 1

0000 0000 0000 0000 0000 0000 0000 1110₂

= 0 + …… + 1³2³ + 1²2² + 1¹2¹ + 0⁰2⁰

= 0 + 8 + 4 + 2 + 0

= 14₁₀

2s-Complement Signed Integers

-contoh 2

1111 1111 1111 1111 1111 1111 1111 1001₂
= –1×2³¹ + 1×2³⁰ + …+1×2³ +0×2² +0×2¹ +1×2⁰
= –2,147,483,648 + 2,147,483,641

= –7₁₀

-contoh 3

0₁₀ = 0000 0000 0000 0000 0000 0000 0000 0000₂

-contoh 4

-1₁₀ = 1111 1111 1111 1111 1111 1111 1111 1111₂

-contoh 5

+5 = 0000 0000 … 0101₂

-5 = 1111 1111 … 1010₂ + 1

  = 1111 1111 … 1011₂

R – format Instruction

op: operation code (opcode)

rs: first source register number

rt: second source register number

rd: destination register number

shamt: shift amount (00000 for now)

funct: function code (extends opcode)

-contoh 6

add $t0, $s1, $s2

 000000100011001001000000001000002 = 02324402016

Hexadecimal

-contoh 7

abcf0976₁₆

= 1010 1011 1100 1111 0000 1001 0111 0110₂

MIPS I – format Instructions

op: operation code (opcode)

rs: first source register number

rt: second source register number

Constant: –215 to +215 – 1

Address: offset added to base address in rs

-contoh 8

A[300] = h + A[300]

lw      $t0,1200($t1)

add    $t0,$s2,$t0

sw     $t0,1200($t1)