Fall
2003
Due
Date: September 23, 2003
This
Java assignment requires you to input two Boolean functions F1 and F2
and check whether they are equivalent.
Your
program will test the literals up to N = 5. (5 variable input)
If the user wants to check the Boolean function with 2 literals, your program can output:
|
X1 |
X2 |
F1 (X1,
X2) |
F2 (X1,
X2) |
|
0 |
0 |
|
|
|
0 |
1 |
|
|
|
1 |
0 |
|
|
|
1 |
1 |
|
|
For
N = 3, you should have the output:
|
X1 |
X2 |
X3 |
F1 (X1,
X2, X3) |
F2 (X1,
X2, X3) |
|
0 |
0 |
0 |
|
|
|
0 |
0 |
1 |
|
|
|
0 |
1 |
0 |
|
|
|
0 |
1 |
1 |
|
|
|
1 |
0 |
0 |
|
|
|
1 |
0 |
1 |
|
|
|
1 |
1 |
0 |
|
|
|
1 |
1 |
1 |
|
|
You
should try your output with 2,3,4,5 literals.
Here
are some examples of test cases you could try with your program:
Note:
F1 (X1, X2, X3) è X1, X2, X3
are the input variables.
1)
F1 (A, B, C) =
A’B’ + AC + BC’
F2 (A, B, C)
= AB + A’C’ + B’C
2)
F1 (A, B, C, D)
= ACD + A’B + D’
F2 (A, B, C, D) =
D’ + AC + A’B
Submission: A floppy diskette and
hardcopy with executable code and also the test cases. You should include a ‘readme’
file and also documentation in your program.