## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Suffix Tree Multiple choice Questions and Answers (MCQs)

Question 1 |

What is a time complexity for x pattern occurrence of length n?

O (log n!) | |

Ɵ (n!) | |

O (n ^{2}) | |

Ɵ (n + x) |

**Library science Questions answers**

Question 1 Explanation:

Suffix tree is also known as PAT tree or position tree. It allows fast string operation. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for x pattern occurrence of length n is Ɵ (n + x).

Question 2 |

What is a time complexity for finding the longest substring that is common in string S1 and S2?

O (log n!) | |

Ɵ (n!) | |

O (n ^{2}+ n1) | |

Ɵ (n1 + n2) |

**Bank exam Questions answers**

Question 2 Explanation:

Suffix Tree allows fast string operation. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for finding the longest substring that is common in string S1 and S2 is Ɵ (n1 + n2).

Question 3 |

What is a time complexity for finding the longest substring that is repeated in a string?

O (log n!) | |

Ɵ (n!) | |

O (n ^{2}+ n1) | |

Ɵ (n) |

**ICT Questions answers**

Question 3 Explanation:

Suffix Tree allows fast string operation. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for finding the longest substring that is repeated in a string is Ɵ (n).

Question 4 |

What is a time complexity for finding frequently occurring of a substring of minimum length in a string?

Ɵ (n) | |

Ɵ (n!) | |

O (n ^{2}+ n1) | |

O (log n!) |

**Home science Questions answers**

Question 4 Explanation:

Suffix Tree allows fast string operation. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for finding frequently occurring of a substring of minimum length in a string is Ɵ (n).

Question 5 |

What is a time complexity for finding the longest prefix that is common between suffix in a string?

Ɵ (n) | |

Ɵ (n!) | |

Ɵ (1) | |

O (log n!) |

**English literature Questions answers**

Question 5 Explanation:

Suffix Tree allows fast string operation. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for finding the longest prefix that is common between suffix in a string is Ɵ (1).

There are 5 questions to complete.