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
- 16598 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 time complexity of arraylist and linked list?
Is array a collection?
What is a concurrenthashmap?
Write is a binary search tree? Write an algorithm and tell complexity?
What is weight balanced tree in data structure?
How does hashset work internally in java?
How many types of data structure are there?
Does hashmap allow duplicate keys?
Does hashset guarantee order?
Define disjoint set adt?
Can you dynamically allocate arrays in expanded memory?
Write a program to insert an element and in the specific position in the array?
Is map a data structure?
What is the time complexity of arrays sort?
Explain what are the major data structures used in the hierarchical data model?
