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
- 16413 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 |
Is array static or dynamic?
what is the primary advantage of a linked list?
What are the tasks performed during preorder traversal?
How do I rearrange rows in numbers?
What is a height of a tree?
What do you mean by the term “percolate down”?
Does hashmap preserve insertion order?
What is the difference between classifying and sorting?
What are the differences between b tree and b+ tree?
In what order the elements of a hashset are retrieved?
What is circular queue in data structure?
What are different types of sorting algorithms?
Windows 
