Suppose a computer has a 32-bit instruction format with four fixed-length fields: Opcode field to specify one of 111 operation codes Address mode field to specify one of 16 addressing modes Register address field to specify one of 70 available registers Memory address field to specify a memory location

1. (8 points) Suppose a computer has a 32-bit instruction format with four fixed-length fields:

Opcode field to specify one of 111 operation codes

Address mode field to specify one of 16 addressing modes

Register address field to specify one of 70 available registers

Memory address field to specify a memory location

• 1. How many bits are needed for the opcode field?
  2. How many bits are needed for the address mode field?
  3. How many bits are needed for the register address field?
  4. Given that the memory is byte addressable how much memory can be addressed?

1. (8 points) Given the following assembly code complete each of the binary calculations by hand. Indicate the resulting value as a signed integer, the overflow flag and whether the result is valid as a signed integer.
2. mov al, 107 add al, 21
3. mov bl, -30 add bl, -98

1. (6 Points) Show how each of the following arrays would be stored in hex on a little endian computer.

1. (2 points) A computer has an instruction length of 8 bits and the size of an address field is 2 bits. Is it possible to have the following instructions? Justify your answer.

10 2 address instructions

20 1 address instructions

20 0 address instructions

1. (4 points) Suppose we have the instruction LOAD 800 and memory:

• 1. What would be loaded if the addressing mode is immediate?
  2. What would be loaded if the addressing mode is direct?
  3. What would be loaded if the addressing mode is indirect?
  4. What would be loaded if the addressing mode is indexed and the implied register held the value 200?

1. (10 points) Write an assembly program that contains the following integer definitions:

val1: an 8-bit integer initialized to 23

val2: a 32-bit signed integer initialized to -117 val3: a 16-bit signed integer initialized to 62

The program should perform the calculation ((val3 – 1) – val2) – (val1 + 5) and save the result in a memory location named val4. You need only show the .code and .data segments of the code.

1. (20 points) Write an assembly program that subtracts 5 from every value in an array. For example, if the array was (1,2,3,4,5) it should be changed to (-4,-3,-2,-1,0). Make the program as flexible as possible if the array size and type should be changed in the future.

You need only show the .code and .data segments of the code. a) Using indirect addressing.

b) Using indexed addressing.

1. (8 points) For each of the following Boolean expressions, simplify the expression (using Boolean identities) and draw the corresponding simplified logic circuit a) ( ( x ( y + x’ ) + ( y + x’ ) ) )’

b) x + y’ + ( ( x y )’ ( x’ + y ) )’

1. (10 points) Given the following truth table:

• 1. Derive an expression for F in canonical form (sum of products):
  2. Simplify the expression using Kmaps.
  3. Draw the Logic diagram that implements the simplified expression.

1. (4 points) Find the Hamming code word for the binary string 10101000.

1. (4 points) Find the product of -5 and 7 using Booth’s Algorithm. (Use 4-bit operands)

Having great experience of working on various projects, academic writing tasks, essays, dissertations, proposals, presentations, spreadsheets, and reports. We have great research, communication, and problem-solving skills that distinguish us from others. We are responsible, committed, and dedicated to meeting the deadline by submitting high-quality work. We use SPSS, Eviews, and Stata that is all data analysis software for research purposes. We follow Harvard, MLA & APA referencing styles along with Endnote according to your requirements. We also check the plagiarism of our work on Turnitin, Grammarly, copy space, language space tool, and write check before submission that we can share with you for the originality of our work. Hopefully, we get this opportunity to work with you as we are sure it will be a good working experience.

Rest assured we will provide you “SUPREME QUALITY WORK” within your “GIVEN DEADLINE” with “PERFECT GRAMMAR” and “ZERO PLAGIARISM”. We have over 22,000 “EXCELLENT REVIEWS” which are a guarantee for our best Quality. Please see our profile and portfolio to assess our quality services. We usually produce over 50 pages of work every day with 100% accuracy.

Open chat and send us a message so we can finalize this deal within your budget.