Q.1
What is a time complexity for x pattern occurrence of length n?
• a) O (log n!)
• b) Ɵ (n!)
• c) O (n2)
• d) Ɵ (n + x)
Q.2
What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings ss2 respectively)?
• a) O (log n!)
• b) Ɵ (n!)
• c) O (n2+ n1)
• d) Ɵ (n1 + n2)
Q.3
What is a time complexity for finding the longest substring that is repeated in a string?
• a) O (log n!)
• b) Ɵ (n!)
• c) O (n2+ n1)
• d) Ɵ (n)
Q.4
What is a time complexity for finding frequently occurring of a substring of minimum length in a string?
• a) Ɵ (n)
• b) Ɵ (n!)
• c) O (n2+ n1)
• d) O (log n!)
Q.5
What is a time complexity for finding the longest prefix that is common between suffix in a string?
• a) Ɵ (n)
• b) Ɵ (n!)
• c) Ɵ (1)
• d) O (log n!)
Q.6
What is a time complexity for finding all the maximal palindrome in a string?
• a) Ɵ (n)
• b) Ɵ (n!)
• c) Ɵ (1)
• d) O (log n!)
Q.7
What is a time complexity for finding all the tandem repeats?
• a) Ɵ (n)
• b) Ɵ (n!)
• c) Ɵ (1)
• d) O (n log n + z)
Q.8
What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?
• a) Linear Time
• b) Exponential Time
• c) Logarithmic Time
• d) Cubic Time
Q.9
Which of the following algorithm of data compression uses a suffix tree?
• a) Weiner’s algorithm
• b) Farach’s algorithm
• c) Lempel – Ziv – Welch’s algorithm
• d) Alexander Morse’s algorithm
Q.10
Which of the following data clustering algorithm uses suffix tree in search engines?
• a) Weiner’s algorithm
• b) Farach’s algorithm
• c) Lempel – Ziv – Welch’s algorithm
• d) Suffix Tree Clustering
Q.11
• a) Ɵ (n)
• b) Ɵ (n!)
• c) Ɵ (1)
• d) O (n2)
Q.12
• a) True
• b) False
Q.13
• a) True
• b) False
Q.14
• a) n Nodes
• b) 2n Nodes
• c) 2n nodes
• d) n! nodes
Q.15
What is a time complexity for inserting an alphabet in the tree using hash maps?
• a) O (log n!)
• b) O (n!)
• c) O (n2)
• d) O (1)