Question 1 : Who among the following provided the first online contribution of Suffix Tree?
1. Weiner
2. Samuel F. B. Morse
3. Ukkonen
4. Alexander Morse
View Answer   Discuss with Members

Question 2 : What can be the maximum depth of the trie with n strings and m as the maximum sting the length?
1. log2n
2. log2m
3. n
4. m
View Answer   Discuss with Members

Question 3 : Which of the following special type of trie is used for fast searching of the full texts?
1. Ctrie
2. Hash tree
3. Suffix tree
4. T tree
View Answer   Discuss with Members

Question 4 : Auto complete and spell checkers can be implemented efficiently using the trie.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 5 : A program to search a contact from phone directory can be implemented efficiently using ______
1. a BST
2. a trie
3. a balanced BST
4. a binary tree
View Answer   Discuss with Members

Question 6 : Which of the following is the efficient data structure for searching words in dictionaries?
1. BST
2. Linked List
3. Balancded BST
4. Trie
View Answer   Discuss with Members

Question 7 : What traversal over trie gives the lexicographical sorting of the set of the strings?
1. postorder
2. preorders
3. inorder
4. level order
View Answer   Discuss with Members

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

Question 9 : Who proposed the concept of Suffix Tree?
1. Weiner
2. Samuel F. B. Morse
3. Friedrich Clemens Gerke
4. Alexander Morse
View Answer   Discuss with Members

Question 10 : What is a time complexity for finding the longest prefix that is common between suffix in a string?
1. Ɵ (n)
2. Ɵ (n!)
3. Ɵ (1)
4. O (log n!)
View Answer   Discuss with Members