Recent Question/Assignment

Assessment item 2
Assignment 1
Value: 10%
Due date: 20-Aug-2015
Return date: 11-Sep-2015
Submission method options
Alternative submission method
Task
Answer the following questions:

1. On the von Neumann, describe the process that the CPU must undertake to read a value from memory and to write a value from memory and to write a value to memory in terms of what is put into the MAR, MBR, address bus, data bus, and control bus ? [5 marks]

2. Suppose that the following instructions are found at the given location in memory:

0040H LOAD 0060H
0041H MULT 0061H
0042H STORE 0061H
0043H LOAD 0062H
0044H ADD 0060H
0045H STORE 0062H
0060H 20
0061H 12
0062H 24
Show the contents of all CPU Registers; IR, PC, MAR, MDR, and AC. You need to provide all steps that reach you the final values. [5 marks]

3.Represent the following two’s complement values in decimal: [5 marks]

1101011
0101101

4. Show how the floating point value (1/16) would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand fields) [5 marks]

5. Charles Sturt University (CSU) has opened an IT Doctorate study in Sydney Study Centre. The applicant should have a master degree in IT or a master degree in electrical engineering. The applicant should also has completed project subject (e.g. ITC570, ITC571, …) in his master degree. Before CSU management staff approve student’s application, they have to check the entry requirement for the master degree and also check whether if the student has completed project subject in his master degree. After checking applicant documents, CSU staff has come to the following conclusions:
? Approve if applicant has one of the required master degrees and has completed project subject.
? Approve if applicant has two of the required master degrees and has completed project subject.
? Don't approve otherwise.

Construct a truth table and find the minimized Boolean function to implement the logic telling the CSU staff when to approve. Draw a circuit diagram for the Boolean function. [5 marks]

6. Complete the truth table for the following sequential circuit: [5 marks]

Online submission via Turnitin is required for this assignment.

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 & 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
All steps were shown.
Question 3 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 4 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

Looking for answers ?