HackerRank Dynamic Programming Quiz-1

Question 1

Time: 00:00:00
Dynamic Programming is an algorithm technique for solving :-

optimization problem

optimization problem

recursion problem

recursion problem

divide and conquer problem

divide and conquer problem

all

all

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

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
Dynamic programming is implemented by:-

i:)breaking down an optimization problem into subproblems

ii:)finding the optimal solution of the problem

iii:)ensuring ,optimal solution of problem depends on optimal solution of subproblem

 

i,ii,iii

i,ii,iii

i,ii

i,ii

ii,iii

ii,iii

i,iii  

i,iii  

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

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
The relation between the value of the larger problem and the value of the subproblem is known as:-

Richard relationship

Richard relationship

Optimization relationship

Optimization relationship

Bellman Equation

Bellman Equation

Recursion relation

Recursion relation

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 attributes of a problem for dynamic programming comprises of :-

Optimal structure  

Optimal structure  

Overlapping subproblems

Overlapping subproblems

Recursive nature

Recursive nature

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 5

Time: 00:00:00
Dynamic programming(DP) is similar/different from Divide and Conquer Problem(DCP)  by:-

Subproblems- In DP solved independently and in DCP not solved independently

Subproblems- In DP solved independently and in DCP not solved independently

Subproblems- In DP solved independently and in DCP solved independently

Subproblems- In DP solved independently and in DCP solved independently

Subproblems- In DP not solved independently and in DCP solved independently

Subproblems- In DP not solved independently and in DCP solved independently

Subproblems- In DP not solved independently and in DCP not solved independently  

Subproblems- In DP not solved independently and in DCP not solved independently  

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

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
Dynamic algorithms make use of ----------------- to remember the output of the already solved problems.

Bioinformatics

Bioinformatics

Recognition

Recognition

Recollection

Recollection

Memorization

Memorization

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

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
Which of the following approaches are used to conquer Dynamic Programming?

Top-Down Approach

Top-Down Approach

Bottom-Down Approach

Bottom-Down Approach

Hierarchical Approach

Hierarchical Approach

a and b both  

a and b both  

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

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
Choose the problems that make use of Dynamic Programming Approach:-

Knapsack problem  

Knapsack problem  

Tower of Hanoi

Tower of Hanoi

Shortest path by Dijkstra

Shortest path by Dijkstra

all

all

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

Please login to submit your explanation

Start

Question 9

Time: 00:00:00
Which type of optimization is used in Dynamic Programming?

local optimization of problem

local optimization of problem

overall optimization of problem

overall optimization of problem

constrained optimization of problem

constrained optimization of problem

discrete optimization of problem

discrete optimization of problem

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

Please login to submit your explanation

Start

Question 10

Time: 00:00:00
In dynamic programming solutions are combined to achieve an :-

overall solution

overall solution

recursive call of sub-problem

recursive call of sub-problem

to optimize bigger sub-problem

to optimize bigger sub-problem

all

all

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%