This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Suffix Tree – 2”. 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) 2. What is a time complexity for finding … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Suffix Tree”. 1. What is the other name for Suffix Tree? a) Array b) Stack c) Priority Queue d) PAT Tree 2. Which tree allows fast implementation of string operation? a) Rope Tree b) Suffix Tree c) Tango Tree d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Trie”. 1. Trie is also known as _________ a) Digital Tree b) Treap c) Binomial Tree d) 2-3 Tree 2. What traversal over trie gives the lexicographical sorting of the set of the strings? a) postorder b) preorders c) inorder … Read more
