Skip to main content Link Menu Expand (external link) Document Search Copy Copied

HW3 - Binary Modulo

This is the first of two assignments in which you will write binary code for the simple machine you created a simulator for in lab. It is much simpler than the second one, and will take much less time. Both assume that you have understood that lab’s content well.

The instructions

icode Behaviors:

icode operation

rA = rB


rA += rB


rA &= rB


rA = read from memory at address rB


write rA to memory at address rB


do different things for different values of b:

b action
0 rA = ~rA
1 rA = -rA
2 rA = !rA
3 rA = pc

do different things for different values of b:

b action
0 rA = read from memory at pc + 1
1 rA += read from memory at pc + 1
2 rA &= read from memory at pc + 1
3 rA = read from memory at the address stored at pc + 1

In all 4 cases, increase pc by 2, not 1, at the end of this instruction


Compare rA (as an 8-bit 2’s-complement number) to 0; - if rA <= 0, set pc = rB - otherwise, increment pc like normal.

Running programs

You should create two files

  1. One you work with, that has comments and notes to keep you sane. Call this anything you like.
  2. One you run and submit, which contains nothing but hex bytes separated by white space. You’ll submit this as a file named mod.binary (or mod.binary.txt if needed)

To test your code, do one of

python3 mod.binary


java SimBase mod.binary

or going to our online simulator and click the file upload button at the top of the page to load your mod.binary into the simulator’s memory.

Your task

Your code should

  1. Load the values in memory at addresses 0x01 and 0x03 into registers
    • Note: since we have not discussed ways to get other data into our memory yet, we will directly modify your code so that the second (0x01) and fourth (0x03) bytes are the input values. This means your first (0x00) and third (0x02) bytes (instructions) should be very specific operations.
  2. Compute the modulo of those values (i.e., (what’s at 0x01) mod (what’s at 0x03))
  3. Store the product at address 0xD0
  4. Halt once it is done

For example, if mod.binary begins __ 10 __ 06 then when it is finished it should have 04 in address 0xD0; in decimal, that is 16 mod 6, which is 4. If mod.binary begins __ 7F __ 0A then when it is finished it should have 07 in address 0xD0; in decimal, that is 127 mod 10, which is 7.

Note: We should be able to change the second and fourth bytes of your program to do other modulo calculations too.

You may assume that neither value will be negative, but either may be zero. If either operand is 0, your code should set the value at 0xD0 to 0x00.

Hints, tips, and suggestions

How to compute modulo

Modulo, a mod n or a % n, is defined as the remainder when dividing a by n. As in our examples above with 16 mod 6, \(16 / 6 = 6 * 2 + 4\), where the quotient is 2 and the remainder is 4. Therefore, 16 mod 6 = 4. The Wikipedia page on modulo has a more formal definition.

Hint: For the division operation, think along the lines of “how many times can \(n\) fit into \(a\)?” You may wish to consider multiples of \(n\).

You definitely want to make sure you can write working code for this in some language you know well before trying to convert that code into binary.

How to write binary

We suggest following these steps, carefully, saving the result of each in a file so you can go back and fix them if they were wrong:

  1. Write pseudocode that does the desired task
  2. Convert any for loops to while loops with explicit counters
  3. Change any if or while guards to the form something <= 0
    • a <= b becomes a-b <= 0
    • a < b becomes a+1 <= b becomes a+1-b <= 0
    • a >= b becomes 0 >= b-a becomes b-a <= 0
    • a > b becomes 0 > b-a becomes b+1-a <= 0
    • a == b becomes a-b == 0 becomes !(a-b) == 1 becomes !!(a-b) <= 0
    • a != b becomes a-b != 0 becomes !(a-b) == 0 becomes !(a-b) <= 0
  4. Add more variables to split multi-operation lines into a series of single-operation lines
  5. Add more operations to convert ones not in the instruction set into ones in the instruction set
  6. Change each loop into a pair of instructions, opening with “spot1 = pc” and closing with “if …, goto spot1
  7. Count the number of variables needed
    • If1 it is ≤ 4, skip to step 10
    • else2, continue with next step
  8. Pick a memory address for each variable. Make these big enough your code is unlikely to get that big; for example, you might pick 0x80 though 0x80 + number of variables
  9. Convert each statement that uses variables into
    1. register ← load variable’s memory
    2. original statement
    3. store variable’s memory ← register
  10. translate each instruction into numeric (icode, a, b) triples, possibly followed by a M[pc+1] immediate value
  11. turn (icode, a, b) into hex
  12. Write all the hex into mod.binary

Debugging binary is hard. That’s part of why we don’t generally write code in binary. If you get stuck, you should probably try pulling just the part you are stuck on separate from the rest and test it until it works, then put it back in the main solution.


Submit your mod.binary file via Gradescope.

  1. depending on how you write your original code, this is possible for this task … 

  2. … some solutions are in this case instead. 

Copyright © 2023 John Hott, portions Luther Tychonievich.
Released under the CC-BY-NC-SA 4.0 license.
Creative Commons License