Register

NIELIT Scientific Assistant A 2020 November: 64

• retagged by
669 views

1 Answer

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

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Dec 9, 2020
752 views
NIELIT Scientific Assistant A 2020 November: 105
Assembly line scheduling and Longest Common Subsequence problems are an example of _______. Dynamic Programming Greedy Algorithms Greedy Algorithms and Dynamic Programming respectively Dynamic Programming and Branch and Bound respectively
Assembly line scheduling and Longest Common Subsequence problems are an example of _______.Dynamic ProgrammingGreedy AlgorithmsGreedy Algorithms and Dynamic Programming r...
User Avatar
1 votes
1 votes
3 answers
2
gatecse asked Dec 9, 2020
669 views
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
In case of the dynamic programming approach the value of an optimal solution is computed in :Top down fashionBottom up fashionLeft to Right fashionRight to Left fashion
User Avatar
3 votes
3 votes
1 answer
3
gatecse asked Dec 9, 2020
906 views
NIELIT Scientific Assistant A 2020 November: 101
What is the time complexity of the following recursive function? int ComputFun(int n) { if(n<=2) return 1; else return (ComputFun(floor(sqrt(n)))+n); } $\Theta(n)$ $\Theta(\log n)$ $\Theta(n\log n)$ $\Theta(\log \log n)$
What is the time complexity of the following recursive function?int ComputFun(int n) { if(n<=2) return 1; else return (ComputFun(floor(sqrt(n)))+n); }$\Theta(n)$$\Theta(\...
User Avatar
Link Copied!