Year Major Subject Code Unit Chapter Section Question Type

2022 UG03 191CSV78 3 1 A Objective

2022 UG03 191CSV78 3 1 A Objective
2022 UG03 191CSV78 3 1 A Objective
2022 UG03 191CSV78 3 2 A Objective
2022 UG03 191CSV78 3 2 A Objective
2022 UG03 191CSV78 3 2 A Objective
2022 UG03 191CSV78 3 3 A Objective
2022 UG03 191CSV78 3 3 A Objective
2022 UG03 191CSV78 3 3 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 4 A Objective
2022 UG03 191CSV78 3 5 A Objective
2022 UG03 191CSV78 3 5 A Objective
2022 UG03 191CSV78 3 5 A Objective
2022 UG03 191CSV78 3 5 A Objective
2022 UG03 191CSV78 3 5 A Objective
2022 UG03 191CSV78 3 6 A Objective
2022 UG03 191CSV78 3 6 A Objective
2022 UG03 191CSV78 3 6 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 7 A Objective
2022 UG03 191CSV78 3 1 A Objective
2022 UG03 191CSV78 3 5 Objective
2022 UG03 191CSV78 3 6 Objective
2022 UG03 191CSV78 3 6 Objective
2022 UG03 191CSV78 3 7 Objective
2022 UG03 191CSV78 3 1 Descriptive
2022 UG03 191CSV78 3 1 Descriptive
2022 UG03 191CSV78 3 2 Descriptive
2022 UG03 191CSV78 3 2 Descriptive
2022 UG03 191CSV78 3 3 Descriptive
2022 UG03 191CSV78 3 3 Descriptive
2022 UG03 191CSV78 3 4 Descriptive
2022 UG03 191CSV78 3 5 Descriptive
2022 UG03 191CSV78 3 5 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
2022 UG03 191CSV78 3 6 Descriptive
 BTLevel COs Difficulty Level
Remember CO3 Easy
Understanding Moderate
Remember Easy
Understanding Moderate
Understanding Easy
Remember Moderate
Remember Moderate
Understanding Moderate
Remember Moderate
Understanding Moderate
Remember Difficult
Understanding Moderate
Understanding Moderate
Remember Easy
Understanding Moderate
Remember Moderate
Remember Easy
Understanding Moderate
Understanding Difficult
Understanding Moderate
Remember Difficult
Remember Moderate
Understanding Moderate
Remember Difficult
Analysis Difficult
Understanding Easy
Understanding Moderate
Understanding Difficult
Understanding Easy
Understanding Moderate
Understanding Easy
Understanding Moderate
Understanding Moderate
Understanding Easy
Understanding Moderate
Analysis Easy
Remember Difficult
Understanding Difficult
Analysis Moderate
Understanding Moderate
Remember Difficult
Analysis Difficult
Understanding Difficult
 Remember Moderate
Understanding Moderate
Analysis Easy
Understanding Moderate
Understanding Difficult
Remember Difficult
Understanding Difficult
Analysis Moderate
 Question
