[go: up one dir, main page]

0% found this document useful (0 votes)
118 views5 pages

High Level MCQ Genetic Algorithms

The document contains multiple-choice questions (MCQs) focused on Genetic Algorithms, covering key concepts such as inspiration, population representation, fitness functions, crossover and mutation operators, and selection processes. It also discusses the significance of mutation, stopping criteria, and real-world applications of Genetic Algorithms. Each question is followed by the correct answer, providing a comprehensive overview of the fundamental principles of Genetic Algorithms.

Uploaded by

manaspateell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
118 views5 pages

High Level MCQ Genetic Algorithms

The document contains multiple-choice questions (MCQs) focused on Genetic Algorithms, covering key concepts such as inspiration, population representation, fitness functions, crossover and mutation operators, and selection processes. It also discusses the significance of mutation, stopping criteria, and real-world applications of Genetic Algorithms. Each question is followed by the correct answer, providing a comprehensive overview of the fundamental principles of Genetic Algorithms.

Uploaded by

manaspateell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

High-Level MCQs on Genetic Algorithms

1. What is the primary inspiration behind Genetic Algorithms?

 A. Artificial Intelligence systems


 B. Quantum theory
 C. Principles of natural selection and genetics
 D. Neural networks

Answer: C

2. What does a population represent in a Genetic Algorithm?

 A. The output space


 B. A set of problems to solve
 C. A group of potential solutions
 D. A mutation history

Answer: C

3. What is the purpose of the fitness function in a Genetic Algorithm?

 A. Selects random genes


 B. Evaluates how good a solution is
 C. Generates crossover points
 D. Controls mutation rate

Answer: B

4. Which operator in a Genetic Algorithm is responsible for combining genetic material from
two parents?

 A. Selection
 B. Mutation
 C. Crossover
 D. Evaluation

Answer: C
5. What does the mutation operator do in Genetic Algorithms?

 A. Replicates parents directly


 B. Combines solutions
 C. Introduces random changes to genes
 D. Evaluates solution quality

Answer: C

6. Which of the following is NOT a valid crossover method in Genetic Algorithms?

 A. Single-point
 B. Two-point
 C. Circular crossover
 D. Uniform crossover

Answer: C

7. What happens during single-point crossover?

 A. One offspring is created from one parent


 B. Genetic material is swapped randomly
 C. A single crossover point is chosen to split and swap genes
 D. Two random solutions are deleted

Answer: C

8. In uniform crossover, how are genes selected for the offspring?

 A. By averaging parent values


 B. By choosing a fixed point
 C. Randomly from each parent based on a probability
 D. From the fittest parent only

Answer: C

9. What is the main purpose of selection in a Genetic Algorithm?


 A. Generate random chromosomes
 B. Choose best-performing individuals for reproduction
 C. Apply crossover
 D. Delete unfit individuals

Answer: B

10. What does the ‘expectation value’ of a member represent?

 A. The likelihood of mutation


 B. How long the algorithm will run
 C. The chance of being selected for reproduction
 D. The complexity of the solution

Answer: C

11. Why is mutation important in Genetic Algorithms?

 A. It always improves fitness


 B. It simplifies computation
 C. It helps maintain diversity and avoids local minima
 D. It replaces crossover

Answer: C

12. What is a chromosome in the context of Genetic Algorithms?

 A. A mathematical equation
 B. A set of parameters representing a solution
 C. A neural node
 D. A biological sequence

Answer: B

13. Which of the following is a valid stopping criterion in Genetic Algorithms?

 A. All members are identical


 B. Optimal solution found or max iterations reached
 C. Population is randomly shuffled
 D. Only one parent remains

Answer: B

14. What does crossover achieve in the algorithm?

 A. Terminates bad solutions


 B. Narrows the search space
 C. Mixes traits from two solutions to generate new ones
 D. Evaluates population fitness

Answer: C

15. In Genetic Algorithms, what is formed after crossover and mutation?

 A. Clone
 B. Child or offspring
 C. Fitness map
 D. Generation marker

Answer: B

16. How does selection bias affect Genetic Algorithms?

 A. It reduces the number of generations


 B. It ensures poor solutions are preserved
 C. It favors fitter individuals for reproduction
 D. It forces premature termination

Answer: C

17. What does a high fitness score indicate in a candidate solution?

 A. Low likelihood of survival


 B. Poor optimization
 C. Strong performance in solving the problem
 D. Random mutation
Answer: C

18. In two-point crossover, what occurs?

 A. A single gene is changed randomly


 B. Two parents are averaged
 C. A segment between two points is swapped
 D. Genes are selected from a pool

Answer: C

19. What is the result of repeating selection, crossover, and mutation across generations?

 A. Increasing population size


 B. Convergence toward optimal solution
 C. Shrinking solution space
 D. Decreasing fitness

Answer: B

20. Which of the following is a real-world application of Genetic Algorithms?

 A. Spreadsheet formatting
 B. Genetic therapy
 C. Route optimization and machine learning
 D. Text summarization

Answer: C

You might also like