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
- 16289 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 meant by int?
why it is difficult to store linked list as an array?
How do you use the sort function?
Which type of sorting is best?
What is a map in programming?
Mention for which header list, you will found the last node contains the null pointer?
What do you mean by double hashing?
What is mean by selection sort?
What is dynamic array how it is created?
Write an algorithm to check if there is a loop in a doubly linked list.
What is collections singletonmap?
What is difference between treeset hashset linkedhashset?
Windows 
