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
- 16441 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 definition list?
Write a Program for Insert in a sorted list
How do you create a tree diagram?
How do you find a string is anagram or not?
How would you use qsort() function to sort the name stored in an array of pointers to string?
what is Singly Linked list?
What is sorting with example?
Can we sort hashmap?
What is difference between hashmap and arraylist?
What is modcount in hashmap?
What are some of the best practices relating to the java collection framework?
What is inserting in data structure?
Why is it called bubble sort?
What is difference between treeset hashset linkedhashset?
How do you declare An array of three char pointers
