Quiz+1+ans+2021 (4)

docx

School

New Jersey Institute Of Technology *

*We aren’t endorsed by this school

Course

337

Subject

Computer Science

Date

Apr 3, 2024

Type

docx

Pages

3

Uploaded by DrFogBeaver35

Report
ECE 788 Quiz #1 Name: ____________ 1. Please state whether the following statements are correct and explain why if incorrect . (40 points) a. Genetic algorithm is a local search algorithm. Incorrect. It is a global search algorithm (done through crossover). b. For survival selection in genetic algorithm, the strongest candidates will be selected. Incorrect. The strongest candidate is most likely to be selected. The selection is typically done in probabilistic manner. c. When we perform mutations, we should first identify the subset of genes that will mutate, and then for each gene, we perform the random test. Incorrect. The mutation (and random test) is done for each gene, rather than for a subset of genes. d. The mutation in genetic algorithm is intended to be global search and incur a substantial perturbation to the current solution. Incorrect. The mutation is intended to be a local search and often incurs a small perturbation. 2. Please explain the differences between exhaustive search and genetic algorithm. (10 points) a. Exhaustive search involvers high search complexity, while the overhead of genetic algorithm is manageable. b. There is no intelligence in generating a new solution in exhaustive search, while genetic algorithm is more intelligent on this through recombination and mutation. c. Exhaustive search does not have probabilistic selection, while genetic algorithm does. 3. For edge recombination, please construct the edge table and generate a new offspring. (30 points) Parent 1: [1 2 3 4 5 6 7 8 9] Parent 2: [9 3 7 8 2 6 5 1 4] Please check the slides. 4. Use genetic algorithm to find max x 2 over {0,1,…,31}. Please fill out the following tables. (20 points) Initial:
After cross-over: (assuming the crossover point is 3)
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help