# Exam Tomorrow!

#### mikewilliams

Joined Nov 4, 2008
10
Hi all I am studying for my exam, and I am looking at different problems, that will be of similarity to the questions tomorrow. I am stuck on how to approach these two however. If you could help me out quickly that would be great as my exam is tomorrow!

Thanks

Last edited:

#### beenthere

Joined Apr 20, 2004
15,808
Both are way too small to read.

#### mikewilliams

Joined Nov 4, 2008
10
beenthere, I think when you open them you can click on it with the magnifying glass and then they are full size. If that doesn't work for you I will try to repost.

Thanks

#### veritas

Joined Feb 7, 2008
167
I am unable to read the first image.

For the second problem, you can think of part (a) as being two different independent steps:
1) Find f1(a, b) such that f1 = 1 if a < b
2) Find f2(a, b) such that f2 = 1 if a = b

What questions do you have about these two steps?

#### veritas

Joined Feb 7, 2008
167
You can define the function by the truth-table

#### mikewilliams

Joined Nov 4, 2008
10
hi veritas,
I have figured out that F1 = A'B and F2 = A'B' + AB and I have drawn that implementation. i think what i am having trouble with is part b and c. Do G1 and G2 just follow F1 and F2? I dont believe so but I am not seeing how to solve these.

Also I will work on reposting problem #1

#### mikewilliams

Joined Nov 4, 2008
10
ok i have made them word attachments, you should be able to read both now.

Thanks

#### veritas

Joined Feb 7, 2008
167
G1 will have 4 inputs: f1_0, f2_0, f1_1, and f2_1, where '_n' is subscript bit.

One or more of those inputs may simplify away, but start by using all of them.

The same is true for G2