Task Total marks: 30
Answer the following Questions Question 1
(a) Given a tiny computer that has a word size of 8 bits, what are the smallest negative numbers and the largest positive numbers that this computer can represent in each of the following representations? (2+2+2+2=8 marks)
I. One’s complement
II. Two’s complement
III. Signed magnitude
IV. Unsigned magnitude
(b) Convert the followings: (7 marks)
I. 0x5AB into Octal
II. 101101.1012 into Decimal
III. 12348 into Binary
IV. 679810 into Base 5 number
V. 976.6310 into Binary
VI. 1001001011 into Hexadecimal
VII. 10011110 (8-bit 2’s complement representation) to Decimal
(a) Using basic Boolean algebra identities for Boolean variables X and Y, prove that X’(X+Y)+(XX+Y)(Y’+X)=Y+X. Please show all steps and mention the identities used. (6 marks)
(b) A subject has 4 assessments, such as Assignment, Blog, Discussion Forum and Quiz. In order to pass in the subject, a student must get as below:
- Assignment component must pass (50 or above)
• Any 2 more assessments must pass
• Fail otherwise
Construct a truth table and find the minimized Boolean function. Draw a circuit diagram for the Boolean function. (9 marks)
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 an understanding of data representations and calculations to practical situations;
- be able to apply Boolean algebra and digital logic to design and interpret complex digital circuits;
|Criteria||HD (85%-100%)||DI (75%-84%)||CR (65%-74%)||PS (50%-64%)||FL (0%-49%)|
|Comprehension of data representation and application of computer math calculations
|All calculations were correct. Appropriate mathematical symbols were used, and all steps/workings were shown.||Almost all Calculations were correct except a minor error.||Most of the calculations are correct. However, few steps were omitted. The method used to solved the problem were correct, but there were one or two miscalculations.||At least half of the calculations were correct. Some incorrect answers were the result of errors at some stage of the calculation, which propagated with the next steps. Some of the steps showed the basic understanding the numbering system.||No attempt or most of the calculations were incorrect. Failed to show the steps of calculation. Either the answers were incorrect or the steps were wrong..
|Application of Boolean algebra and digital logic and interpretation of complex circuits||The Boolean expressions are correct and minimised. All steps are explained. Correctly mentioned the Boolean identities.
All identities were mentioned accurately.
|Boolean expressions and algebraic calculations were correct, however few steps were not shown or only minor error.||Few minor error in applying the Boolean identities. Could reduce the number of logic gates, but not as much required by the question.||More than half of the Boolean expressions were correct. Applied Boolean identities but could not reach to the final step.||The Boolean equation, logic diagram and the truth tables were incorrect and they do not conform to the question.|
- Please compose the answers in a document file (doc or docx format). Please do not submit in pdf formats. Please upload the document in the Turnitinwithin deadline.
- The first page (cover page) of the document file should have the following information clearly mentioned:
- Your full name
b. Your Student ID
c. Subject Code (ITC544)
d. Assessment item number and name (Assignment 1: Data Representation and Digital Logic)
- Each page should have page numbers in “page x of y” format (including the cover page).
- You DO NOT need to provide any references for any of the questions.
CLICK HERE TO ORDER 100% PLAGIARISM FREE HIGH-QUALITY PAPERS FROM ASSIGNMENTHELP4ME.COM