Choose the WRONG alternative regarding PQ-Tree and PQR-Tree:
a) Every PQ-Tree is an PQR-Tree, but the reverse isn't valid.
b) The children of an R node can permute without any rule between them and the same occurs in the Q node.
c) Intersection, disjoint union and complement not contained are operations that can be used to calculate the completion of set.
d) There always is a PQR-Tree that represents an set of restrictions, independent of this set.
e) None of Above.
Original idea by: Celmar Guimarães da Silva
Translation help by: Andrey Victor Justo
Nenhum comentário:
Postar um comentário