HackWithInfy Dynamic Programming Quiz-2

Question 1

Time: 00:00:00
Which among the two approaches of dynamic programming is better for large problems and why?

Top down-it does not lead to stack overflow

Top down-it does not lead to stack overflow

Top-Down-it makes use of recursive relation more efficiently

Top-Down-it makes use of recursive relation more efficiently

Bottom Up-it makes use of recursive relation more efficiently  

Bottom Up-it makes use of recursive relation more efficiently  

Bottom-Up-it does not lead to stack overflow  

Bottom-Up-it does not lead to stack overflow  

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
What is the space complexity of Dynamic Programming?

0(n)

0(n)

0(n*1)

0(n*1)

0(log n)

0(log n)

0(2n*1)

0(2n*1)

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
What is the time complexity of Dynamic Programming?

 

0(n)

0(n)

0(n*1)

0(n*1)

0(log n)

0(log n)

0(2n*1)

0(2n*1)

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 4

Time: 00:00:00
The dynamic programming is more efficient than recursion when:-

the stages of the recursion is more

the stages of the recursion is more

the space of the subproblems is less

the space of the subproblems is less

the space of the optimal solution is less

the space of the optimal solution is less

b and c

b and c

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
Why do we make use of Dynamic Programming ?

referring to the previous solution output is cheaper

referring to the previous solution output is cheaper

recomputing in terms of CPU cycles is made easier because of DP

recomputing in terms of CPU cycles is made easier because of DP

recursion is overcomed

recursion is overcomed

a and b  

a and b  

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
Which among the following is true about the components of dynamic programming:-

i:)Stage-subproblem of problem

ii:)State:-each stage has several states associated with it

iii:)Decision-it is taken at each state

i,ii

i,ii

i,ii,iii

i,ii,iii

i,iii

i,iii

ii,iii

ii,iii

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
Optimal Policy in Dynamic Programming is :-

rule which determines the decision at each stage

rule which determines the decision at each stage

is globally optimal

is globally optimal

is locally optimal

is locally optimal

a and b

a and b

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
The dynamic programming approach steps in bottom up are in the order:-

i:)Recursively define the value of optimal solution

ii:)Construct the optimal solution for entire problem

iii:)Characterize structure of optimal solution

iv:)Compute value of optimal solution

 

iii-i-iv-ii

iii-i-iv-ii

i-ii-iii-iv

i-ii-iii-iv

iii-iv-i-ii

iii-iv-i-ii

i-iv-iii-ii

i-iv-iii-ii

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%