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
- 15131 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 is better merge sort or quick sort?
What happens if we put duplicate key in hashmap?
How many types of lists are there?
Discuss how to implement queue using stack.
Why do we use stacks?
What member function places a new node at the end of the linked list?
Is heap sort stable?
What is the use of sorting the data?
What is the use of isEmpty() member methods?
What do you mean by tree edge?
Define internal nodes?
What happens if we try to insert duplicate key in hashmap?
Which is the parent class of abstractqueue class?
How many types of search algorithms are there?
What type of variable is age?
