The answer you're looking for might be "backwards-compatible".
Let me re-write the proposition:
p↔q⊕(¬p↔¬r)∧¬q.
Generally, the number of rows in a truth table depends on the number of Variables. Here we have 3 Variables: p,q and r. Each of them can have either the value of 1 or 0, which gives us 2*2*2 possibilities, or 2³, that is 8 possibilities and 8 rows:
p=0, q=0, r=0
p=0, q=0, r=1
p=0, q=1, r=0
p=0, q=1, r=1
p=1, q=0, r=0
p=1, q=0, r=1
p=1, q=1, r=0
p=1, q=1, r=1
JAVA programming was employed...
What we have so far:
* Two 2x3 (2 rows and 3 columns) arrays. x1[i][j] (first 2x3 array) and x2[i][j] (second 2x3 array) .
* Let i = row and j = coulumn.
* A boolean vaiable, x1rules
Solution:
for(int i=0; i<2; i++)
{
for(int j=0; j<3; j++)
{
x1[i][j] = num.nextInt();
}
}// End of Array 1, x1.
for(int i=0; i<2; i++)
{
for(int j=0; j<3; j++)
{
x2[i][j] = num.nextInt();
}
}//End of Array 2, x2
This should check if all the elements in x1 is greater than x2:
x1rules = false;
if(x1[0][0]>x2[0][0] && x1[0][1]>x2[0][1] && x1[0][2]>x2[0][2] && x1[1][0]>x2[1][0] && x1[1][1]>x2[1][1] && x1[1][2]>x2[1][2])
{
x1rules = true;
system.out.print(x1rules);
}
else
{
system.out.print(x1rules);
}//Conditional Statement
Diong reasearch to know what your dion
Answer:
I believe you want a subclass so here it is!
public class ReadWrite extends ReadOnly {
public ReadWrite(int initialValue){
super(initialValue);
}
private boolean modified = false;
public void setVal(int x) {
val = x;
modified = true;
}
public boolean isDirty() {
return modified;
}
}
Explanation:
I might be wrong, just check through it in case
Hope this helped
:)
