Summarizing Greedy Algorithms

Which of the following is a main feature of the jobs that the job-sequencing problem is concerned with?

Each job takes a single unit of time to complete & Each job has a deadline..

Which of the following is true about coloring graphs using the greedy approach?

Graph coloring is used in areas such as image segmentation and networking. & The chromatic number of a graph, defined by X(graph), is the minimum number of colors required to perform vertex coloring on the graph.

Which of the following is a property that needs to be found in a problem when finding a solution using a greedy algorithm?

Greedy choice property

Which of the following is true about the Egyptian fraction problem?

In an Egyptian fraction, every fraction that is written must have a numerator equal to the value 1. & The goal of this problem is to represent any rational number of the form n/m as the sum of different unit fractions.

Which of the following is true about Huffman coding?

It is a divide-and-conquer algorithm.

Which of the following is true about the greedy approach to solve problems?

Many problems cannot be correctly solved by the greedy approach. & It focuses on the immediate benefits rather than considering the larger problem as a whole. & Once a decision has been made, it is never reconsidered, whatever the situation that may arise later. & One advantage to using a greedy algorithm is that the solutions to smaller instances of a problem can be straightforward and easy to understand. & It focuses on the immediate benefits rather than considering the larger problem as a whole.

Which of the following is true about Prim's algorithm?

One of the sets created by Prim's algorithm contains the nodes that are not yet included in the minimum spanning tree (MST). & Prim's algorithm works by creating two sets of nodes. & One of the sets created by Prim's algorithm contains all of the nodes already placed in the minimum spanning tree (MST). Thus, it starts with 0 nodes.

Which of the following is a property that needs to be found in a problem when finding a solution using a greedy algorithm?

Optimal substructure property

Which of the following is true about applying the greedy algorithm to find the Egyptian fraction for the fraction 2/3?

The first step of this algorithm calculates the largest possible unit fraction that is smaller than 2/3. & The second unit fraction found by the algorithm is 1/5 After finding the third unit fraction, the algorithm will perform the operation 2/15-1/9

Why is the Huffman coding method efficient?

The length of the transmission that it produces is shorter. & It considers the frequency of occurrence when coding characters. & It assigns shorter codes to characters that occur less frequently. & It assigns shorter codes to the characters that occur more frequently.

The ____________ property dictates that the global optimum solution can be achieved by selecting the local optimum.

greedy choice

The goal of the Egyptian problem is to represent any rational number of the form n/m as the sum of different ______________fractions.

unit