officerpath@gmail.com Hyderabad, Pakistan
Login Register
Latest Jobs CSS 2025 PMS CCE Sindh FPSC PPSC MCQs Past Papers Current Affairs Scholarships Admissions Downloads Roll No. Slips Results
Computer

Advanced Trees (Avl, Redblack, Btrees) MCQs

Practice Advanced Trees (Avl, Redblack, Btrees) MCQs for competitive exams.

Advanced Trees (Avl, Redblack, Btrees) MCQs

Practice questions from this topic.

LLRB maintains 1-1 correspondence with 2-3 trees.

  1. A. True
  2. B. False
Report Error

B-tree of order n is a order-n multiway tree in which each non-root node contains . . . . . . . .

  1. A. at most (n - 1)/2 keys
  2. B. exact (n - 1)/2 keys
  3. C. at least 2n keys
  4. D. at least (n - 1)/2 keys
Report Error

Which of the following algorithm of data compression uses a suffix tree?

  1. A. Weiner's algorithm
  2. B. Farach's algorithm
  3. C. Lempel - Ziv - Welch's algorithm
  4. D. Alexander Morse's algorithm
Report Error

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

  1. A. Ɵ (n)
  2. B. Ɵ (n!)
  3. C. O (n 2 + n1)
  4. D. O (log n!)
Report Error

Which of the following is the most widely used external memory data structure?

  1. A. AVL tree
  2. B. B-tree
  3. C. Red-black tree
  4. D. Both AVL tree and Red-black tree
Report Error

Which tree provides a linear time solution for substring operation?

  1. A. Rope Tree
  2. B. Suffix Tree
  3. C. Tango Tree
  4. D. Top Tree
Report Error

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

  1. A. log2n
  2. B. log2m
  3. C. n
  4. D. m
Report Error

What is the best case height of a B-tree of order n and which has k keys?

  1. A. logn (k+1) - 1
  2. B. nk
  3. C. log k (n+1) - 1
  4. D. klog n
Report Error

Can the two edges that are coming out of a node have labels of string beginning with the same character?

  1. A. True
  2. B. False
Report Error

Can suffix tree be used in string problems occurring in a text editor.

  1. A. True
  2. B. False
Report Error

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

  1. A. O (log n!)
  2. B. O (n!)
  3. C. O (n 2 )
  4. D. O (n)
Report Error

In a B+ tree, both the internal nodes and the leaves have keys.

  1. A. True
  2. B. False
Report Error