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
- 16458 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
Can nsarray contain nil?
What is a postfix expression?
Which sorting is stable?
What is stack and its operations?
What is significance of ” * ” ?
How can we reverse a singly linked list?
How would you dynamically allocate a one-dimensional and two-dimensional array of integers?
What is linear-logarithm chasm?
Define terminal nodes in a tree?
In depth questions regarding the data structures and the Databases used in the Projects developed.
Does hashmap sort automatically?
Write the c program to insert a node in circular singly list at the beginning.
What is the difference between for and foreach loop?
What is the best case for bubble sort?
What is a map in programming?
