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
- 15133 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 the Difference between sax and dom parser?
Why is sorting necessary?
What are hashmaps good for?
Explain what are the major data structures used in the hierarchical data model?
What is red black tree in data structure?
Explain the common uses of threaded binary tree.
Can arraylist have duplicates?
What is a subtree in data structures?
How efficient is binary search?
Define 2-3 tree?
Can arraylist hold duplicates?
What is a bubble sort and how do you perform it?
State the difference between arrays and linked lists?
Differentiate between arraylist and vector.
Briefly explain recursive algorithm?
