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
- 16597 Views
- I also Faced
- E-Mail Answers
Answer Posted / mukta majumder
O(max(f(n),g(n))
| Is This Answer Correct ? | 14 Yes | 1 No |
Post New Answer View All Answers
Explain singly linked list in short.
Tell me why might quick sort might be better than merge sort?
What is the difference between Strings and Arrays?
How do you assign an address to an element of a pointer array ?
What is the use of hashtable?
How is hashmap o 1?
What is the order of selection sort?
What is sorting an array?
How to sequentially represent max-heap?
Write a program to reverse a single linked list.
What is difference between an Array and ArrayList?
What is stable sort?
Why is concurrenthashmap thread safe?
What is difference between hashtable and hashmap?
How does a treemap work?
