Week 15 - Consecutive ones property

Consider the sets being processed by the improved placement algorithm (DFS corresponds to the order they are given):

S1 = {1,4}
S2 = {1,3,5}
S3 = {3,2,5}
S4 = {1,3,2}

Now mark the CORRECT option that describes what happens when set S4 is added.

a) The C1P is destroyed because there is no empty neighbor to place the element {5} that was split from its class.
b) The C1P is destroyed because there is no empty neighbor to place the element {2} that was split from its class.
c) The C1P is destroyed because there is no empty neighbor to place the element {3} that was split from its class.
d) The C1P is destroyed because not all full classes are consecutive.
e) None of the above.

Original idea by: Raphael Cristofaro 

Week 14 - PQ-trees

Which of the bellow statements is INCORRECT?

a) Reading the leaves of a tree T from left to right yields its frontier, denoted by
FRONTIER(T).
b) A null tree (which has no nodes) is NOT considered as a PQ-tree.
c) A reversal of a P node is a equivalence transformation.
d) A reversal of a Q node is a equivalence transformation.
e) None of the above.

Translated by: Raphael Cristofaro
Original idea by: Moacy Barros Correia da Silva
(question number 071)