Register

KPGCET-CSE-2019-31

• recategorized by
214 views
0 votes
0 votes

The running time of an algorithm of n interdependent operations is computed with both the asymptotic & amortized analyses. The most accurate running time obtained by
  

  1. Asymptotic analysis
  2. Amortized analysis
  3. Both analyses
  4. None of these
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
gatecse asked Aug 4, 2019
182 views
KPGCET-CSE-2019-42
The comparison of algorithm types divide-and-conquer (DAC) and dynamic programming (DP) indicates that DP is bottom-up approach and DAC is top-down approach. DP is top-down approach and DAC is bottom-up approach. Both DP and DAC are bottom-up approaches. Both DP and DAC are top-down approaches.
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...
User Avatar
1 votes
1 votes
2 answers
2
gatecse asked Aug 4, 2019
503 views
KPGCET-CSE-2019-33
The least running time of creating spanning tree from connected graph in G(E, V) is O (V log V) O (E + V log V) O (E log V) O (V log V + E log V) Where E, V are respectively number of edges & vertices in the graph.
The least running time of creating spanning tree from connected graph in G(E, V) is O (V log V) O (E + V log V)O (E log V) O (V log V + E log V)Where E, V are respect...
User Avatar
0 votes
0 votes
1 answer
3
gatecse asked Aug 4, 2019
421 views
KPGCET-CSE-2019-1
The relational DBMS is constructed on relational principles which are based on The matrix theory Axiomatic principles Primary key Primary & foreign key relationship
The relational DBMS is constructed on relational principles which are based on The matrix theory Axiomatic principles Primary key Primary & foreign key relationship
User Avatar
0 votes
0 votes
1 answer
4
gatecse asked Aug 4, 2019
315 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
Link Copied!