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
- 15791 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
When would you use a hashmap?
State the advantages of using infix notations?
Can hashmap have same key?
Describe tree database.
Is radix sort faster than quicksort?
What are control structures?
Can a null element added to a treeset or hashset?
Can treeset contain duplicates?
Why is an array homogeneous?
What is difference between array and string?
Why linked list is required?
Which is better hashset or treeset?
What is the heap in data structures?
What is the best case for bubble sort?
What are the disadvantages of linked list over array?
