MTH110 Lab 4

MTH110	Lab 4

Readings

The presentations are exercises on material covered in class and in sections 1.4, 1.5 and the bitwise handout.

Presentations

All presentations other than A and G are from the textbook:

Presentation	Exercise(s)	Difficulty Level
A	See below	Medium
B	p. 55 #4, 8, 12.	Easy
C	p. 55 #19. Do not simplify your answer, leave it in Disjunctive Normal Form	Easy
D	p. 56 #25 In this exercise: Construct the IO table with the described behaviour. Construct a Boolean expression having that table as its truth table. Construct a circuit implementing that expression.	Medium
E	p. 56 #29.	Easy
F	p. 73 #6, #12, #18, #40, #43, #46.	Easy
G	Find each of the following, explaining your answer. The bitwise AND of 0x8A with 0xB5. The bitwise XOR of 0xE3 with 0xDF. Find the 1's complement of 0x67.	Easy

Presentation A

Fill in the truth values in the table below for the pseudocode:

if x == 0 and y == 0  then    result is 0
else if y == 0     then    result is x
else if x == 0     then    result is 0
else            result is x

x	y	x == 0	y == 0	x == 0 and y == 0	result
0	0	.	.	.	.
0	not 0	.	.	.	.
not 0	0	.	.	.	.
not 0	not 0	.	.	.	.

Using the table above, simplify the pseudocode in a) as much as you can. Do this as a 2-step process:
1. Use the table to write the condition in disjunctive normal form and;
2. Simplify this expression.

Levels of Difficulty

There are three levels of difficulty: Easy, Medium and Hard.
By the end of the course, each student will have had the opportunity to present at least one exercise at each level.

Maintained by Peter Danziger.
This page is best viewed with Mozilla Firefox.
Last modified Tuesday, 06-Oct-2009 17:01:17 EDT