Register

KPGCET-CSE-2019-14

• recategorized by
511 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · KPGCET-CSE-2019-15Next → · KPGCET-CSE-2019-13
← Previous in category · KPGCET-CSE-2019-15Next in category → · IIIT BLR TEST 1 : AL...
Position:
Show:

Related questions

0 0 votes
1 1 answer
481
481 views
gatecse asked Aug 4, 2019
481 views
KPGCET-CSE-2019-15
The complexity of algorithms is comparatively more accurate in the use ofAsymptotic analysisAmortized analysisBoth of theseNot dependent on the nature of analysis.
0 0 votes
1 1 answer
617
617 views
gatecse asked Aug 4, 2019
617 views
KPGCET-CSE-2019-30
The tower of Hanoi puzzle with $n (n 1)$ different dimensional disks stacked on peg A in the decreasing order of their size with largest dimensional disk at the bottom a...
0 0 votes
0 0 answers
333
333 views
gatecse asked Aug 4, 2019
333 views
KPGCET-CSE-2019-42
The comparison of algorithm types divide-and-conquer (DAC) and dynamic programming (DP) indicates thatDP is bottom-up approach and DAC is top-down approach.DP is top-down...
0 0 votes
1 1 answer
432
432 views
gatecse asked Aug 4, 2019
432 views
KPGCET-CSE-2019-66
The running time of using two-way merge-sort technique to sort a file of $n>1$ record is$2T (n/2) + \theta (n)$$\text{lg}(n) + \theta(n)$$\theta (n)$$O(n)$