Interested to Buy Any Domain ? << Click Here >> for more details...
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?
- 4 Answers
- 16296 Views
- I also Faced
- E-Mail Answers
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 |
When would you use a tuple?
What are the different types of collections?
What is nonlinear data?
Where is insertion sort used?
What is fibonacci search?
What is the difference between a stack and an array?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is difference between capacity and size of arraylist?
What is the space complexity of bubble sort?
What is binary search tree and explain its time complexity?
What are the advantages of modularity?
Why is null not allowed in concurrenthashmap?
Windows 
