Exercises marked with (*) require further reading/search beyond the suggested texts.
5. Find a situation in the improved placement algorithm in which processing a new set in DFS destroys the C1P by having a new class but not a full extremity in the path to place it.
Answer:
Consider the following sets:
S1 = { 3, 2 }
S2 = { 2, 5, 7 }
S3 = { 2, 7, 6 }
The data structure after inserting S1 and S2 will be:
When we apply S3, the C1P will be destroyed by having a new class, {6}, and also not a full extremity in the path to place it.
© 2015 Joao Meidanis