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
- 16593 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 |
What is a spanning tree in data structure?
How does the bubble sort work?
Why is merge sort faster?
Is hashmap fail safe?
Which is better stack or queue?
What is tree and its properties?
Can arraylist store objects?
How does a hashmap work?
What is data structure geeksforgeeks?
What is hash value of a string?
What do you understand by doubly linked list?
How remove all from arraylist?
Windows 
