Register

KPGCET-CSE-2019-66

• recategorized by
193 views
0 votes
0 votes

The running time of using two-way merge-sort technique to sort a file of $n>1$ record is

  1. $2T (n/2) + \theta (n)$
  2. $\text{lg}(n) + \theta(n)$
  3. $\theta (n)$
  4. $O(n)$
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
Ans: A

 In case of 2-way Merge sort we get the equation: T(n) = 2T(n/2) + θ(n) Similarly, in case of 3-way Merge sort we get the equation: T(n) = 3T(n/3) + θ(n)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
gatecse asked Aug 4, 2019
304 views
KPGCET-CSE-2019-2
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attr...
User Avatar
0 votes
0 votes
1 answer
2
gatecse asked Aug 4, 2019
335 views
KPGCET-CSE-2019-4
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language
The schema for the entire database is designed using Data definitional languageStructured query languageData manipulation language Schema structure language
User Avatar
0 votes
0 votes
0 answers
3
gatecse asked Aug 4, 2019
243 views
KPGCET-CSE-2019-12
The Software Development Life Cycle (SDLC) is used in all Process models Design models Programming models None of these
The Software Development Life Cycle (SDLC) is used in allProcess modelsDesign modelsProgramming modelsNone of these
User Avatar
0 votes
0 votes
0 answers
4
gatecse asked Aug 4, 2019
256 views
KPGCET-CSE-2019-15
The complexity of algorithms is comparatively more accurate in the use of Asymptotic analysis Amortized analysis Both of these Not dependent on the nature of analysis.
The complexity of algorithms is comparatively more accurate in the use ofAsymptotic analysisAmortized analysisBoth of theseNot dependent on the nature of analysis.
User Avatar
Link Copied!