Artificial Intelligence Concepts and Techniques Week 3 Answers
Are you looking for Artificial Intelligence Concepts and Techniques Week 3 Answers? You’ve come to the right place! Access the latest and most accurate solutions for your Week 3 assignment in the Artificial Intelligence Concepts and Techniques course.
Table of Contents
Artificial Intelligence Concepts and Techniques Week 3 Answers (July-Dec 2025)
Nptel Course link: Click here
Question 1. In game playing, the “minimax” algorithm is used to
a) Find the optimal move for a single player
b) Find the optimal move for a multi-player game by considering all possible outcomes
c) Determine the complexity of a game
d) Prune the search tree to reduce computational cost
Question 2. What is the main goal of “alpha-beta pruning” in game-tree search?
a) To expand the search tree as much as possible
b) To avoid exploring branches that are guaranteed to be suboptimal
c) To increase the branching factor of the game tree
d) To guarantee finding the optimal solution
Question 3. In many problems, the path to the goal is irrelevant, and the focus is solely on finding a goal state. This class of problems can be solved using
a) Informed search techniques
b) Uninformed search techniques
c) Local search techniques
d) Informed and uninformed search techniques
Question 4. Which phase of a genetic algorithm involves the creation of new individuals for the next generation?
a) Evolution
b) Crossover
c) Mutation
d) Reproduction
Question 5. Which of the following is a key characteristic of genetic algorithms?
a) They are deterministic algorithms
b) They are population-based algorithms
c) They always guarantee the optimal solution
d) They are typically used for small, well-defined problems
Question 6. In Genetic Programming, what does a “chromosome” typically represent?
a) A single instruction within a program
b) The entire program or solution structure
c) A parameter value in the program
d) The fitness score of a program
Question 7. Mutation in a genetic algorithm is used to:
a) Introduce diversity and prevent premature convergence
b) Select the best individuals from a population
c) Combine genetic information from parents
d) Evaluate the quality of a solution
Question 8. In Simulated Annealing, the “cooling schedule” refers to:
a) The rate at which the temperature parameter decreases
b) The method of generating new candidate solutions
c) The criteria for accepting or rejecting a new solution
d) The way the algorithm initializes the solution
Question 9. In Simulated Annealing, the probability of accepting a worse solution is
a) Always zero
b) Proportional to the temperature parameter
c) Inversely proportional to the temperature parameter
d) Determined by a fixed threshold
Question 10. What is a “tabu list” in Tabu Search?
a) A list of optimal solutions found so far
b) A list of aspiration criteria for accepting tabu moves
c) A list of parameters for the neighborhood function
d) A list of forbidden moves or previously visited solutions to prevent cycling
Click here to see all courses Nptel Assignment Answers
These are Artificial Intelligence Concepts and Techniques Week 3 Answers