Explain the term "brute force" as it applies to algorithms.
What will be an ideal response?
The algorithm described here for testing an arbitrary graph for Hamiltonian circuits is an example of a brute force algorithm-one that beats the problem into submission by trying all possibilities. In Chapter 1, we described a brute force algorithm for winning a chess game; it consisted of looking at all possible game scenarios from any given point on and then picking a winning one. This is also an exponential algorithm. Some very practical problems have exponential solution algorithms. For example, an email message that you send over the Internet is routed along the shortest possible path through intermediate computers from your mail server computer to the destination mail server computer. An exponential algorithm to solve this problem would examine all possible paths to the destination and then use the shortest one. As you can imagine, the Internet uses a better (more efficient) algorithm than this one!
You might also like to view...
The first portion of a URL identifies the ____.
A. prototype B. index C. protocol D. resource
__________ is an open-source platform offered free to the public in 1991 for developing computer operating systems
A) Linux B) OS X C) Red Hat D) UNIX
The National Association of Corporate Directors (NACD) recommends four essential practices for boards of directors. Which of the following is NOT one of these recommended practices?
A. Hold regular meetings with the CIO to discuss tactical InfoSec planning. B. Assign InfoSec to a key committee and ensure adequate support for that committee. C. Ensure the effectiveness of the corporation's InfoSec policy through review and approval. D. Identify InfoSec leaders, hold them accountable, and ensure support for them.
Which of the following expansion slots is MOST commonly used for high-end video cards?
A. PCI B. PCle C. CNR D. AGP