Reference no: EM13935018

1. Convert the followings:

a. 0xAC12 to binary
b. -10710 to 8-bit 2's Complement
c. 10011110 (8-bit 2's complement representation) to decimal
d. 11010110102 into hexadecimal
e. 1108 into hexadecimal

2. The following binary number is stored using the floating point representation of IEEE-754 single precision format. Find out the value in decimal.
11101000011010000000000000000000

Rationale

This assessment task covers topic 2, and has been designed to ensure that you are engaging with the subject content on a regular basis. More specifically it seeks to assess your ability to:
• be able to describe the concepts of data representations and use appropriate methods of implementation;
• be able to calculate different number systems.

Marking criteria

The following marking criteria will be used to mark the assignment:

Questions Fail (<50%) Pass (50% - 64%) Credit (65% - 74%) Distinction (75% - 84%) High Distinction (>84%)
Question 1 & 2

Neither the answers are correct nor the steps.
The answer is not correct, but the steps are correct. The answer is correct or there were only a few slip of pen, or a step or two were missing. Answer is correct

Answer the following questions:
1. Design a digital combinational circuit which compares two 2-bit binary numbers and produces results using a 2-bit binary number (please see the block diagram below). The output Z1Z0 depends on the inputs A1A0 and B1B0 according to the following criteria:
• If (A1A0 > B1B0) the output Z1Z0 = 10
• If (A1A0 < B1B0) the output Z1Z0 = 01
• If (A1A0 = B1B0) the output Z1Z0 = 11

You should use minimum number of logic gates.

2. Using basic Boolean algebra identities, prove that ABC+ABC'+AB'C+A'BC = AB + AC + BC. Please show all steps and mention the identities used.

Rationale
This assessment task covers topic 3, and has been designed to ensure that you are engaging with the subject content on a regular basis. More specifically it seeks to assess your ability to:
• be able to apply Boolean algebra and digital logic to design and interpret digital circuits.
• be able to use different identities of the Boolean algebra

Marking criteria

Questions Fail (<50%) Pass (50% - 64%) Credit (65% - 74%) Distinction (75% - 84%) High Distinction (>84%)

Question 1
The circuit design is incorrect and does not conform to the question. Boolean expression is not correct, however the steps are correct. No or wrong circuit diagram. The circuit design and the Boolean expression are correct but not minimised. Steps are correct. Minor mistakes in the Boolean algebra. The circuit design is correct. The Boolean expression is minimised. All steps are explained. The circuit diagram is correct and neat.

Question 2 Neither the answers nor the steps are correct Answer is not correct, but the steps are correct. Answers are all correct but there are only few mistakes in the steps. Answer s are all correct and complete. All steps are shown and identities are listed

Assessment item 4

Answer the following questions:
[This task requires you to use the MARIE simulator for Questions 1 and 2. Prior to starting this task, you must ensure that the simulator is running correctly by completing the tutorial provided with the simulator, located under Resources within the Interact site.]

1. Assemble the MARIE program below.
Hex Address Label Instruction
100 Start LOAD A
101 ADD B
102 STORE D
103 CLEAR
104 OUTPUT
105 ADDI D
106 STORE B
107 HALT
108 A, HEX 00FC
109 B, DEC 14
10A C, HEX 0108
10B D, HEX 0000
a) List the hexadecimal code for each instruction
b) Draw the symbol table ]
c) What is the value stored in the AC when the program terminates.

2. Write a MARIE program using a loop that multiplies two numbers by using repeated addition. For example, to multiply 3 x 6, the program would add 3 six times e.g. 3 + 3 + 3 + 3 + 3 + 3. You should write and run the program using MARIE simulator. Also write the code with Address, Instruction, and Comments .

3. The memory unit of a computer has 256K words of 32 bits each. The computer has an instruction format with 4 fields: an opcode field; a mode field to specify 1 of 7 addressing modes; a register address field to specify 1 of 60 registers; and a memory
address field. Assume an instruction is 32 bits long. Answer the following:
a) How large must the mode field be?
b) How large must the register field be?
c) How large must the address field be?
d) How large is the opcode field?

4. Choose one area of rapid technological change in IT or Computer Science and research and report on recent developments and the outlook for the future in the area that you have chosen. You will need to provide both in text citations and bibliography entries according to Faculty of Business policy (APA format). Your report should be around 500 words.

Rationale
This assessment task covers topics on CPU operation and Instruction Set Architecture, and has been designed to ensure that you are engaging with the subject content on a regular basis. More specifically it seeks to assess your ability to:
• be able to define and appropriately use computer systems terminologies;
• be able to describe the essential elements of computer organisation and discuss how the elements function;
• be able to describe the basic instruction set architecture of a simple computer;
• be able to discuss the general trends in computing technologies including examples of leading edge developments.