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
- 16329 Views
- I also Faced
- E-Mail Answers
Answer Posted / mukta majumder
O(max(f(n),g(n))
| Is This Answer Correct ? | 14 Yes | 1 No |
Post New Answer View All Answers
What is a string array?
Which language is best for learning data structures and algorithms?
What happens in insertion sort?
Tell me what should be done in the base case for this recursive problem?
Why we use linked list?
Define graph?
What do you mean by union-by-weight?
Give a basic algorithm for searching a binary search tree?
What are some of the best practices relating to the java collection framework?
Can we insert null in hashset?
What are the different types of collections?
Can we put null key in hashmap?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What can be stored in an arraylist?
What is the minimum number of nodes that a binary tree can have?
