Multiple Choice Question - 12/Jun/2015

Regarding the paper "On the consecutive ones property" by Meidanis et al. (1998), and the algorithm that leads to the construction of PQR trees:

I - The algorithm is ONLINE
II - The overall running time of the algorithm is quadratic
III - The algorithm always constructs a PQR tree given a set and a collection (set of sets)

Which of the statements are correct?

a) Only I
b) Only II
c) Only III
d) Only II and III
e) None of the above

Original idea by: Gustavo Waku
Translation help by: Leandro Tacioli

Multiple Choice Question - 05/Jun/2015

According to the concept of equivalence transformations by Booth and Lueker (1976), which alternative DOES NOT represent a PQ-tree equivalent to the following tree?

a) 

b)

c)

d)

e) None of the above

Original idea by: Leandro Tacioli