Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q201
the smallest number of key that will force a b-tree of order 3 to have a height 3 is
Answer: Option C
Q202
A complete full binary tree with 10 leaves
Answer: Option B
Q203
Number of possible ordered trees with 3 nodes A, B, C is
Answer: Option B
Q204
Number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is
Answer: Option D
Q205
A hash table with 10 buckets with one slot per bucket is depicted. the symbols, S1 to
S7 are initially emeged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is
Answer: Option B
Q206
A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Wuch a tree with 10 leaves
Answer: Option D
Q207
Average successful search time taken by binary search on a sorted array of 10 items is
Answer: Option B
Q208
Number of possible binary trees with 3 nodes is
Answer: Option D
Q209
Sorting is useful for
Answer: Option A
Q210
A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be
Answer: Option A