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
- 16416 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
What is the most used data structure?
Define an algorithm.
What is the difference between null and void?
Why is arraylist faster than linkedlist?
What is a treemap chart?
Why is sorting important?
How hashmap increases its size?
What does quick sort do?
What is a Breadth First Search? Give a few of its applications.
Why do we need linked lists?
Is char array null terminated?
What is definition list?
What is structured data with example?
Define path in a graph?
where do you use double linked list?
