Advanced Trees (AVL, RedBlack, BTrees) MCQ question and answer with solution

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

A. O (log n!)

B. Ɵ (n!)

C. O (n²+ n1)

D. Ɵ (n)

Answer & Solution Discuss in Board Save for Later

72.
What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings s1, s2 respectively)?

A. O (log n!)

B. Ɵ (n!)

C. O (n²+ n1)

D. Ɵ (n1 + n2)

Answer & Solution Discuss in Board Save for Later

73.
What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

A. Linear Time

B. Exponential Time

C. Logarithmic Time

D. Cubic Time

Answer & Solution Discuss in Board Save for Later

74.
What is the other name for Suffix Tree?

A. Array

B. Stack

C. Priority Queue

D. PAT Tree

Answer & Solution Discuss in Board Save for Later

75.
AVL trees provide better insertion the 2-3 trees.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

76.
Which of the following is false?

A. Compared to B-tree, B+ -tree has larger fanout

B. Deletion in B-tree is more complicated than in B+ -tree

C. B+ -tree has greater depth than corresponding B-tree

D. Both B-tree and B+ -tree have same search and insertion efficiencies

Answer & Solution Discuss in Board Save for Later

77.
Who proposed the concept of Suffix Tree?

A. Weiner

B. Samuel F. B. Morse

C. Friedrich Clemens Gerke

D. Alexander Morse

Answer & Solution Discuss in Board Save for Later

78.
The height of 2-3 tree with n elements is . . . . . . . .

A. between (n/2) and (n/3)

B. (n/6)

C. between (n) and log2(n + 1)

D. between log3(n + 1) and log2(n + 1)

Answer & Solution Discuss in Board Save for Later

79.
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 & Solution Discuss in Board Save for Later

80.
Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

A. Statement 1 is true but statement 2 is false

B. Statement 2 is true but statement 1 is false

C. Both the statements are true

D. Both the statements are false

Answer & Solution Discuss in Board Save for Later

Advanced Trees (AVL, RedBlack, BTrees) MCQ question and answer with solution | Data Structure MCQs

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

Answer & Solution

72. What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings s1, s2 respectively)?

Answer & Solution

73. What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

Answer & Solution

74. What is the other name for Suffix Tree?

Answer & Solution

75. AVL trees provide better insertion the 2-3 trees.

Answer & Solution

76. Which of the following is false?

Answer & Solution

77. Who proposed the concept of Suffix Tree?

Answer & Solution

78. The height of 2-3 tree with n elements is . . . . . . . .

Answer & Solution

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

Answer & Solution

80. Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

Answer & Solution

Read More Section(Advanced Trees (AVL, RedBlack, BTrees))

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

72.
What is a time complexity for finding the longest substring that is common in string S1 and S2 (n1 and n2 are the string lengths of strings s1, s2 respectively)?

73.
What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

74.
What is the other name for Suffix Tree?

75.
AVL trees provide better insertion the 2-3 trees.

76.
Which of the following is false?

77.
Who proposed the concept of Suffix Tree?

78.
The height of 2-3 tree with n elements is . . . . . . . .

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

80.
Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.