final_2009

You need not write in any row that remains the same

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: he syllables are drawn from the approximately 50 syllables that are found in Japanese. James, who dropped 6.034 early in the term suggests that you just generate all possible Haikus and hand them to a panel of judges who will pick the best. Part A (12 points) Determine how long it would take to calculate all possible Haikus given a computer that produces one Haiku per nanosecond. So you won't think you need a calculator, you may make the following approximations: 50 = 32, 17 = 16 , and 1024 = 1000, and seconds/year = 107 Part B (3 points) Is James suggestion practical? Circle your answer Yes 36 No Quiz 5, Problem 4, (24 points) Circle the best answer for each of the following question. There is no penalty for wrong answers, so it pays to guess in the absence of knowledge. Genetic algorithms, without crossover, is best described as a kind of 1. 2. 3. 4. 5. Instance of General Problem Solver architecture Instance of subsumption architecture Instance of SOAR architecture Hill climbing search None of the above Crossover is best described as 1. 2. 3. 4. 5. A product of means-ends analysis A pro...
View Full Document

This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.

Ask a homework question - tutors are online