What is the primary function of chromosome encoding in genetic algorithms?
Which of the following is a common method for population initialization in genetic algorit
What is the main objective of the selection process in genetic algorithms?
Which method is commonly used in genetic algorithms for selecting individuals based on the
Which of the following is an example of an evaluation function in genetic algorithms?
What is the role of crossover in genetic algorithms?
Which of the following is a common type of crossover operator in genetic algorithms?
What does mutation do in genetic algorithms?
Which of the following is an example of a mutation operation?
What is the fitness function in genetic algorithms?
Which of the following is true for a maximizing fitness function?
Which method is used to evaluate the fitness of a chromosome in a genetic algorithm?
In a binary encoding scheme, what does each chromosome represent?
What is elitism in the context of genetic algorithms?
Which of the following is a common chromosome encoding scheme?
What does a fitness landscape represent in genetic algorithms?
Which of the following can help prevent premature convergence in genetic algorithms?
In genetic algorithms, what is the primary goal of the crossover operation?
What is the purpose of using a selection mechanism in genetic algorithms?
What is the significance of maintaining genetic diversity in a population?
What does a fitness proportionate selection method in genetic algorithms refer to?
What does a one-point crossover do?
Which mutation rate is typically considered optimal in genetic algorithms?
Which operator helps genetic algorithms explore the solution space by randomly changing
What is the primary goal of maximizing functions in genetic algorithms?
Which crossover method involves exchanging segments of genes between parents?
Which technique is used to simulate natural evolution in genetic algorithms?
Which method of crossover generates two offspring from two parents by exchanging geneti
. Which genetic algorithm operator randomly alters a part of the chromosome?
What is chromosome encoding in genetic algorithms?
Which of the following is an example of a selection method in genetic algorithms?
What is the role of the evaluation function in genetic algorithms?
Mutation in genetic algorithms is used to:
The fitness function in genetic algorithms is used to:
In genetic algorithms, which function is used to evaluate the performance of a solution?
Which method of selection is based on a series of comparisons among individual
Describe chromosome encoding schemes-population initialization and selection methods-evaluation function-genetic ope
Explain Gray encoding in genetic algorithms. How does it differ from binary encoding, and in what situations is it preferabl
5. How does the concept of elitism work in genetic algorithms, and what benefits does it bring during the selection proce
Explain how the population initialization process works in genetic algorithms. What is the importance of a good initializatio
Describe the role of a fitness function in guiding the genetic algorithm. How does the fitness function impact the search fo
Explain the concept of crossover in genetic algorithms. How does it combine genetic material from two parent chromosom
Describe how a mutation operation is applied in genetic algorithms. What effect does it have on the search space explorati
Explain how a fitness function can be designed to solve an optimization problem. Discuss the factors that influence the des
In a maximization problem, how is the fitness function used to guide the search for an optimal solution in genetic algorithm
Explain Gray encoding in genetic algorithms. How does it differ from binary encoding, and in what situations is it preferabl
What are the challenges associated with choosing the appropriate chromosome encoding scheme for a genetic algorithm?
Explain different types of chromosome encoding schemes used in genetic algorithms. Compare and contrast binary, decim
In the context of genetic algorithms, explain the concept of indirect encoding. How does it differ from direct encoding? Dis
Describe the process of encoding a solution for the traveling salesman problem using different chromosome encoding sche
Explain the process of population initialization in genetic algorithms. Discuss the advantages and disadvantages of random
What role does diversity play in population initialization and selection? Discuss the potential problems that can arise from
Design a fitness evaluation function for a genetic algorithm solving a scheduling problem. Discuss how the function can be
How do you evaluate the quality of a fitness function in the context of genetic algorithms? Discuss the key factors that infl
Describe the process of hybridization in genetic algorithms, combining multiple genetic operators. Discuss how this approa
Critically evaluate the impact of crossover and mutation rates on the performance of genetic algorithms. How can the rate
Discuss the different mutation techniques used in genetic algorithms, such as bit-flip mutation, Gaussian mutation, and un
Design a fitness function for an evolutionary algorithm solving a knapsack problem. Explain how the function should be str
Compare the strategies used in maximizing functions in evolutionary algorithms. How does a genetic algorithm differ from
Discuss the application of genetic algorithms in real-time optimization problems. How do constraints like time and comput
Explain how genetic algorithms can be combined with machine learning techniques to solve complex real-world problems.
 Answer A
