Register

GB DSA-Test 4-Question 17
closed

• closed by
1,168 views
0 0 votes
closed

The number of elements that can be sorted in Θ(2^{n}) time using merge sort is, where n is the size of input which can be represented as some k^{th} power of 2 for some positive integer k:

(A) \theta(\frac{2^n}{logn})

(B) \theta(\frac{2^{n-k}}{logn})

(C) \theta(\frac{n2^{n}}{k})

(D) \theta({2^{n-k}})

Voting & Accepting an answer helps improve the community
← Previous · GB DSA-Test 4-Questi...Next → · Kenneth Rosen Editio...
← Previous in category · GB DSA-Test 4-Questi...Next in category → · Doubt
Position:
Show:

Related questions

0 0 votes
0 0 answers
503
503 views
Sandy Sharma asked Sep 21, 2018
503 views
GB-DSA-Test 3-Question 15Consider the graph shown below:
Consider the graph shown below:Cardinality of the largest maximum independent set of the above graph is: ——?
0 0 votes
0 0 answers
528
528 views
Sandy Sharma asked Sep 21, 2018
528 views
GB-DSA-Test 3-Question 18
Consider following statements about Cycle graph, Complete Bipartite graph and Complete graph. (i) Cycle graph Cn is subgraph of a complete graph Kn. (ii) Kn,n a subgraph ...
1 1 vote
0 0 answers
1.4k
1.4k views
Sandy Sharma asked Nov 19, 2018
1,384 views
GB DL - Test 1 - Question 16
The gray code for a decimal number N is . This number N is converted into P which belongs to 84 − 2 − 1 code system. What is the Hexadecimal representation for P?(A) ABC(...
3 3 votes
1 answers 1 answer
758
758 views
Sandy Sharma asked Nov 19, 2018
758 views
GB DL - Test 1 - Question 19
If decimal value of is less than that of then possible values of x and y in octal number system respectively are:(A) 11, 16(B) 15, 9(C) 9, 12(D) 17, 11