# ARTIFICIAL INTELLIGENCE AKTU 2020-21 Question Paper

## B.Tech

### ARTIFICIAL INTELLIGENCE

[Time: 3:00 Hours] Total Marks: 70

Note: Attempt all Sections. If require any missing data: then choose suitably.

### SECTION-A

1. Attempt all questions in brief.                                                                                 2 x 7 = 14
1. What is heuristic function?
2. Write the difference between supervised and unsupervised learning.
3. List down the characteristics of agent.
4. List some of the uniform search technique.
5. Differentiate between forward and backward chaining.
6. What is bay’s rule?
7. Define reinforcement learning.

### SECTION-B

2. Attempt any three questions in brief.                                                                     7 x 3 = 21

1. Explain DFS algorithm with suitable example.
2. Define a well-formed formula(wff) and List some of the rules of inference.
3. What are Statistical learning models? Show with suitable example.
4. Define PCA. Differentiate between Principle Component  Analysis (PCA) and Linear Discriminant Analysis (LDA).
5. Explain state space approach for solving any AI problem.

### SECTION – C

3. Attempt any one part of the following:                                                                                           7 x 1 = 7

1. Describe the four categories under which AI is classified with examples.
2. List various components of natural language understanding process. Describe syntactic analysis and semantic analysis in brief.

4. Attempt any one part of the following:                                                                                           7 x 1 = 7

1. Explain Alpha-Beta pruning? Solve the following question-

2. Discuss Constraint Satisfaction problem with an algorithm for solving a Cryptarithmetic problem.

5. Attempt any one part of the following:                                                                                           7 x 1 = 7

1. Explain resolution in predicate logic with suitable example.
2. Trace the operation  of the unification algorithm on each of the following pairs of literals:
• f(Marcus) and f(Caesar)
• f(x) and f(g(y))
• f(Marcus, g(x,y)) and f(x,g(Caesar, Marcus)).

6. Attempt any one part of the following:                                                                                           7 x 1 = 7

1. Define decision tree? Explain it’s with suitable example.
2. How can use Expectation-Maximization (EM Algorithm) in machine learning? Explain with appropriate example.

7. Attempt any one part of the following:                                                                                           7 x 1 = 7

1. Give the block diagram of pattern recognition system. Explain in brief.
2. What do you mean by support vector machine (SVM)? Explain in detail with suitable example.