Scribd
Upload
86 views

Sample Questions

The document provides 9 scenarios to solve using various problem solving and artificial intelligence techniques like search algorithms, genetic algorithms, and logical reasoning. For each scenario, it asks to: 1) Represent the problem as a search space and determine the appropriate search method 2) Define an admissible heuristic and generate an A* search tree 3) Show the steps of solving a linear equation using genetic algorithm 4) Apply logical reasoning techniques like forward and backward chaining to answer questions about student course preferences

Uploaded by

shaharukh786
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
86 views

Sample Questions

The document provides 9 scenarios to solve using various problem solving and artificial intelligence techniques like search algorithms, genetic algorithms, and logical reasoning. For each scenario, it asks to: 1) Represent the problem as a search space and determine the appropriate search method 2) Define an admissible heuristic and generate an A* search tree 3) Show the steps of solving a linear equation using genetic algorithm 4) Apply logical reasoning techniques like forward and backward chaining to answer questions about student course preferences

Uploaded by

shaharukh786
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1. Answer the below question for the given scenarios.

2.
3.

4.
5. A. Provide one point for and against Turing Test to determine if a software piece is
intelligent.
B. For questions (i) and (ii), answer if forward search (data driven search) or backward search
(goal driven search) will be more appropriate with one good reason for the scenarios given:
(i) You have met a person Dr. Rajiv who claims to be your distant cousin. You need to verify
his claim by finding some common ancestor who is a few generations older.
(ii) A system that will help human to classify plants by species

6. A farmer with his wolf, goat, and cabbage come to the edge of a river they wish to cross.
There is a boat at the river’s edge, but, of course, only the farmer can row. The boat also can
carry only two things (including the rower) at a time. If the wolf is ever left alone with the
goat, the wolf will eat the goat; similarly, if the goat is left alone with the cabbage, the goat
will eat the cabbage. Devise a sequence of crossings of the river so that all four characters
arrive safely on the other side of the river.
(A) Devise a concise representation of a state (considering all possible uses of this in search
algorithms taught to you). As per the representation devised provide write down the
representation of a start state and the goal state
(B) Which of DFS or BFS is most preferred for this problem? Why.
7. The sliding-tile puzzle consists of three black tiles, three white tiles, and an empty space in
some order. The goal is to arrive at the goal configuration shown below by legal moves [B-
Black tile, W-White tile].

The puzzle has two legal moves with associated costs Move #1: A tile may move into an
adjacent empty location. This has a cost of 1. Move #2: A tile can hopover one or two other
tiles into the empty position. This has a cost equal to the number of tiles jumped over

a. What are measures using which the complexity of a state space can be measured. List
each of them and provide the corresponding expression / value for this problem.
b. Write down an admissible heuristic function h(n) for this problem with a formal
description. Explain why this proposed heuristic is admissible.
c. Generate the A* search tree (using tree search) starting with the following start state for
depth up to 3 or until the goal state is reached, whichever is earlier.

d. Argue formally the optimality of the solution obtained.


e. Will the solution obtained be different if the heuristic is also consistent in addition to
being admissible. Why or why not?

8. You have been asked to solve below linear equation problem with multiple variables:
2a + 7b -5c +d = 0
where a, b,c, and d are integers in the range [-20,20] (equation can have more than one
solution) You have decided to solve this question using genetic algorithm. Show all the steps
involved in solving this using Genetic Algorithm. Number each of your steps, and provide
appropriate title to those steps. (No need to get the final solution, just the first iteration of
each step involved in the algorithm).

9. Consider the following statements.

All courses offered are interesting


Students like easy to score courses
Data Mining is a Compute Science course
Some of the easy courses are interesting
All Math are interesting course
Statistics is a math course
All computer science course are easy

Apply forward and backward chaining for below:

Q1: Do students like statistics?


Q2: What course does students like?

You might also like