Presentation is loading. Please wait.

Presentation is loading. Please wait.

 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent.

Similar presentations


Presentation on theme: " Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent."— Presentation transcript:

1

2  Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent or not.  What do you understand by a production system? What are the components of it? Discuss the different conflict resolution strategies used in production system.  A) What do you understand by CNF and DNF?  B) Explain the rule of modus ponen and modus tollen. Explain how they are used in every day life.  What do you understand by an Admissible Heuristic? Write the A* algorithm& using example show that A* search algorithm is Admissible.

3  What do you understand by mini-max search? Discuss the use of alpha & beta pruning in improving the mini-max search. Use suitable example.  What do you mean by Knowledge Acquisition? Explain knowledge acquisition strategies.  Define Expert system. What are its applications? Discuss the different stages of expert system development.  Explain Non-Production Architecture of Expert System.  Discuss the following: A) Beam search B) Best first search  What do you understand by Learning? Explain the learning as induction using suitable examples.

4  What do you understand by state space representation? Explain.  Differentiate between following: (A) Procedural knowledge and Declarative knowledge (B) Frame and Scripts  What is AI? Differentiate between AI Programming and conventional programming.  Explain the difference between forward chaining and backward chaining. Explain the factors that can be used to decide the direction of search.  Explain the following properties of search algorithms: (A) Monotonicity(B) Optimality (C) Informedness(D) Admissibility


Download ppt " Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent."

Similar presentations


Ads by Google