1. What does the crossover probability in Genetic Algorithms control?

A) How likely two parent solutions are to mutate
B) How likely two parent solutions are to combine their genes
C) The fitness level of offspring
D) The mutation rate of the genes

Correct Answer: B) How likely two parent solutions are to combine their genes

2. What happens if crossover is not applied in Genetic Algorithms?

A) Parents' genes remain unchanged in the next generation
B) Parents' genes mutate at a higher rate
C) Offspring have no genetic diversity
D) Parents' genes are completely replaced

Correct Answer: A) Parents' genes remain unchanged in the next generation

3. What is the usual range for crossover probability?

A) 0 to 0.5
B) 0 to 1
C) 0.5 to 1
D) 0.2 to 0.9

Correct Answer: B) 0 to 1

4. What does a high crossover probability promote in Genetic Algorithms?

A) Reduced mutation
B) Increased variety
C) Decreased diversity
D) Stable solutions

Correct Answer: B) Increased variety

5. What might happen if the crossover probability is set too high?

A) It could break apart well-performing solutions
B) It produces more identical offspring
C) It reduces mutation effects
D) It ensures only strong genes survive

Correct Answer: A) It could break apart well-performing solutions

6. Which crossover probability range is commonly used for Genetic Algorithms?

A) 0.6 to 0.9
B) 0.4 to 0.6
C) 0.3 to 0.7
D) 0.1 to 0.5

Correct Answer: A) 0.6 to 0.9

7. What does a low crossover probability tend to produce in a population?

A) Increased variety
B) More genetic mutations
C) Less variety
D) Faster evolution

Correct Answer: C) Less variety

8. What is important to balance with crossover probability in Genetic Algorithms?

A) Mutation rate
B) Population size
C) Fitness score
D) Selection method

Correct Answer: A) Mutation rate

9. How many pairs will undergo crossover if the probability is 0.8 and there are 10 pairs?

A) 2 pairs
B) 8 pairs
C) 10 pairs
D) 5 pairs

Correct Answer: B) 8 pairs

10. What does crossover probability ensure in Genetic Algorithms?

A) Every solution changes every generation
B) Some stability while allowing exploration
C) Rapid mutation rates
D) Complete uniformity in genes

Correct Answer: B) Some stability while allowing exploration