a) To represent a solution
A) Random generation
A) To choose parents based on their fitness
A) Tournament selection
A) A function that calculates the fitness of an individual
A) To generate offspring by combining parts of two parent ch
A) One-point crossover
A) Alters a chromosome to maintain diversity in the population
A) Flipping a bit in a binary chromosome
A) A function that evaluates how close a solution is to the opti
A) It rewards individuals with lower fitness scores
A) By calculating its cost or error
A) A sequence of random numbers
A) Selecting the best individual to always survive to the next g
A) Binary encoding
A) The genetic distance between chromosomes
A) High mutation rate
A) To generate genetic diversity by combining parents
A) To determine the fittest individuals for reproduction
A) It helps prevent premature convergence
A) The probability of selection is proportional to an individual's
A) Swaps parts of two parents chromosomes at a single crossov
A) A very high mutation rate
A) Crossover
A) To find the highest fitness values
A) One-point crossover
A) Mutation, crossover, and selection
A) One-point crossover
A) Mutation
a) A method to encode the fitness of the solution
a) Tournament selection
a) To determine the fitness of a solution
a) Increase population size
a) Measure how good a solution is
a) Fitness function
a) Roulette wheel
ods-evaluation function-genetic operators- cross over- mutation- fitness function -maximizing function need 1 mark 40 MCQ with answ
and in what situations is it preferable?
es it bring during the selection process?
he importance of a good initialization strategy?
tness function impact the search for an optimal solution?
aterial from two parent chromosomes to produce offspring?
t have on the search space exploration?
 ss the factors that influence the design of a fitness function.
optimal solution in genetic algorithms?
and in what situations is it preferable?
ing scheme for a genetic algorithm? Provide examples.
Compare and contrast binary, decimal, and gray encoding with respect to their advantages and disadvantages.
es it differ from direct encoding? Discuss its application and advantages in complex problem-solving.
different chromosome encoding schemes. Explain the impact of each encoding type on the efficiency and outcome of the genetic algor
tages and disadvantages of random initialization versus using domain knowledge to initialize the population
ential problems that can arise from lack of diversity in the population and how they can be mitigated.
m. Discuss how the function can be structured to guide the algorithm toward optimal or near-optimal solutions.
ms? Discuss the key factors that influence the design of a good fitness function and how it impacts the algorithm’s efficiency.
c operators. Discuss how this approach can improve the overall performance of the algorithm.
enetic algorithms. How can the rates be dynamically adjusted during the search process for optimal results?
mutation, Gaussian mutation, and uniform mutation. Compare their impacts on convergence and exploration.
plain how the function should be structured to accurately reflect the solution quality.
does a genetic algorithm differ from other evolutionary methods like simulated annealing or particle swarm optimization when applied
do constraints like time and computational resources affect the design and performance of genetic algorithms?
solve complex real-world problems. Discuss the benefits and challenges of this hybrid approach.
 Answer B Answer C
b) To store the fitness value c) To initialize the population
B) Fitness-based initialization C) Crossover-based initializati
B) To increase the mutation rate C) To perform crossover
B) Roulette wheel selection C) Rank selection
B) A function that performs crossover C) A function that initializes t
B) To evaluate the fitness of individuals C) To select individuals based o
B) Two-point crossover C) Uniform crossover
B) Combines two chromosomes C) Evaluates the fitness of indi
B) Swapping genes between two chromosomes C) Randomly generating a new
B) A function that generates random chromosome C) A function that mutates the
B) It rewards individuals with higher fitness score C) It does not affect the geneti
B) By its length C) By its genetic distance fro
B) A sequence of 0s and 1s representing a solutio C) A continuous function
B) Randomly generating new chromosomes C) Increasing the mutation rate
B) Real-valued encoding C) Permutation encoding
B) A graphical representation of the fitness of the C) The crossover points betwe
B) Elitism C) Low population size
B) To select the fittest individuals C) To eliminate the weakest ind
B) To create random mutations C) To combine genes from diffe
B) It speeds up convergence C) It ensures all individuals are
B) The selection is based on random probability C) All individuals have an equa
B) Swaps multiple points on the parents chromos C) Replaces one parent entirely
B) A very low mutation rate C) A moderate mutation rate
B) Selection C) Mutation
B) To minimize the search space C) To generate more random solut
B) Two-point crossover C) Uniform crossover
B) Random generation of solutions C) Linear programming
B) Single-point crossover C) Multiple-point crossover
B) Selection C) Crossover
b) A representation of a potential solution in the algori c) A function for evaluating solutio
b) Crossover c) Mutation
b) To perform crossover c) To initialize the population
b) Introduce small random changes to a chromosome c) Select the fittest chromosomes
b) Perform crossover and mutation c) Initialize the population
b) Crossover function c) Mutation function
b) Tournament selection c) Rank-based selection
ss function -maximizing function need 1 mark 40 MCQ with answers
t to their advantages and disadvantages.
es in complex problem-solving.
encoding type on the efficiency and outcome of the genetic algorithm.
knowledge to initialize the population
and how they can be mitigated.
toward optimal or near-optimal solutions.
function and how it impacts the algorithm’s efficiency.
mance of the algorithm.
the search process for optimal results?
pacts on convergence and exploration.
olution quality.
imulated annealing or particle swarm optimization when applied to maximization problems?
n and performance of genetic algorithms?
es of this hybrid approach.
 Correct ASSESSM
