Week 15 (PQR-Tree)

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

Week 14 (PQ-Tree)

Given the alternatives below, choose the INCORRECT statement:

a ) To get the FRONTIER(T) of a tree, you just read all the leaves from left to right.
b ) The null tree isn't an PQ-Tree
c ) Reverse a P-node is a equivalent transformation.
d ) Reverse a Q-node is a equivalent transformation.
e) None of above.

Original idea by: Moacy Barros Correia da Silva
Translation help by: Andrey Victor Justo