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?
Answers were Sorted based on User's Feedback
Answer / sriram
iam sorry i had given the wrong answer above....
its O(f(n)*g(n)) or O(max(f(n),g(n))
2^n -n so its 5 and 12 nodes respectively.....
Is This Answer Correct ? | 34 Yes | 3 No |
Answer / mousumi
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 ? | 2 Yes | 4 No |
Answer / 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 |
Tell me what should be done in the base case for this recursive problem?
How does bogo sort work?
Define 2-3-4 tree?
Is array part of collection framework?
why it is difficult to store linked list as an array?
What is the use of isEmpty() member methods?
Where is data structure used?
What are different types of sorting algorithms?
What is the best sorting technique?
Write program for Bubble Sort ?
Name two algorithms two find minimum spanning tree?
Which interface provides the capability to store objects using a key-value pair?