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?
Answers were Sorted based on User's Feedback
Answer / sriram
iam sorry i had given the wrong answer above....
its O(f(n)*g(n)) or O(max(f(n),g(n))
2^n -n so its 5 and 12 nodes respectively.....
Is This Answer Correct ? | 34 Yes | 3 No |
Answer / mousumi
no of binary trees possible with n nodes is 2^n-n
3->2^3-3=5 nodes
4->2^4-4=12 nodes
Is This Answer Correct ? | 2 Yes | 4 No |
Answer / sriram
order of the algorithm is f(n)+g(n)
no of binary trees possible with n nodes is 2^n-n
3->2^3-3=5 nodes
4->2^4-4=12 nodes
Is This Answer Correct ? | 4 Yes | 15 No |
Define a binary search tree?
What are the different types of sorting? Explain the difference between them.
What are the two types of data?
What exactly is data?
Describe full binary tree and complete binary tree.
What is indexing an array?
What is an example of an algorithm?
How do I rearrange rows in numbers?
Is hashset thread safe?
What are the benefits of using arrays?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Write the advantage of separate chaining?