Chapter 23

Question 1

Where greedy algorithm used

Answer 1

For optimization

Question 2

Does greedy algorithm use recursion

Answer 2

No

Question 3

What is backtrack search

Answer 3

Its a search technique

Question 4

What are 2 phases of greedy algorithm

Answer 4

1- We can take the best you can get right now, without regard for future consequences.
2- We hope that choosing a local optimum at each step, you will end up a global optimum.

Question 5

What is backtrack

Answer 5

Decide and move on to one strategy and then taking that decision back and leave that strategy

Question 6

What is greedy approximation

Answer 6

Greedy finds good but not best

Question 7

In which case greedy algorithm gives optimal solution

Answer 7

Entities are all powers of a fixed denomination

Question 8

How much time greedy algorithm takes

Answer 8

O(k)

Question 9

How much time dynamic programming takes

Answer 9

O(kn)

Question 10

What is huffmen encoding

Answer 10

Lets suppose we have data (text, ASCII etc) and we want to send in over network. We need to convert it into smaller chunks for speed point of view. We also want to compress it so it will take minimum numbers of bits during transfer. For compressing, we will use huffmen encoding.

Question 11

Does greedy algorithm have any link with huffmen encoding

Answer 11

Yes