# 18CS71 Artificial Intelligence and Machine Learning Solutions

[wptelegram-join-channel]

### 18CS71 Artificial Intelligence and Machine Learning (AIML) Module wise Question Bank with Solutions

Here you can find the module-wise questions and solutions for 18CS71 Artificial Intelligence and Machine Learning.

## Module 1 – Introduction to Artificial Intelligence

1. What is Artificial Intelligence? List the fields that form the basis for AI.

2. List the task domains of AI. Explain why artificial intelligence is important?

3. What is Artificial Intelligence? List four things (steps) to build a system to solve a problem.

4. What are the 3 different ways of solving the Tic-Tac-Toe Problem applying AI? Show the improvements obtained from one over the other using better knowledge representation.

5. What is a Production System? List and explain production system classes or categories.

6. Explain the water Jug problem as a state-space search.

7. Explain problem characteristics in artificial Intelligence.

8. Define Control Strategy and requirements for good search strategy.

9. Define State Space Search. Explain in detail.

10. How do you define a problem as a state-space search, Explain.

12. Explain Depth-first search (DFS) with an example. List down the advantages and disadvantages.

13. What do you mean by heuristic and heuristic search? What are the advantages of Heuristic Search?

14. Write and explain Generate and Test algorithm.

15. Write and explain hill-climbing and steepest hill-climbing search algorithms in artificial intelligence.

16. Consider trying to solve the 8-puzzle instance is given below using Hill Climbing. Apply any heuristic function appropriate to the problem.

Start State

Goal State

17. What is the constraint satisfaction problem? Explain it.

18. Write and explain the Best first search algorithm with an example.

20. Explain Problem reduction techniques with a suitable example.

21. Write AO* algorithm and explain the steps in it. Mention the advantages and disadvantages of the AO* algorithm.

22. What is Means-Ends Analysis? Explain with an example.

23. A star Search Algorithm to Move from the start state to the final state 8 Puzzle Problem.

24. A* star Search Algorithm to move from start node A to final node J.

25. A star Search Algorithm to find cost-effective path start (source) node A to final (goal) node G.

## Module 2 – Concept Learning

1. Define Machine Learning. Explain with examples why machine learning is important.

2. Discuss some applications of machine learning with examples.

3. Explain different perspectives and issues in machine learning.

4. Define concept learning and discuss it with an example.

5. Explain the General-to-Specific Ordering of Hypotheses

6. Write the FIND-S algorithm and explain with an example given below

7. What are the key properties and complaints of the FIND-S algorithm?

8. Define Consistent Hypothesis and Version Space.

9. Write LIST-THEN-ELIMINATE algorithm.

10. Write the candidate elimination algorithm and illustrate with an example.

11. Write the final version space for the below-mentioned training examples using the candidate elimination algorithm.

Example – 1: Solution

Example – 2: Solution

Example – 3: Solution

Example – 4: Solution

Example – 5: Solution

12. Explain in detail the Inductive Bias of Candidate Elimination algorithm.

13. Explain FIND-S Algorithm Unanswered Questions.

## Module 3 – Decision Trees and Artificial Neural Networks

1. What are decision tree and decision tree learning? Explain the representation of the decision tree with an example.

2. What are appropriate problems for Decision tree learning?

3. Explain the concepts of Entropy and Information gain.

4. Describe the ID3 algorithm for decision tree learning with an example.

5. Give Decision trees to represent the Boolean Functions: – v

a) A && ~ B

b) A V [B && C]

c) A XOR B

d) [A&&B] V [C&&D]

6. Give Decision trees for the following set of training examples – v

7. Consider the following set of training examples. – v

8. Identify the entropy, information gain and draw the decision trees for the following set of training examples

9. Identify the entropy, information gain and draw the decision trees for the following set of training examples – v

10. Discuss Hypothesis Space Search in Decision tree Learning.

11. List and explain issues in learning decision trees.

12. What is Artificial Neural Network? Explain appropriate problems for Neural Network Learning with its characteristics.

13. Explain the single perceptron with its learning algorithm.

14. How a single perceptron can be used to represent the Boolean functions such as AND, OR gate.

16. Write Stochastic Gradient Descent algorithm for training a linear unit. Differentiate between Gradient Descent and Stochastic Gradient Descent

17. Write Stochastic Gradient Descent version of the Back Propagation algorithm for feedforward networks containing two layers of sigmoid units.

18. Derive the Back Propagation Rule for artificial neural networks.

## Module 4 – Baysian Learning

1. Define the Bayesian theorem? What are the relevance and features of the Bayesian theorem? Explain the practical difficulties of the Bayesian theorem.

2. Define is Maximum a Posteriori (MAP), Maximum Likelihood (ML) Hypothesis. Derive the relation for hMAP and hML using the Bayesian theorem. – v

3. Consider a medical diagnosis problem in which there are two alternative hypotheses: 1. that the patient has a particular form of cancer (+) and 2. That the patient does not (-). A patient takes a lab test and the result comes back positive. The test returns a correct positive result in only 98% of the cases in which the disease is actually present, and a correct negative result in only 97% of the cases in which the disease is not present. Furthermore, .008 of the entire population have this cancer. Determine whether the patient has Cancer or not using MAP hypothesis.

View Solution

4. Explain Brute force Bayes Concept Learning. View Solution

5. What are Consistent Learners? Discuss Maximum Likelihood and Least Square Error Hypothesis. View Solution

6. Describe the Maximum Likelihood Hypothesis for predicting probabilities.

7. Describe the concept of MDL. Obtain the equation for hMDL.

8. Explain Naïve Bayes Classifier with an Example. View Solution

9. What are Bayesian Belief nets? Where are they used?

10. Explain the Bayesian belief network and conditional independence with an example.

Solved Example – 1

Solved Example – 2

Solved Example – 3

## Module 5 – Instance Based Learning, Reinforcement Learning

1. What is instance-based learning? Explain the key features and disadvantages of these methods. – View Solution

2. Explain the K – nearest neighbor algorithm for approximating a discrete-valued target function with pseudo code. Also, explain the distance weighted KNN algorithm for the discrete-valued target function. – View Solution

3. Describe K-nearest Neighbour learning Algorithm for the continuous (real) valued target function. Also, explain the distance weighted KNN algorithm for the real-valued target function. – View Solution

4. Discuss the major drawbacks of the K-nearest Neighbour learning Algorithm and how it can be corrected.

5. Explain Locally Weighted Linear Regression. – View Solution

7. Explain the CADET System using Case-based reasoning.

8. What is Reinforcement Learning and explain the Reinforcement learning problem with a neat diagram? – View Solution

9. Write Reinforcement learning problem characteristics.

10. Explain the Q function and Q Learning Algorithm assuming deterministic rewards and actions with example. – View Solution

Download the 2018 Scheme VTU CBCS Notes and Question Papers of 18CS71 Artificial Intelligence and Machine Learning