Q#1: An algorithm is made up of 2 modules M1 and M2.If
order of M1 is F(n) and order of M2 is g (n) then what is
the order of the algorithm.
Q # 2 : How many binary trees are possible with 3 nodes?
with 4 nodes?
Answer Posted / sriram
order of the algorithm is f(n)+g(n)
no of binary trees possible with n nodes is 2^n-n
3->2^3-3=5 nodes
4->2^4-4=12 nodes
Is This Answer Correct ? | 4 Yes | 15 No |
Post New Answer View All Answers
Why heap sort is not used?
Explain pre-order and in-order tree traversal.
What is time complexity of sorting algorithms?
What is the order of selection sort?
Which sorting algorithm has minimum number of swaps?
What is a hash in programming?
Does list maintain insertion order?
What do you mean by overflow and underflow?
What is non linear structure?
What is significance of ” * ” ?
Is complete binary tree?
Is a list an array?
Why quicksort is faster?
We know that Arrays are objects so why cannot we write strArray.length()?
Can hashset contain duplicates?