**Assignment 1: Data Representation & Digital Logic**

**Value: **15%

**Due date: **09-Apr-2017

**Return date: **04-May-2017

**Submission method options**

Alternative submission method

**Task**

**Total marks: 30**

Answer the following Questions

**Question 1**

- a) Determine the value of base
*x*if (211)= (6A)_{x}_{16}[5 marks] - b) Convert the followings: [3+3=6 marks]
- i) 0xBAD into a decimal number
- ii) 588
_{10}into a 3-base number - c) Given a (very) tiny computer that has a word size of 6 bits, what are the smallest negative numbers and the largest positive numbers that this computer can represent in each of the following representations? [3 +3 = 6 marks]
- i) One’s complement
- ii) Two’s complement

**Question 2.**

- a) Consider the following logic diagram of a combinational circuit where A, B, and C are inputs and Q is the output. Three 2-input AND gates and two 2-input OR gates are used in the circuit. It is possible to reduce some of the logic gates without changing the functionality of the circuit. Such component reduction results in higher operating speed (less delay time from input signal transition to output signal transition), less power consumption, less cost, and greater reliability. Construct a logic diagram of a circuit which does have the same function output with only two logic gates (instead of five). Please show the steps. [8 marks]

- b) Using basic Boolean algebra identities for Boolean variables
*A*,*B*and*C*, prove that*ABC*+*ABC’*+*AB’C*+*A’BC*=*AB*+*AC*+*BC*. Please show all steps and mention the identities used. [5 marks]

**Rationale**

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;