O(max(f(n),g(n))

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?

Question Posted / mukta majumder

4 Answers
16259 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

Please Help Members By Posting Answers For Below Questions

What is difference between array and arraylist?

924

Define the term “percolate down”?

950

What is an example of an array?

963

What is binary tree? Explain its uses.

828

What is the use of tree data structure?

823

Is quicksort a stable sorting algorithm?

934

How do you do a mergesort?

844

Explain Linked List

937

What is a threaded binary tree? Explain its operation with example?

1074

How is a hashset implemented?

877

What is the types of data structure?

954

Define linear probing?

926

How would you use bsearch() function to search a name stored in array of pointers to string?

800

What is a data structure definition?

902

What are the 3 types of measurement?

931