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
- 16443 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
What is difference between hashmap and hashset?
Does arraylist have index?
State the difference between primitive and non-primitive data types?
Describe tree database. Explain its common uses.
How does arraylist size work?
Are duplicates allowed in list?
Explain the Linked List
Which sorting technique is faster?
Can we extend an array after initialization?
Define back edge?
Explain Stack
What is heap with example?
Does list allow null values?
Have you ever used HashTable and Directory?
Why is map not a collection?
