Question 11 : Can suffix tree be used in bioinformatics problems and solutions.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 12 : Which of the following is true about the trie?
1. root is letter a
2. path from root to the leat yields the string
3. children of nodes are randomly ordered
4. each node stores the associated keys
View Answer   Discuss with Members

Question 13 : Do all the nodes have at least two children in suffix tree.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 14 : How much time does construction of suffix tree take?
1. O (log M)
2. O (M!)
3. Exponential to Length of Tree
4. Linear to Length of Tree
View Answer   Discuss with Members

Question 15 : What is the other name for Suffix Tree?
1. Array
2. Stack
3. Priority Queue
4. PAT Tree
View Answer   Discuss with Members

Question 16 : Trie is also known as _________
1. Digital Tree
2. Treap
3. Binomial Tree
4. 2-3 Tree
View Answer   Discuss with Members

Question 17 : What is a time complexity for inserting an alphabet in the tree using hash maps?
1. O (log n!)
2. O (n!)
3. O (n²)
4. O (1)
View Answer   Discuss with Members

Question 18 : What is a time complexity for checking a string of length n is substring or not?
1. O (log n!)
2. O (n!)
3. O (n²)
4. O (n)
View Answer   Discuss with Members

Question 19 : Which of the following is not true?
1. Trie requires less storage space than hashing
2. Trie allows listing of all the words with same prefix
3. Tries are collision free
4. Trie is also known as prefix tree
View Answer   Discuss with Members

Question 20 : How much space does construction of suffix tree takes?
1. O (log M)
2. Exponential to Length of Tree
3. O (M!)
4. Linear to Length of Tree
View Answer   Discuss with Members