Question 21 : What is a time complexity for finding frequently occurring of a substring of minimum length in a string?
1. Ɵ (n)
2. Ɵ (n!)
3. O (n²+ n1)
4. O (log n!)
View Answer   Discuss with Members

Question 22 : Which of the following data clustering algorithm uses suffix tree in search engines?
1. Weiner's algorithm
2. Farach's algorithm
3. Lempel - Ziv - Welch's algorithm
4. Suffix Tree Clustering
View Answer   Discuss with Members

Question 23 : What is a time complexity for x pattern occurrence of length n?
1. O (log n!)
2. Ɵ (n!)
3. O (n²)
4. Ɵ (n + x)
View Answer   Discuss with Members

Question 24 : What is a time complexity for finding all the maximal palindrome in a string?
1. Ɵ (n)
2. Ɵ (n!)
3. Ɵ (1)
4. O (log n!)
View Answer   Discuss with Members

Question 25 : Can the two edges that are coming out of a node have labels of string beginning with the same character?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 26 : For what size of nodes, the worst case of usage of space in suffix tree seen?
1. n Nodes
2. 2ⁿ Nodes
3. 2n nodes
4. n! nodes
View Answer   Discuss with Members

Question 27 : What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?
1. Linear Time
2. Exponential Time
3. Logarithmic Time
4. Cubic Time
View Answer   Discuss with Members

Question 28 : What is a time complexity for finding all the tandem repeats?
1. Ɵ (n)
2. Ɵ (n!)
3. Ɵ (1)
4. O (n log n + z)
View Answer   Discuss with Members

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

Question 30 : Who among the following algorithm is used in external memory and compression of the suffix tree?
1. Weiner's algorithm
2. Farach's algorithm
3. Ukkonen's algorithm
4. Alexander Morse
View Answer   Discuss with Members