Answer D Mark EnteredBy
Answer ENT
d) To define the selection method A 1 TEST 2 B.MYTHILI
D) None of the above A 1 TEST 2 B.MYTHILI
D) To evaluate the fitness function A 1 TEST 2 B.MYTHILI
D) All of the above D 1 TEST 2 B.MYTHILI
D) A function that selects parents A 1 TEST 2 B.MYTHILI
D) To mutate the chromosomes A 1 TEST 2 B.MYTHILI
D) All of the above D 1 TEST 2 B.MYTHILI
D) Selects parents based on their fitness A 1 TEST 2 B.MYTHILI
D) Calculating the fitness score A 1 TEST 2 B.MYTHILI
D) A function that performs crossover A 1 TEST 2 B.MYTHILI
D) It requires selection based on random c B 1 TEST 2 B.MYTHILI
D) By random assignment A 1 TEST 2 B.MYTHILI
D) A collection of mutations B 1 TEST 2 B.MYTHILI
D) Selecting the worst individuals for elim A 1 TEST 2 B.MYTHILI
D) All of the above D 1 TEST 2 B.MYTHILI
D) A random search space B 1 TEST 2 B.MYTHILI
D) Using a fixed fitness function A 1 TEST 2 B.MYTHILI
D) To increase the population size A 1 TEST 2 B.MYTHILI
D) To perform crossover A 1 TEST 2 B.MYTHILI
D) It simplifies the evaluation function A 1 TEST 2 B.MYTHILI
D) It eliminates all low-fitness individuals A 1 TEST 2 B.MYTHILI
D) Randomly combines genes from two par A 1 TEST 2 B.MYTHILI
D) Mutation rate is irrelevant C 1 TEST 2 B.MYTHILI
D) Elitism C 1 TEST 2 B.MYTHILI
D) To avoid overfitting A 1 TEST 2 B.MYTHILI
D) All of the above D 1 TEST 2 B.MYTHILI
D) Gradient descent A 1 TEST 2 B.MYTHILI
D) Uniform crossover D 1 TEST 2 B.MYTHILI
D) Fitness function A 1 TEST 2 B.MYTHILI
d) A method for selecting parents B 1 TEST 2 B.MYTHILI
d) Fitness function A 1 TEST 2 B.MYTHILI
d) To mutate chromosomes A 1 TEST 2 B.MYTHILI
d) Combine two chromosomes B 1 TEST 2 B.MYTHILI
d) Select chromosomes for reproduction A 1 TEST 2 B.MYTHILI
d) Selection function A 1 TEST 2 B.MYTHILI
d) Random selection B 1 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
4 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI
12 TEST 2 B.MYTHILI