Question 31 : Can suffix tree be used in string problems occurring in a text editor.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 32 : What is a time complexity for finding the longest substring that is common in string S1 and S2?
1. O (log n!)
2. Ɵ (n!)
3. O (n²+ n1)
4. Ɵ (n1 + n2)
View Answer   Discuss with Members

Question 33 : What is the time complexity of Uttkonen's algorithm?
1. O (log n!)
2. O (n!)
3. O (n²)
4. O (n log n)
View Answer   Discuss with Members

Question 34 : Which tree provides a linear time solution for substring operation?
1. Rope Tree
2. Suffix Tree
3. Tango Tree
4. Top Tree
View Answer   Discuss with Members

Question 35 : What is a time complexity for finding the total length of all string on all edges of a tree?
1. Ɵ (n)
2. Ɵ (n!)
3. Ɵ (1)
4. O (n²)
View Answer   Discuss with Members

Question 36 : Which of the following algorithm of data compression uses a suffix tree?
1. Weiner's algorithm
2. Farach's algorithm
3. Lempel - Ziv - Welch's algorithm
4. Alexander Morse's algorithm
View Answer   Discuss with Members

Question 37 : Who among the following provided the first suffix tree contribution for all alphabet?
1. Weiner
2. Farach
3. Ukkonen
4. Alexander Morse
View Answer   Discuss with Members

Question 38 : Which statement is correct of suffix tree with a string of length n?
1. The tree has n leaves.
2. The tree has n roots
3. Height of Tree is n
4. Depth of tree is n
View Answer   Discuss with Members

Question 39 : Which tree allows fast implementation of a set of string operation?
1. Rope Tree
2. Tango Tree
3. Generalized Suffix Tree
4. Top Tree
View Answer   Discuss with Members