Please write into “Report Style”
- Using a “word” of 5 bits, list all of the possible signed binary numbers and their decimal equivalents that are representable in: [5 marks]
b. One’s complement
c. Two’s complement
- Express the (-6) number in IEEE 32-bit floating-point format. [5 marks]
Charles Sturt University (CSU) is conducting three sessions every year. The BEGIN month for Session 1 is March, and it end is Jun. SESSION 2 BEGINS in July, and it end is October. SESSION 3 BEGINS in November, and it end is February.
Write a Boolean function and design a logic circuit, use of basic logic gates to activate these three sessions for CSU. Design a circuit with four inputs (A, B, C, and D) representing the bits in a binary number, and three outputs (S1_Active, S2_Active, and S3_Active). [7 marks]
When the input is session 1, the output S1_Active should be one and all other outputs should be zero
- Prove using Boolean algebra that: [3 marks]
(BC’ + A’D) (AB’ + CD’) = 0
Online submission via Turnitin is required for this assignment.
This assessment task covers topic 2 and 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 understand computer operation;
be able to describe the concepts of data representations and use appropriate methods of implementation;
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.
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.
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