100+ Trie (Data Structure) MCQs with FREE PDF

We have the best collection of Trie (Data Structure) MCQs and answer with FREE PDF. These Trie (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Trie (Data Structure) MCQs

1. Which of the following is not true?

a) Trie requires less storage space than hashing

b) Trie allows listing of all the words with same prefix

c) Tries are collision free

d) Trie is also known as prefix tree

Answer: Trie requires less storage space than hashing

2. A program to search a contact from phone directory can be implemented efficiently using ______

a) a BST

b) a trie

c) a balanced BST

d) a binary tree

Answer: a trie

3. What can be the maximum depth of the trie with n strings and m as the maximum sting the length?

a) log2n

b) log2m

c) n

d) m

Answer: m

4. Which of the following is true about the trie?

a) root is letter a

b) path from root to the leat yields the string

c) children of nodes are randomly ordered

d) each node stores the associated keys

Answer: path from root to the leat yields the string

5. Trie is also known as _________

a) Digital Tree

b) Treap

c) Binomial Tree

d) 2-3 Tree

Answer: Digital Tree

6. What traversal over trie gives the lexicographical sorting of the set of the strings?

a) postorder

b) preorders

c) inorder

d) level order

Answer: inorder

7. Which of the following is the efficient data structure for searching words in dictionaries?

a) BST

b) Linked List

c) Balancded BST

d) Trie

Answer: Trie

8. Which of the following special type of trie is used for fast searching of the full texts?

a) Ctrie

b) Hash tree

c) Suffix tree

d) T tree

Answer: Suffix tree

9. Which statement is correct of suffix tree with a string of length n?

a) The tree has n leaves

b) The tree has n roots

c) Height of Tree is n

d) Depth of tree is n

Answer: The tree has n leaves

10. Which tree allows fast implementation of a set of string operation?

a) Rope Tree

b) Tango Tree

c) Generalized Suffix Tree

d) Top Tree

Answer: Generalized Suffix Tree

11. What is a time complexity for checking a string of length n is substring or not?

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n)

Answer: O (n)

12. What is the other name for Suffix Tree?

a) Array

b) Stack

c) Priority Queue

d) PAT Tree

Answer: PAT Tree

13. Which tree allows fast implementation of string operation?

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

Answer: Suffix Tree

14. How much time does construction of suffix tree take?

a) O (log M)

b) O (M!)

c) Exponential to Length of Tree

d) Linear to Length of Tree

Answer: Linear to Length of Tree

15. How much space does construction of suffix tree takes?

a) O (log M)

b) Exponential to Length of Tree

c) O (M!)

d) Linear to Length of Tree

Answer: Linear to Length of Tree

16. Which tree provides a linear time solution for substring operation?

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

Answer: Suffix Tree

17. Who among the following provided the first online contribution of Suffix Tree?

a) Weiner

b) Samuel F. B. Morse

c) Ukkonen

d) Alexander Morse

Answer: Ukkonen

18. What is the time complexity of Uttkonen’s algorithm?

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n log n)

Answer: O (n log n)

19. Who among the following provided the first suffix tree contribution for all alphabet?

a) Weiner

b) Farach

c) Ukkonen

d) Alexander Morse

Answer: Farach

50+ Suffix Tree (Data Structure) MCQs with FREE PDF

Trie (Data Structure) MCQs PDF Download

1000+ Data Structure MCQs

Abstract Data Types
Application of Stacks
Arrays Types
Types of Lists
Binary Trees
B Trees
Trees
Heap
Trie
Hash Tables
Graph