# HackerRank Greedy Algorithm Quiz-2

Question 1

Time: 00:00:00
Greedy algorithms are failed to find an optimal solution because they:-

operate exclusively on all the data

operate exclusively on all the data

do not operate exclusively on all the data

do not operate exclusively on all the data

do not operate inclusively on all the data

do not operate inclusively on all the data

operate inclusively on all the data

operate inclusively on all the data

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

Start

Question 2

Time: 00:00:00
Greedy Algorithm is solved by :-

determining a subset of a problem

determining a subset of a problem

satisfying some constraints for a subset

satisfying some constraints for a subset

maximizing objective function

maximizing objective function

all

all

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

Start

Question 3

Time: 00:00:00
Greedy algorithm follows----------------strategy

top-down

top-down

bottom-up

bottom-up

hierarchical

hierarchical

both a and b

both a and b

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

Start

Question 4

Time: 00:00:00
What is the space complexity of the Greedy algorithm?

0(log N)

0(log N)

0(N * logN).

0(N * logN).

0(N *N)

0(N *N)

0(log 2N )

0(log 2N )

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

Start

Question 5

Time: 00:00:00
What is the time complexity of the Greedy algorithm?

0(log N)

0(log N)

0(N * logN).

0(N * logN).

0(N *N)

0(N *N)

0(log 2N )

0(log 2N )

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

Start

Question 6

Time: 00:00:00
Dynamic Programming is more efficient than Greedy Algorithm.

True

True

False

False

Both have same efficiency

Both have same efficiency

Depends on the problem

Depends on the problem

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

Start

Question 7

Time: 00:00:00
What do you mean by feasible solution in Greedy approach?

solution with only maximum objective function

solution with only maximum objective function

solution with only minimum objective function

solution with only minimum objective function

solution with maximum or minimum objective function

solution with maximum or minimum objective function

none

none

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

Start

Question 8

Time: 00:00:00
Which algorithm uses a greedy approach ?

Binary Search

Binary Search

Prim’s algorithm

Prim’s algorithm

Hanoi Tower

Hanoi Tower

None of the above

None of the above

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

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%