Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q21
A sort which interactively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
Answer: Option B
Q22
A sort which uses the binary tree concept such that any number is larger than all the numbers in the subtree below it is called
Answer: Option C
Q23
The minimum number of fields with each node of doubly linked list is
Answer: Option C
Q24
Let A be a sorted array of n=10 element. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using binary search ?
Answer: Option B
Q25
What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6), so that the remaining graph is planar ?
Answer: Option D
Q26
In a complete binary tree of n nodes, how far are the most distant two nodes. Assume that each edge in the path counts as 1. Assume log (n) as log base 2.
Answer: Option B
Q27
Consider a sorted binary insertion tree. what must be done to produce a sorted array of numbers (for printing) from the sorted binary insertion tree ?
Answer: Option C
Q28
How many comparisons are needed to sort an array of length 5 if a straight selection sort is used and array is already in the opposite order ?
Answer: Option D
Q29
If memory for the run-time stack is only 150 cells (words), how big can N be in Factorial (N) before encountering stack overflow ?
Answer: Option D
Q30
The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is
Answer: Option C