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
- 16287 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is frozenset?
Explain binary searching, Fibonacci search.
What is indexing an array?
How do you use the sort function?
How many types of searching are there in data structure?
Which sorting technique is faster?
Which is the parent class of linkedhashset class?
What is an expression tree?
What is a concurrenthashmap?
What is the complexity of arrays sort?
Why hashmap is faster than hashtable?
Is hashmap part of collection?
Why insertion is faster in linked list?
Can we use ordered set for performing binary search?
If I try to add enum constants to a treeset, what sorting order will it use?
