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
- 16266 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
Tell us the difference between merge and quick sort. Which one would you prefer and why?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What does a bubble chart show?
Why is sorting important?
What is the non linear data structure?
How many sorting techniques are there?
What is arraylist load factor?
What do you mean by level of the tree?
What is a singletonlist?
What is the use of threaded binary tree?
Which collection is fail safe?
What is the use of data structure in real life?
What is bubble sort and selection sort?
What you mean by sorting?
What is list data structure?
