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

We have the best collection of Suffix Tree (Data Structure) MCQs and answer with FREE PDF. These Suffix Tree (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.

## Suffix Tree (Data Structure) MCQs

#### 1. Who among the following algorithm is used in external memory and compression of the suffix tree?

a) Weiner’s algorithm

b) Farach’s algorithm

c) Ukkonen’s algorithm

d) Alexander Morse

#### 2. 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

#### 3. 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

a) O (log n!)

b) O (n!)

c) O (n2)

d) O (n)

#### 5. What is the other name for Suffix Tree?

a) Array

b) Stack

c) Priority Queue

d) PAT Tree

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

#### 7. 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

#### 8. 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

a) Rope Tree

b) Suffix Tree

c) Tango Tree

d) Top Tree

#### 10. Who proposed the concept of Suffix Tree?

a) Weiner

b) Samuel F. B. Morse

c) Friedrich Clemens Gerke

d) Alexander Morse