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
- 16592 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
How hashmap increases its size?
How is the front of the queue calculated ?
What is 2 dimensional linked list?
List some applications of multilinked structures?
Can we define the size of arraylist?
Why is arraylist not thread safe?
What do you mean by spanning tree?
Is list an array?
What are the advantages of binary search over linear search?
Is arraylist fail fast?
write a program to show the insertion and deletion of an element in an array using the position
Define collision in hashing?
What is a Breadth First Search? Give a few of its applications.
Is arraylist synchronized?
What are common data structures?
