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
- 16403 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
What is time complexity of bubble sort?
Where will be the free node available while inserting a new node in a linked list?
Define collision in hashing?
What is m way tree in data structure?
What do you mean by spanning tree?
How is bubble sort done?
Which is faster arraylist or linked list?
How do you find a string is anagram or not?
What is data structure and its types?
How do you find the time complexity of a bubble sort?
What is mean by abstract data type?
Which is better hashmap or hashtable?
What is the difference between sorting and classifying?
What do you mean by sorting data?
What is a Queue? Explain its operation with example?
