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
- 16338 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Which sorting algorithm is best for large data?
What is 2 dimensional linked list?
Which is better merge or quick sort?
In tree construction which is the suitable efficient data structure?
What does the term sorting refer to?
Write is a binary search tree? Write an algorithm and tell complexity?
What is a string or array type?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
What is internal and external sorting?
What is a subtree in data structures?
Can you sort a string?
What does stack top do?
Define a full binary tree ?
What is the difference between arrays sort and collections sort?
Why is data structure used?
