# HackWithInfy Greedy Algorithms Quiz-1

Question 1

Time: 00:00:00
In greedy algorithms,the decision are made:-

based on the future choices

based on the future choices

based on solution obtained from solving the subproblems

based on solution obtained from solving the subproblems

from the given solution domain(choices made so far)

from the given solution domain(choices made so far)

a and b

a and b

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

Start

Question 2

Time: 00:00:00
The aim of a greedy algo is to:-

find a localized optimum solution

find a localized optimum solution

find globally optimized solution

find globally optimized solution

find local optimized solution that may lead to global optimized solution

find local optimized solution that may lead to global optimized solution

all

all

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

Start

Question 3

Time: 00:00:00
What is true about the greedy algorithms?

considers the previous states

considers the previous states

never reconsiders its choices

never reconsiders its choices

break the problems into independent subproblems.

break the problems into independent subproblems.

all

all

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

Start

Question 4

Time: 00:00:00
Greedy algorithms works on:-

decision taking at every stage

decision taking at every stage

choice property

choice property

principle of optimality

principle of optimality

all

all

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

Start

Question 5

Time: 00:00:00
What makes a greedy approach suitable for optimization?

global optimal solution

global optimal solution

local optimal solution

local optimal solution

all

all

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

Start

Question 6

Time: 00:00:00
Which among the following are components of greedy algorithm?

i:)candidate set

ii:)selection function

iii:)feasibility function

iv:)objective function

v:)solution function

i-ii-iii-iv

i-ii-iii-iv

i-iii-iv-v

i-iii-iv-v

i-ii-iv

i-ii-iv

i-ii-iii-iv-v

i-ii-iii-iv-v

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

Start

Question 7

Time: 00:00:00
What are the attributes of a greedy algorithm?

greedy choice property

greedy choice property

optimal substructure

optimal substructure

feasibility function

feasibility function

a and b

a and b

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

Start

Question 8

Time: 00:00:00
Select the variations to the greedy algorithm among the following choices.

Pure greedy algorithms

Pure greedy algorithms

Orthogonal greedy algorithms

Orthogonal greedy algorithms

Relaxed greedy algorithms

Relaxed greedy algorithms

all

all

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

Start

Question 9

Time: 00:00:00
Which type of optimization is used in Greedy 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.

Start

Question 10

Time: 00:00:00
Choose the algorithms that make use of Greedy Programming Approach:-

Minimum Spanning Tree

Minimum Spanning Tree

Huffman Coding

Huffman Coding

NP-Complete Problems

NP-Complete Problems

all

all

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%