Categories
Important question

IT8601 Important Questions Computational Intelligence Regulation 2017 Anna University

IT8601 Important Questions Computational Intelligence

IT8601 Important Questions Computational Intelligence Regulation 2017 Anna University free download. Computational Intelligence Important Questions IT8601 pdf free download.

Sample IT8601 Important Questions Computational Intelligence

1 Describe informed search strategies with an example. (13)
BTL1
Remembering
2
List the advantages and limitations of Genetic Algorithm. State the taxonomy of the crossover operator. (13)
IT8601 Important Questions Computational Intelligence
3 Define A* search algorithm. Discuss about the admissibility of A* algorithm. (13)
BTL1
Remembering
4
List and describe the problem characteristics that need to be considered for selecting appropriate heuristics for a given class of problems. (13)
BTL1
Remembering
5 (i) Distinguish A* and AO * algorithm with each other. (6)

Demonstrate why some times unnecessary backward propagation occurs in AND OR graph. (7)
6
Infer in details about Rule Based Systems with some examples. (13)
IT8601 Important Questions Computational Intelligence
7 i. Give the characteristics of AI problems? Explain with example (7) ii.Express what is Control Strategy and Production System? How this is helpful in AI (6)
BTL2
Understanding
8
Write short notes on Expert system tools and expert system shell. (13)
BTL3
Applying
9
How is AI useful in game playing techniques. Describe what is adversarial search? (13)
BTL3
Applying
10
i. Illustrate the role of knowledge engineer, domain expert and an end user in an expert system. (6)
ii.Explain the difficulties involved in developing an expert system. (7)
IT8601 Important Questions Computational Intelligence
Point out the procedures of genetic algorithms and what are the different genetic representations
BTL4
Analyzing
12
(i) Infer what is alpha beta pruning / search. (7) (ii) Explain MINIMAX search technique / algorithm with an example.(6)
BTL4
Analyzing
13 Draw the state space graph of Hill climbing search. What are the draw backs of this algorithm? Also discuss about time space complexity of this algorithm (13)
IT8601 Important Questions Computational Intelligence
Consider the block world problem with four blocks A,B,C,D with the start and goal states given below,

Subject name Computational Intelligence
Short Name CI
Semester 6
Subject Code IT8601
Regulation 2017 regulation

IT8601 Important Questions Computational Intelligence Click Here To Download 

IT8601 Computational Intelligence Syllabus


IT8601 Computational Intelligence Notes


IT8601 Computational Intelligence Question Bank

Leave a Reply

Your email address will not be published. Required fields are marked *