Algorithms Questions Set 11:
Which one of the following balance factor, a node in AVL tree cannot have?
Solution:
What is the time complexity of raising a number a to the power b?
Solution:
What is the time complexity of matrix multiplication using the Divide and Conquer method?
Solution:
The approach adopted to solve the quick hull problem is:
Solution:
What is the time complexity to insert an element at the front of a linked list (where the head is known)?
Solution:
The average number of key comparisons required for a successful search using sequential search on a list of n items is
Solution:
Which of the following approaches can be used to solve the sum of subsets problem?
Solution:
Consider a B-tree of order 4 that is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that can occur?
Solution:
A string matching algorithm is a technique used to find a pattern or substring within a larger text or string.
Solution:
Consider the following code snippet:
void recursive_function()
{
recursive_function();
}
int main()
{
recursive_function();
return 0;
}
What will happen when the above code is executed?
Solution:
Related Question Sets:
Related Topics:
Scroll to Top
