Please help me answer the question below:

For each of the following schema, write four meaningful queries: one
that uses conjunction (the upward arrow sign), one that uses
disjunction, (the downward arrow sign, one that uses negation, and one
that uses a combination of operators)

1) account = (id*, amount_due, due_date)

a)
b)
c)
d)

2) Sales_item = (id*, description, amount_in_stock, cost, selling_price)

a)
b)
c)
d)

I need this answered by Thursday morning at the latest, and I will run
it by my computer science professor for accuracy.  Also I am willing
to give a very generous tip if the question is answered to my
satisfaction and in a timely manner.

Also as a bonus question (for extra tip) I would just like a bit of
theory answered as it relates to the negation symbol

if I have a question like the following (i am substituting words for
their counterpart symbols):

negation (F Conjuction T ) 

 the answer would be true but the conjunction symbol would stay the
same (it wouldn't change to disjunction. Correct?

negation ( y > z ) 

the answer would change to y < z and the greater than would change to
less than or equal to. Right??    -

The theory question then is, why doesn't the symbol change in the
first problem, but changes in the second problem. (is this order of
operation or what). I know its pretty simple but I'm a computer
programming neophyte and therefore could use a thorough yet simplistic
answer.


                           Regards,

Collin

There are probably 500 different programs in which queries can be
written. Care to let us know which one it is you're studying?

This was just an assignment given by the professor and as such is just
theoretical, meaning that there isn't a real program attached to it,
this question is still open until 6:00 PM EST. And the tip will be
GOOD if someone answers it.

Thanks all,

Collin