Assessment item 2
Assignment 1
Value: 15%
Due date: 19-Dec-2014
Return date: 09-Jan-2015
Submission method options
Alternative submission method
Task
Total marks: 30
Answer the following questions:
1. Under the von Neumann architecture, a program and its data are both stored in memory. It is therefore possible for a program, thinking a memory location holds a piece of data when it actually holds a program instruction, to accidentally (or on purpose) modify itself. What implications do this present to you as a programmer? [4 marks]

2. A Computer uses IEEE-754 format to represent floating points. What value (in decimal) the computer represents if the floating point is represented using the following binary digits: [6 marks]

11000001010100000000000000000000

3. Convert the followings: [4 marks]

a. 0xAC12 to binary
b. -10710 to 8-bit 2’s Complement
c. 10011110 (8-bit 2’s complement representation) to decimal
d. 11001101012 to Hexadecimal

4. Construct the XOR operator using only AND, OR and NOT gates. [4 marks]

5. Charles Sturt University (CSU) academic director want to hire a lecture in Sydney Study Center. The applicant has worked in three universities before; University of New South Wales (UNSW), Macquarie University, and Sydney University. Before he will hire him, he must get input from these three universities. After few weeks of receiving feedback from all three, he has come to the following conclusions:
Hire if two of them say yes and one says no.
Hire if all of them say yes.
Don't hire otherwise.

Construct a truth table and find the minimized Boolean function to implement the logic telling the director when to hire. Draw a circuit diagram for the Boolean function. [6 marks]

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

Online submission via Turnitin is required for this assignment.

Rationale
This assessment task covers topic 1 to 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 define and appropriately use computer systems terminologies;
• be able to describe the concepts of data representations and use appropriate methods of implementation;
• be able to apply Boolean algebra and digital logic to design and interpret digital circuits.
Marking criteria
Assignment 1 will be marked according to the following marking criteria:
Question
HD (85%-100%)
DI (75% - 84%)
CR (65% - 74%)
PS (50% - 64%)
FL (0%-49%)
Q 1
Answer is correct, and complete. Comprehensive explanation is provided with appropriate example. Appropriate reference style is used. No grammatical or spelling mistake.
Answer is correct and a detailed explanation is provided. References are used. No/only a few grammatical or spelling mistakes.
The answer is correct, but the explanation is not complete. Very few references are used and not formatted appropriately.
The answer is correct but not complete and only adequate explanation is provided. No references are used. There are grammatical errors and spelling mistakes.
The answer is completely not correct.
Q 2
Answer is correct, and complete. Comprehensive explanation is provided with appropriate example. Appropriate reference style is used. No grammatical or spelling mistake.
Answer is correct and a detailed explanation is provided. References are used. No/only a few grammatical or spelling mistakes.
The answer is correct, but the explanation is not complete. Very few references are used and not formatted appropriately.
The answer is correct but not complete and only adequate explanation is provided. No references are used. There are grammatical errors and spelling mistakes.
The answer is completely not correct.
Q 3

All three answers are correct
At least two answers are correct
At least one answer is correct
No answer is correct.
Q 4
Answers are all correct
All steps were shown
The answer is correct or there were only a few slip of pens, or a step or two were missing.
The answer is not correct, but the steps are correct.
Answer and steps are not correct.
Q 5
The circuit design is correct. The Boolean expression is minimized. All steps are explained. The circuit diagram is correct and neat.
The circuit design and the Boolean expression are correct but not minimized.
Steps are correct. Minor mistakes in the Boolean algebra.
Boolean expression is not correct, however the steps are correct. No or wrong circuit diagram.
Boolean expression and steps are not correct.
Q 6
Find the correct values for both J-K and D Flip Flops. Find the correct values for all A and B
Find the correct values for both J-K and D Flip Flops. Find the correct values for most A and B
Find the correct values for both J-K and D Flip Flops. Find the correct values for some A and B
No values are correct.