CSE2306/1308 Digital Logic

Assignment 1
Due date: Monday, 27th March
A/Prof. Andrew P. Paplinski (Clayton 75-190)
Robert Prain (Clayton 75-188)

Write your answers in the space provided in the assignment sheets.

Attach additional page if there is not enough space.
Plagiarised assignments will be given a zero mark.

Question 1: Add

(21201)3 + (1221)3 =

Show your working here:

[4 marks]

Question 2: Convert using the division by the target radix method:

1. (347)10 to radix 3
2. (753)10 to radix 4
3. and radix 2

Show your working here:

Digital Logic, Assignment 1 March 21, 2006

[2+2+2 marks]
Question 3: Convert using the multiplication by the source radix method:
1. (221121)3 to radix 10
2. (1753)10 to radix 2
3. and radix 4
Show your working here:

[2+2+2 marks]

A.P. Papliński 2
Digital Logic, Assignment 1 March 21, 2006

Question 4: Consider the following CMOS implementation of a logic gate:

1. Create the truth table y(a, b) for the gate

2. What is the name of the gate?

[2+1 marks]

Question 5: Complete the following time waveforms:

What is the frequency of signals a and b ?

[2+2+1 marks]

A.P. Papliński 3
Digital Logic, Assignment 1 March 21, 2006

Question 6: Complete the following table in the format indicated

[8 marks]

Question 7: Complete the body or heading of each truth table column.

[6 marks]

A.P. Papliński 4
Digital Logic, Assignment 1 March 21, 2006

Question 8: Give the formula for the maximum number of different logic functions (truth tables)
that can be constructed using exactly n binary variables

[2 marks]

Question 9: The partly completed equations below refer to either a minterm or a Maxterm. Com-
plete each equation to show the equivalence between the longhand and the shorthand forms.

[8 marks]

Question 10: Logic functions P, Q, R, S, T and U have these truth tables:

Complete each expression below to become a standard canonical form of the logic function.
Use either the index list, or the shorthand format, as indicated by the partly complete answer:

A.P. Papliński 5
Digital Logic, Assignment 1 March 21, 2006

[6 marks]

Question 11:

1. Give a Boolean expression that corresponds to this logic circuit:

2. Develop a truth table for the circuit, showing columns for at least the output of each 2-
input gate. You should invent new variable names for these intermediate outputs.

[2+8 marks]

A.P. Papliński 6
Digital Logic, Assignment 1 March 21, 2006

Question 12: Using logic variables A, B, C give these Boolean algebra laws:

Use suitable Boolean algebra law to:

[2+2+2+3+3 marks]

A.P. Papliński 7
Digital Logic, Assignment 1 March 21, 2006

Question 13: Consider the following four-variable function

X
y(x3 , x2 , x1 , x0 ) = (0, 2, 3, 6, 7, 9, 11, 15)

Use the Karnaugh map to derive the following minimal forms of the function y:

1. SoP
2. PoS
3. Inverted SoP
4. Inverted PoS
5. NAND form
6. NOR form

[12 marks]

A.P. Papliński 8
Digital Logic, Assignment 1 March 21, 2006

Question 14: Consider the following four-variable function

X
y(x3 , x2 , x1 , x0 ) = (0, 1, 4, 5, 6, 8, 9, 11, 15)

1. Implement the above function using a decoder generating Maxterms. Draw a suitable
diagram

2. Implement the above function using the 8-to-1 multiplexer. Give the modified truth table
and the relevant diagram.

[4+4 marks]

A.P. Papliński 9
Digital Logic, Assignment 1 March 21, 2006

[Total marks: 100]

A.P. Papliński 10