Artificial intelligence

Which of the following best defines the Turing Test?

(i) A method to calculate machine efficiency
(ii) A test for machine learning algorithms
(iii) A test to determine if a machine can exhibit human-like intelligence
(iv) A benchmark for robotic speed

What is meant by Turing test?

The Turing Test was proposed by

(i) John McCarthy
(ii) Alan Turing
(iii) Marvin Minsky
(iv) Herbert Simon

Mention the criteria for the evaluation of search strategy.

What is artificial intelligence?

(i) Putting your intelligence into computer
(ii) Programming with your own intelligence
(iii) Making a machine intelligent
(iv) Playing a game

The $A^*$ algorithm guarantees optimality if the heuristic used is:

(i) Arbitrary
(ii) Inconsistent
(iii) Admissible and consistent
(iv) Random

Weak AI is also known as

(i) Narrow AI
(ii) General AI
(iii) Strong AI
(iv) Super AI

What are the two types of memory bounded heuristic algorithms?

Which is the best way to go for game playing problem?

(i) Linear approach
(ii) Heuristic approach (some knowledge is stored)
(iii) Random approach
(iv) An optimal approach

Which of these search strategies is not complete in infinite-depth spaces?

(i) Breadth-First Search
(ii) Depth-First Search
(iii) DFID
(iv) $A^*$ Search

Breadth First Search is an example of

(i) Informed Search
(ii) Uninformed Search
(iii) Heuristic Search
(iv) Local Search

Which algorithm is optimal and complete?

(i) Depth First Search
(ii) Hill Climbing
(iii) A* Search
(iv) Simulated Annealing

In an AND/OR graph, solving an AND node means:

(i) Solving one child node is enough
(ii) All child nodes must be solved
(iii) The node is ignored
(iv) Any node can be skipped

Which is the best way to go for game playing problem?

(i) Linear approach
(ii) Heuristic approach (some knowledges are stored)
(iii) Random approach
(iv) An optimal approach

Minimax is used in game playing to:

(i) Maximize randomness
(ii) Minimize evaluation time
(iii) Make optimal moves assuming the opponent plays optimally
(iv) Store all possible states

Heuristic function h(n) is used in

(i) Random Search
(ii) Brute Force Search
(iii) Uninformed Search
(iv) Informed Search

Alpha-beta pruning improves Minimax by:

(i) Increasing the depth
(ii) Ignoring non-optimal branches
(iii) Doubling the search time
(iv) Reducing the score of nodes

AO* algorithm is used for solving

(i) AND-OR graphs
(ii) Game trees
(iii) Decision trees
(iv) Neural networks

Constraint Satisfaction Problems are usually solved using

(i) Backtracking
(ii) Breadth First Search
(iii) A* Search
(iv) Alpha-Beta Pruning

Which search strategy is also called as blind search?

(i) Uniformed search
(ii) Informed search
(iii) Simple reflex search
(iv) All of the mentioned

Which of the following is a stochastic search method?

(i) Breadth First Search
(ii) Particle Swarm Optimization
(iii) Depth First Search
(iv) A* Search

Which is used for utility functions in game playing algorithm?

(i) Linear polynomial
(ii) Weighted polynomial
(iii) Polynomial
(iv) Linear weighted polynomial

Explain what you understand by Artificial Intelligence. Describe the Turing Test in detail and discuss its significance in the field of AI.

A chatbot consistently passes the Turing Test during short conversations but fails at longer ones. What does this imply about the limitations of the test? Suggest an enhancement to the test.

Discuss the applications area of Artificial Intelligence.

Define Artificial Intelligence (AI). Discuss the applications area of AI.

Explain AO algorithm with an example.*

Explain how an agent's architecture affects its ability to operate in a partially observable, stochastic environment. Provide a practical example.

Explain the concept of Rational Agents. How do they differ from Reflex Agents?

What are agents in AI? How do agents work to import intelligence to a system? Classify the different types of agents and briefly discuss their properties.

Show that Hill Climbing can get stuck in local maxima, plateaus, and ridges. Suggest at least two variations or techniques to overcome these issues and explain how they help.

Evaluate the impact of AI on employment and society.

Describe constraint satisfaction problem in detail.

Heuristics are designed to guide search algorithms efficiently, but they can sometimes mislead the search. Describe a situation in which A search performs worse than an uninformed search due to a poorly chosen heuristic.*

Explain Breadth First Search and Depth First Search with examples.

Describe the role of heuristics in A* algorithm.

Define a basic Constraint Satisfaction Problem (CSP) involving three variables and solve it using backtracking. Also explain the role of domain and constraints.

Describe how Particle Swarm Optimization (PSO) works with a simple analogy (e.g., birds flocking). Show how particles update their positions and velocities.

"A* algorithm is the best search technique." Do you agree? Justify your answer with reasoning.

Explain hill climbing algorithm. Explain plateau, ridge, and local maxima.

Create a simple two-player game tree (3 levels) and show how the Minimax algorithm selects the best move for the maximizing player.

Describe Alpha-Beta Pruning. Why is it used in game playing?

Describe the working of simulated annealing with suitable example.

Explain AO* algorithm and how it differs from A* algorithm.

Write short notes on the following:

Intelligence

What is the meaning of the word 'Heuristics' in the context of search strategies? What conditions on A search is required to guarantee completeness and optimality? Prove admissibility of A search strategy.**

Consider the Water Jug problem as stated here. "You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a pump that can be used to fill the jugs with water. How can you get exactly 2 gallons of water into the 4-gallon jug?" Represent this as a problem in State Space Search and state its Production Rules. Show at least one solution to this problem.

What is the Turing test? If the machine passes the Turing test, does it mean that the system is intelligent? What are the associated problems with Turing test? What are required improvement/advances to overcome these problems?