1.
In a genetic algorithm, a "chromosome" typically represents a:
(A) Single gene
(B) Possible solution to the problem
(C) Fitness value of an individual
(D) Random number
2. The process of selecting individuals from the current population to be
parents for the next generation is called:
(A) Crossover
(B) Mutation
(C) Selection
(D) Initialization
3. Which of the following is a common type of selection method in genetic
algorithms?
(A) Bubble Sort
(B) Tournament Selection
(C) Quick Sort
(D) Insertion Sort
4. The role of "mutation" in a genetic algorithm is primarily to:
(A) Combine genetic material from two parents
(B) Introduce diversity into the population
(C) Decrease the fitness of individuals
(D) Speed up convergence to a local optimum
5. A "fitness function" in a genetic algorithm is used to:
(A) Generate the initial population
(B) Evaluate the quality of a solution
(C) Determine the stopping criteria
(D) Perform crossover operations
6. Which of these is a potential drawback of genetic algorithms?
(A) They are always guaranteed to find the global optimum
(B) They can be computationally expensive for complex problems
(C) They require very little problem-specific knowledge
(D) They are only applicable to binary encoding
7. The initial population in a genetic algorithm is typically generated:
(A) Manually by the user
(B) Randomly
(C) Based on previous best solutions
(D) By applying the fitness function
8. If a genetic algorithm gets stuck in a local optimum, it means:
(A) It has found the best possible solution
(B) It has converged to a sub-optimal solution that is better than its
neighbors
(C) The population diversity is too high
(D) The mutation rate is too high
9. Genetic algorithm is a
(A) Search technique used in computing to find true or approximate solution
to optimization and search problem
(B) Sorting technique used in computing to find true or approximate solution
to optimization and sort problem
(C) Both A & B
(D) None of these
10. When would the genetic algorithm terminate?
(A) Maximum number of generations has been produced
(B) Satisfactory fitness level has been reached for the population.
(C) Both A & B
(D) None of these
11. Genetic operators includes
(A) Crossover
(B) Mutation
(C) Both A & B
(D) None of these
12. Produces two new offspring from two parent string by copying selected
bits from each parent is called
(A) Mutation
(B) Inheritance
(C) Crossover
(D) None of these
13. What is the primary purpose of the 'crossover' operation in a genetic
algorithm?
(A) To introduce random changes to the chromosome.
(B) To select the fittest individuals for the next generation.
(C) To combine genetic material from two parent chromosomes to create
offspring.
(D) To evaluate the quality of a potential solution.
14. Which of the following best describes the 'fitness function' in a genetic
algorithm?
(A) A function that determines the mutation rate.
(B) A function that measures the performance or quality of a candidate
solution.
(C) A function that generates the initial population.
(D) A function that controls the termination condition of the algorithm.
15. What is the typical encoding method for chromosomes in many genetic
algorithms?
(A) Decimal strings
(B) Binary strings (sequence of 0s and 1s)
(C) Text-based descriptions
(D) Graphical representations
16. The concept of 'survival of the fittest' in genetic algorithms is primarily
implemented through which operation?
(A) Mutation
(B) Crossover
(C) Initialization
(D) Selection
17. Which of the following is NOT a common application area for genetic
algorithms?
(A) Optimization problems
(B) Machine learning (e.g., neural network training)
(C) Predicting precise weather conditions over a short period with high
accuracy.
(D) Scheduling and logistics
18. What is a 'generation' in the context of a genetic algorithm?
(A) A single individual in the population.
(B) The entire set of operations (selection, crossover, mutation) applied once
to produce a new population.
(C) The initial population of solutions.
(D) The final, optimal solution found by the algorithm.
19. The number of individuals in a genetic algorithm's population is often
referred to as the:
(A) Gene pool
(B) Population size
(C) Chromosome length
(D) Generation count
1. (B) Possible solution to the problem
2. (C) Selection
3. (B) Tournament Selection
4. (B) Introduce diversity into the population
5. (B) Evaluate the quality of a solution
6. (B) They can be computationally expensive for complex problems
7. (B) Randomly
8. (B) It has converged to a sub-optimal solution that is better than
its neighbors
9. (A) Search technique used in computing to find true or
approximate solution to optimization and search problem
10.(C) Both A & B
11.(C) Both A & B
12.(C) Crossover
13.(C) To combine genetic material from two parent chromosomes to
create offspring.
14.(B) A function that measures the performance or quality of a
candidate solution.
15.(B) Binary strings (sequence of 0s and 1s)
16.(D) Selection
17.(C) Predicting precise weather conditions over a short period with
high accuracy.
18.(B) The entire set of operations (selection, crossover, mutation)
applied once to produce a new population.
19.(B) Population size
