Last updated: 4/2/01
Link back to course Welcome...

Paper and Pencil Computer: Assignment #1.

Working in small groups (three to four), complete the problems for the Paper and Pencil Computer programs below. Include the names of each member of the group.

Each memory location is shown with its binary address in the top left corner in small text, and its binary contents in the bottom left corner in larger text. Enough room is left for you to write in new contents, but do this in pencil, because the contents may change more than once. First, review the top table for the Worksheet.

Problem 1. PC starts at 00000 (that is, put 00000 in the PC and start the instruction cycle).

00000

01111011

00001

00111010

00010

10011001

00011

11011001

00100

00011111

00101

10100011

00110

00110011

00111

11001100

01000

01001100

01001

01011011

01010

11000110

01011

11011000

01100

10101100

01101

10110011

01110

01011111

01111

10011010

10000

11101110

10001

10011011

10010

10110111

10011

10110111

10100

00110110

10101

01101111

10110

11010011

10111

01100101

11000

01101101

11001

10011000

11010

00001110

11011

00001011

11100

00011010

11101

00000001

11110

00011010

11111

10010011

 

 

 

 

 

 

 

 

Problem 2. PC starts at 00010.

00000

00000001

00001

00111010

00010

01110000

00011

11100101

00100

00011111

00101

01100010

00110

00100000

00111

10000010

01000

11100010

01001

01011011

01010

11000110

01011

11011000

01100

10101100

01101

10110011

01110

01011111

01111

10011010

10000

00000110

10001

00011011

10010

10110111

10011

00000000

10100

00110110

10101

01101111

10110

11010011

10111

01100101

11000

01101101

11001

10011000

11010

00001110

11011

00001011

11100

00011010

11101

00000001

11110

00011010

11111

10010011

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Problem 3: PC starts at 00010

NOTE: Each time the computer executes a 101 (Read) instruction, you will have to make up a different number that the user types. In each case, make it an eight-bit number (0 to 255). Choose two non-zero numbers, and then zero.

00000

00000000

00001

00000000

00010

10100001

00011

11000001

00100

01100000

00101

00100001

00110

10000000

00111

01100001

01000

11100010

01001

11000000

01010

00000110

01011

11011000

01100

10101100

01101

10110011

01110

01011111

01111

10011010

10000

11101110

10001

10011011

10010

10110111

10011

10110111

10100

00110110

10101

01101111

10110

11010011

10111

01100101

11000

01101101

11001

10011000

11010

00001110

11011

00001001

11100

00011010

11101

00000001

11110

00011010

11111

10010011