Let C = { abcd, bcdef, afghijk, bcdgh, ghijk }. Choose the alternative that contains all the sets of twins from C:
1) abc, gh, ijk
2) bcd, ef, hij
3) bcd, gh, ghi
4) bcd, gh, ijk
5) None of the above
Author: Victor de Abreu Iizuka
Translated by: Rafael S. Padilha
terça-feira, 9 de junho de 2015
terça-feira, 2 de junho de 2015
PQ-Tree
Which of the affirmatives bellow are true about the Booth and Lueker's algorithm to build a PQ-tree:
I - The algorithm has two steps, one to identify the nodes that must be processed and another to apply the reductions.
II - Every son of a Q node has pointers to his fathers
III - The linear complexity is confirmed by doing an amortized analysis
A. I and II
B. I and III
C. II
D. III
E. None of the above
Author: Maria Angélica Lopes de Souza
Translated by: Rafael Soares Padilha
Assinar:
Postagens (Atom)