宅學習 - Social Learning Space 社交學習空間@FJU CSIE

"

根據QUIZ3...

1.Fine the greedy approach, a problem is divided into Optimization

Problems(P138)

2.Prim's Algorithm always produces a minimum spanning tree(p147)

3.It is very easy to determine whether a greedy algorithm always produces an

difficult solution

4.After visiting a node with backtracking if we determined that it can possibly

lead to a solution. The node is called promising(p191)

5.A common way to represent a file is to use a binary code. In such a code, each

character is represented by a unique binary string, called the codeword(p169)

6.Monte Carlo algorithm is nondeterministic,running more than once (p201)

7.best-first search ==>priority-queue

8.B&B==>TSP無法確定較快與否

"