Let `oplus` denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary
constants. Consider the following Boolean expression for F over two variables P and Q.
F (P, Q) = ((1 `oplus` P) `oplus` (P `oplus` Q)) `oplus` ((P `oplus` Q) `oplus` (Q `oplus` O))
The equivalent expression for F is
Consider the following relational schema:
Employee (`underline(empId)`, empName, empDept)
Customer (`underline(custId)`,custName, salesRepId, rating)
SalesRepId is a foreign key referring to empId of the employee relation. Assume that each employee
makes a sale to at least one customer. What does the following query return?
SELECT empName
FROM employee E
WHERE NOT EXISTS (SELECT custId
FROM customer C
WHERE C. salesRepId = E. empId
AND C. rating < > 'GOOD')
The CORECT formula for the sentence, "not all rainy days are cold" is
Let `delta` denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices
with `delta` `ge` 3, which one of the following is TRUE?
If G is a forest with n vertices and k connected components, how many edges does G have?